There are 2 repositories under levenshtein topic.
Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
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: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
:dart: String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, Refined Soundex, Soundex, Weighted Levenshtein).
Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
Golang library for fuzzy matching within a set of strings :page_with_curl:
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
set of functions and operators for executing similarity queries
Go implementation to calculate Levenshtein Distance.
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
The fastest .Net Levenshtein around
A CLI spelling corrector for when you're unsure
Finite state dictionaries in Java
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
Rapid fuzzy string matching in C++ using the Levenshtein Distance
Python library for computing edit distance between arbitrary Python sequences.
Ruby gem (native extension in Rust) providing implementations of various string metrics
Levenshtein edit-distance on PyTorch and CUDA
Levenshtein algorithm in C
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
SymSpellCompound: compound aware automatic spelling correction
How similar are these two strings?
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..
Levenshtein edit distance. No cruft. Real fast.
A curated list of papers dedicated to edit-distance as objective function
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
SpellcheckerWasm is an extrememly fast spellchecker for WebAssembly based on SymSpell