Description
A Haskell library for calculating Levenshtein and restricted Damerau-Levenshtein edit distances. It measures how many insertions, deletions, substitutions, or limited transpositions separate two sequences.
Developers use it for fuzzy search, spell checking, suggestions, duplicate detection, and text comparison. Distance thresholds should be tuned to avoid confusing matches for users.