Rapid fuzzy string matching in Python using various string metrics
-
Updated
Jan 24, 2026 - Python
Rapid fuzzy string matching in Python using various string metrics
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
String manipulation, leveled up!
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
🔀 Extension method for StringComparison that adds support for natural sorting (e.g. "abc1", "abc2", "abc10" instead of "abc1", "abc10", "abc2").
Python library for fast approximate string matching using Jaro and Jaro-Winkler similarity
Ruby gem (native extension in Rust) providing implementations of various string metrics
🤠A library implementing different string similarity using JavaScript.
string similarity based on Dice's coefficient in go
A collection of metrics and phonetic algorithms for fuzzy string matching in Elixir.
Extensions for sorting strings using natural sort order i.e. Alphabetical order for humans
CyDifflib is a fast implementation of difflib's algorithms, which can be used as a drop-in replacement.
A collection of string comparisons algorithms
CmpStr is a lightweight, fast and well performing package for calculating string similarity
Class library to compare strings in a relative way.
regular expression functionality for ctrl+f search
strcompare is a library for comparing strings using Hamming, Levenshtein, and Damerau-Levenshtein metrics.
Add a description, image, and links to the string-comparison topic page so that developers can more easily learn about it.
To associate your repository with the string-comparison topic, visit your repo's landing page and select "manage topics."