Skip to content
#

insertions

Here are 4 public repositories matching this topic...

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 …

  • Updated Jul 13, 2019
  • C++

Add this topic to your repo

To associate your repository with the insertions topic, visit your repo's landing page and select "manage topics."

Learn more