damerau-levenshtein

📐 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

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

SymSpellCompound: compound aware automatic spelling correction

Fast approximate strings search & spelling correction

PySpark phonetic and string matching algorithms

Get text similarity level with Damerau-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

Efficient String Comparison Functions and Fuzzy String Matching

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