Levenshtein and Damerau-Levenshtein distance !
Levenshtein Distance Also known as Edit Distance, it is the number of transformations (deletions, insertions, or substitutions) required to transform a source string into the target one. For example, if the target term is “book” and the source is “back”, you will need to ...Tags: Edit, Distance, Levenshtein, Damerau-Levenshtein, distance
943 days ago