There are 3 repositories under string-distance topic.
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
A .NET port of java-string-similarity
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
String Distances in Julia
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
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...
Beda is a golang library for detecting how similar a two string
A Privacy focused, easy sharable, open source and trackingless diff viewer.
Collection of sequence alignment algorithms.
A set of (string) distance functions written in JavaScript / Python / PHP.
A Python library for calculating string distances using C extensions (with a pure Python fallback)
A project for string similarities.
A Java library for computation on permutations and sequences
Deduplicate data using fuzzy and deterministic matching rules.
A collection of string comparisons algorithms
A python implementation of a variety of text/string distance and similarity metrics. No GPL!
Matching records based on imperfect strings using string distances to assign the closest match. Optimized for large files on a single computer.
String trie that supports wildcard search