SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
翻译 - SymSpell：通过“对称删除”拼写校正算法快一百万倍
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Fuzzy string matching, grouping, and evaluation.
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
#算法刷题#📚 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.
🔤 Rust implementations of string similarity metrics
#IOS#Swift μ-framework for efficient array diffs and datasource adapters.
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
#算法刷题#A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Python library for computing edit distance between arbitrary Python sequences.
#自然语言处理#Levenshtein edit-distance on PyTorch and CUDA
#算法刷题#Study group for algorithms in Ruby, hosted at App Academy
Levenshtein algorithm in C
super fast cpp implementation of longest common subsequence/substring
SymSpellCompound: compound aware automatic spelling correction
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusa...
Fast approximate strings search & spelling correction