#算法刷题#📐 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：通过“对称删除”拼写校正算法快一百万倍
Rapid fuzzy string matching in Python using various string metrics
翻译 - 使用Levenshtein距离的Python和C ++快速模糊字符串匹配
🪼 a python library for doing approximate and phonetic matching of strings.
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Easy to use and powerful fuzzy string matching, port of fuzzywuzzy.
#算法刷题#📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, ...
🔤 Rust implementations of string similarity metrics
Golang library for fuzzy matching within a set of strings 📃
Go implementation to calculate Levenshtein Distance.
set of functions and operators for executing similarity queries
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
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
Rapid fuzzy string matching in C++ using the Levenshtein Distance
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
A CLI spelling corrector for when you're unsure