Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.

Rapid fuzzy string matching in Python using various string metrics

Golang metrics for calculating string similarity and other string utility functions

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

A Tool for Measuring String Similarity

Record Linkage ToolKit (Find and link entities)

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.

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

Lightning fast spell correction / fuzzy search library based on SymSpell by Commerce-Experts

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

Lightweight string similarity function for javascript

Python library for fast approximate string matching using Jaro and Jaro-Winkler similarity

Accelerating the deduplication and collapsing process for reads with Unique Molecular Identifiers (UMI). Heavily optimized for scalability and orders of magnitude faster than a previous tool.

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

string similarity based on Dice's coefficient in go

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

Learning String Alignments for Entity Aliases

Learned string similarity for entity names using optimal transport.