#算法刷题#📐 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 ++快速模糊字符串匹配
#算法刷题#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
Fuzzy string matching, grouping, and evaluation.
Pure Python Spell Checking http://pyspellchecker.readthedocs.io/en/latest/
#算法刷题#📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
#自然语言处理#Spelling corrector in python
#算法刷题#A .NET port of java-string-similarity
Go implementation to calculate Levenshtein Distance.
#IOS#Swift μ-framework for efficient array diffs and datasource adapters.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
#自然语言处理#Text2Text Language Modeling Toolkit
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
🦀📏 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
Python BK-tree data structure to allow fast querying of "close" matches
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.