There are 0 repository under damerau topic.
Damerau - Levenstein distance function for node
Library of tools for fuzzy matching.
Calculate the true Damerau–Levenshtein distance of string A and B
Represent large sets and maps compactly with finite state transducers.
Calculate the Damerau–Levenshtein distance between strings.
Experiments in fuzzy text searching
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 word into the other.