Levenshtein distance: Difference between revisions

Implementation of the wikipediaWikipedia algorithm. Since column 0 and row 0 are used for base distances, the original algorithm would require us to compare "@s[$i-1] eq @t[$j-1]", and reference the $m and $n separately. Prepending an unused value (undef) onto @s and @t makes their indices align with the $i,$j numbering of @d, and lets us use .end instead of $m,$n.

<lang perl6>sub levenshtein_distancelevenshtein-distance ( Str $s, Str $t --> Int ) {

say "levenshtein_distanceLevenshtein distance('$s', '$t') == ", levenshtein_distancelevenshtein-distance($s, $t);

<pre>levenshtein_distanceLevenshtein distance('kitten', 'sitting') == 3

levenshtein_distanceLevenshtein distance('saturday', 'sunday') == 3

levenshtein_distanceLevenshtein distance('rosettacode', 'raisethysword') == 8</pre>