📐 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

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

📚 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

🔤 Rust implementations of string similarity metrics

🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.

pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.

Ruby gem (native extension in Rust) providing implementations of various string metrics

SymSpellCompound: compound aware automatic spelling correction

Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm

Fast approximate strings search & spelling correction

Get text similarity level with Damerau-Levenshtein distance

PySpark phonetic and string matching algorithms

Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.

Cython implementation of true Damerau-Levenshtein algorithm.

Efficient String Comparison Functions and Fuzzy String Matching

String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect