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

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

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

🎯 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 📃

📚 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.

set of functions and operators for executing similarity queries

🔤 Rust implementations of string similarity metrics

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

Abydos NLP/IR library for Python

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.

Golang metrics for calculating string similarity and other string utility functions

Levenshtein edit-distance on PyTorch and CUDA

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

Levenshtein algorithm in C

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

SymSpellCompound: compound aware automatic spelling correction

How similar are these two strings?

Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.

String similarity metrics for Elixir

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