The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Fast fuzzy regex matcher: specify max edit distance to find approximate matches. FuzzyMatcher is now included in RE/flex.
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Fast fuzzy string search
package for exact edit similarity joins
STL and Boost compatible edit distance functions for C++
A collection of commonly used math routines, so I don't have to write them again. Implementations in C, C++, Rust, and Python (though not so much in Python as it already has a pretty good set of libraries).
A Levenshtein Distance implementation using C++ with a dynamic programming approach.
This application is an implementation of a spell checker for English text. The spell checker incorporates a database of known words, which is built from a simple word list. The Burkhard-Keller Tree (BK-Tree for short) organizes the word list for efficient searching.
Levenshtein distance implementation using an automaton and a trie for fast string similarity searching
A program that checks spelling of given word, if wrong then recommends words.
Fast Batch String Matching in Python (Levenshtein, Jaro-Winkler, Hamming) with Zero Cache Misses - made for Python, written in C++
A blazing fast dictionary for the Terminal.
A library for fuzzy-string-searching using suffix trees and levenschtein automatons to perform extremely fast search queries on large data sets. Serialize and deserialize functions allow suffix trees to persist (and drastically reduce preprocessing time).
A C++11 port of Buffer, μ-framework for efficient array diffs, collection observation and data source implementation.
dynamic time warping implemented in C++ with bindings in python
Keyboard aware fuzzy text matching
Grep-like command line utlity for fuzzy string matching
Levenshtein distance implementation using a trie for fast string similarity searching
A single header C++ library for compute edit distance (Levenshtein distance), supporting wstring ( and Chinese string).
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."