The Levenshtein-distance code I posted uses the agrep algorithm.
Tim
Peter Eisentraut wrote:
>Josh Berkus writes:
>
>>For many of my programs, it would be extremely useful to have some form
>>of "fuzzy matching" for VARCHAR fields.
>>
>
>For lexical similarity, check out the agrep algorithm. Last I checked the
>source code wasn't quite Free(tm), but the algorithm was published in an
>academic work.
>
--
Timothy H. Keitt
Department of Ecology and Evolution
State University of New York at Stony Brook
Stony Brook, New York 11794 USA
Phone: 631-632-1101, FAX: 631-632-7626
http://life.bio.sunysb.edu/ee/keitt/
