[Snow-users-list] Ok, how about this one? (Levenshtein Distance Metric in Scheme)

Matthew Martin matt.a.martin at gmail.com
Thu Feb 28 17:41:03 EST 2008

>From http://www.neilvandyke.org/levenshtein-scm/

"This is a Scheme implementation of the Levenshtein Distance
algorithm, which is an edit distance metric of string similarity. The
Levenshtein Distance is a function of two strings that represents a
count of single-character insertions, deletions, and substitions that
will change the first string to the second. The algorithm is due to
Vladimir Levenshtein. More information is available in [DADS] and

It's ready to go, but I havn't a clue what a sensible keyword(s) would be?

More information about the Snow-users-list mailing list