Damerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one …
cplusplus levenshtein transposition substitutions damerau string-metric adjacent-characters damerau-levenshtein-distance insertions
-
Updated
Jul 13, 2019 - C++