There are 1 repository under levenshtein-distance topic.
Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Rapid fuzzy string matching in Python using various string metrics
Python port of SymSpell
Pure Python Spell Checking http://pyspellchecker.readthedocs.io/en/latest/
Fuzzy string matching, grouping, and evaluation.
Swift μ-framework for efficient array diffs and datasource adapters.
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
A .NET port of java-string-similarity
String metrics library written in Go.
Go implementation to calculate Levenshtein Distance.
Spelling corrector in python
Text2Text: Multilingual tokenization, embedding, search, translation, summarization, question generation, question answering, data augmentation, distance measurement
Python BK-tree data structure to allow fast querying of "close" matches
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
String Distances in Julia
Port of SeatGeek's fuzzywuzzy
String metric/similarity functions implemented in Swift.
Calculate text distance (similarity) in Golang - Experimental implementation
A Python 3 phonetics library.
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Enable git-like did-you-mean feature in click :sparkles:
Levenshtein algorithm in C
SymSpellCompound: compound aware automatic spelling correction
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..
:triangular_ruler: A Cython implementation of the affine gap string distance
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Various utilities regarding Levenshtein transducers. (Java)
Fast approximate strings search & spelling correction
Calculate various string metrics efficiently in Haskell
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell
English word spelling correction program
A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.