levenshtein package:text-metrics

Return the Levenshtein distance between two Text values. The Levenshtein distance between two strings is the minimal number of operations necessary to transform one string into another. For the Levenshtein distance allowed operations are: deletion, insertion, and substitution. See also: https://en.wikipedia.org/wiki/Levenshtein_distance. Heads up, before version 0.3.0 this function returned Natural.

levenshteinNorm :: Text -> Text -> Ratio Int

text-metrics Data.Text.Metrics

Return the normalized Levenshtein distance between two Text values. Result is a non-negative rational number (represented as Ratio Natural), where 0 signifies no similarity between the strings, while 1 means exact match. See also: https://en.wikipedia.org/wiki/Levenshtein_distance. Heads up, before version 0.3.0 this function returned Ratio Natural.

damerauLevenshtein :: Text -> Text -> Int

text-metrics Data.Text.Metrics

Return the Damerau-Levenshtein distance between two Text values. The function works like levenshtein, but the collection of allowed operations also includes transposition of two adjacent characters. See also: https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance. Heads up, before version 0.3.0 this function returned Natural.

damerauLevenshteinNorm :: Text -> Text -> Ratio Int

text-metrics Data.Text.Metrics

Return the normalized Damerau-Levenshtein distance between two Text values. 0 signifies no similarity between the strings, while 1 means exact match. See also: https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance. Heads up, before version 0.3.0 this function returned Ratio Natural.