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

Marc Feeley feeley at iro.umontreal.ca
Thu Feb 28 17:53:16 EST 2008

On 28-Feb-08, at 5:41 PM, Matthew Martin wrote:

>> 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
> [Gilleland]."
> It's ready to go, but I havn't a clue what a sensible keyword(s)  
> would be?

That seems to be appropriate for a "text" keyword, or "comparison".   
And then there's always "misc".


More information about the Snow-users-list mailing list