Algorithms for edit distance calculation.
levenshtein : List comparable -> List comparable -> Basics.Int
Finds the Levenshtein distance
between two List comparable
in O(mn)
.
kitten = String.toList "kitten"
sitten = String.toList "sitten"
sittin = String.toList "sittin"
sitting = String.toList "sitting"
levenshtein kitten sitten == 1
levenshtein sitten sittin == 1
levenshtein sittin sitting == 1
levenshteinOfStrings : String -> String -> Basics.Int
Like levenshtein, but takes two String
as input.