Skip to content
#

insertions

Star

Here are 3 public repositories matching this topic...

Language: All
Filter by language
All 3 C++ 1 JavaScript 1 Python 1

CTzatzakis / Damerau-Levenshtein-distance

Star 0

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++

Improve this page

Add a description, image, and links to the insertions topic page so that developers can more easily learn about it.

Curate this topic

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