Search

Updated: 15.09.2019
  • Damerau-Levenshtein distance

    Damerau-Levenshtein distance is a metric for determining the distance between two lines. It can be defined as the minimum number of deletion, insertion, replacement, and transposition operations (permutation of two adjacent characters) needed to convert one line to another.

    Read more...
  • Levenshtein distance

    Levenshtein distance (editorial distance, editing distance) - the minimum number of operations of deleting, inserting and replacing a character necessary to convert one line to another.

    Read more...
comments powered by Disqus