Talk:Levenshtein distance

From Rosetta Code
Revision as of 18:56, 11 January 2011 by Rdm (talk | contribs) (how to test?)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

I was coding up a simple implementation of this algorithm, and I get 3 for the distance between the 'kitten' and 'sitting' but I noticed that when I reverse the two strings I get a Levenshtein distance of 2. (That is, between 'nettik' and 'gnittis'). Is this reasonable? Or do I have a bug in my code? Is there a good corpus of examples that code can be tested against? --Rdm 18:56, 11 January 2011 (UTC)

Retrieved from "https://rosettacode.org/wiki/Talk:Levenshtein_distance?oldid=169948"