i want to use a levenshtein algorithm to do some fuzzy keyword matching, having tripped over the function while looking for something in the manual.
is there anybody out there who's used it and knows any pitfalls i should beware of?
one specific question i have, what sort of distance is useful for this application? should it be normalised w.r.t. sting length?
--
rad
