#算法刷题#📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
翻译 - 计算序列之间的距离。 30+算法，纯python实现，通用接口，可选的外部库使用。
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
翻译 - SymSpell：通过“对称删除”拼写校正算法快一百万倍
#算法刷题#Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
#算法刷题#📚 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
🔤 Rust implementations of string similarity metrics
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Ruby gem (native extension in Rust) providing implementations of various string metrics
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
SymSpellCompound: compound aware automatic spelling correction
Fast approximate strings search & spelling correction
PySpark phonetic and string matching algorithms
Get text similarity level with Damerau-Levenshtein distance
#算法刷题#Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Cython implementation of true Damerau-Levenshtein algorithm.
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Efficient String Comparison Functions and Fuzzy String Matching