Talk:Levenshtein distance: Difference between revisions
Content added Content deleted
(how to test?) |
(Never mind, fixed (was initializing D with all 0s instead of 0..m and 0..n)) |
||
| Line 1: | Line 1: | ||
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? --[[User:Rdm|Rdm]] 18:56, 11 January 2011 (UTC) |
|||