Levenshtein distance: Difference between revisions
Content added Content deleted
(Created page with "http://en.wikipedia.org/wiki/Levenshtein_distance http://en.wikipedia.org/wiki/Levenshtein_distance In Python:") |
(Mark as draft (I presume it's going to be a task…)) |
||
| Line 1: | Line 1: | ||
{{draft task}} |
|||
[[http://en.wikipedia.org/wiki/Levenshtein_distance http://en.wikipedia.org/wiki/Levenshtein_distance]] |
[[http://en.wikipedia.org/wiki/Levenshtein_distance http://en.wikipedia.org/wiki/Levenshtein_distance]] |
||
Revision as of 10:28, 10 January 2011
Levenshtein distance is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
[http://en.wikipedia.org/wiki/Levenshtein_distance]
In Python: