The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Rapid fuzzy string matching in C++ using the Levenshtein Distance
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
High-performance and memory efficient native C++ text similarity algorithms for Node.js
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
STL and Boost compatible edit distance functions for C++
A Levenshtein Distance implementation using C++ with a dynamic programming approach.
Fast trie-based search for TCR sequences with Levenshtein and substitution matrix support
Levenshtein distance implementation using a trie for fast string similarity searching
C++ homework code and final project
Approximate pattern matching with Counting Filter on q-grams using SSE instructions (CF2)
Levenshtein distance based string suggestion lib
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 …
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."