Rapid fuzzy string matching in Python using various string metrics
翻译 - 使用Levenshtein距离的Python和C ++快速模糊字符串匹配
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
翻译 - 根据Dice系数找出两个字符串之间的相似度,该相似度通常比Levenshtein距离更好。
Go 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
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and 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.
Lightweight string similarity function for javascript
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
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 si...
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.
Python library for fast approximate string matching using Jaro and Jaro-Winkler similarity
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.