levenshtein

📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

Rapid fuzzy string matching in Python using various string metrics

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

🪼 a python library for doing approximate and phonetic matching of strings.

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

Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

🎯 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).

🔤 Rust implementations of string similarity metrics

Go implementation to calculate Levenshtein Distance.

Golang library for fuzzy matching within a set of strings 📃

Go metrics for calculating string similarity and other string utility functions

set of functions and operators for executing similarity queries

The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity

Rapid fuzzy string matching in C++ using the Levenshtein Distance

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

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

The fastest .Net Levenshtein around

A CLI spelling corrector for when you're unsure