There are 0 repository under edit-distance topic.
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
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.
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.
Python library for computing edit distance between arbitrary Python sequences.
Levenshtein edit-distance on PyTorch and CUDA
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
Study group for algorithms in Ruby, hosted at App Academy
Levenshtein algorithm in C
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, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibonacci
Various utilities regarding Levenshtein transducers. (Java)
Sørensen–Dice coefficient
A curated list of papers dedicated to edit-distance as objective function
Fast fuzzy regex matcher: specify max edit distance to find approximate matches. FuzzyMatcher is now included in RE/flex.
A BK tree implementation for fast fuzzy string matching
:triangular_ruler: Hidden alignment conditional random field for classifying string pairs.
Instant auto suggestion and completion
A Javascript library for fuzzy substring search.
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
Custom TensorFlow2 implementations of forward and backward computation of soft-DTW algorithm in batch mode.
A set of (string) distance functions written in JavaScript / Python / PHP.
:heavy_division_sign: SIMD-accelerated bitwise hamming distance Python module for hexadecimal strings
To evaluate machine translation, they use several methods, some of which we fully implemented