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

A powerful and modular toolkit for record linkage and duplicate detection in Python

Java fuzzy string matching implementation of the well known Python's fuzzywuzzy algorithm. Fuzzy search for Java

📚 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

Go metrics for calculating string similarity and other string utility functions

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

Natural Language Processing (NLP) library for Crystal

String Distances in Julia

Lexicographically-subdivide the “space” between strings, by defining an alternate non-base-ten number system using a pre-defined dictionary of symbol↔︎number mappings. Handy for ordering NoSQL keys.

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

A Privacy focused, easy sharable, open source and anonymous tracking diff viewer.

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

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

Fuzzy string matching for PHP

String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...

📐 A Cython implementation of the affine gap string distance

Beda is a golang library for detecting how similar a two string

Learned string similarity for entity names using optimal transport.

Collection of sequence alignment algorithms.