README About Versions Source Modules

EditDistance

Algorithms for edit distance calculation.

Levenshtein distance

levenshtein : List comparable -> List comparable -> 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 -> Int

Like levenshtein, but takes two String as input.

Modules

EditDistance