|Subject||Re: trying to avoid large datasets|
--- In firstname.lastname@example.org, Florian Hector <FHector@...>
>that calculates how many single
> What you need is the "levenshtein distance". This is an algorithm
> characters have to be swapped, added, shifted or left out to get twostrings to be the same.
>would i be better off writing it as a udf or a stored procedure?
> Ask aunt google for it, it returns a heap of sites.