edit-distance
There are 202 repositories under edit-distance topic.
wolfgarbe/SymSpell
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
ashvardanian/StringZilla
Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖
mammothb/symspellpy
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
MaartenGr/PolyFuzz
Fuzzy string matching, grouping, and evaluation.
hbollon/go-edlib
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Martinsos/edlib
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
gustf/js-levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
rapidfuzz/strsim-rs
:abc: Rust implementations of string similarity metrics
alexdrone/Buffer
Swift μ-framework for efficient array diffs and datasource adapters.
Turnerj/Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
shivamMg/trie
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
foray1010/didyoumean2
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
belambert/edit-distance
Python library for computing edit distance between arbitrary Python sequences.
1ytic/pytorch-edit-distance
Levenshtein edit-distance on PyTorch and CUDA
Haseeb-Qureshi/Algorithms-Study-Group
Study group for algorithms in Ruby, hosted at App Academy
wooorm/levenshtein.c
Levenshtein algorithm in C
eth-sri/astarix
AStarix: Fast and Optimal Sequence-to-Graph Aligner
RagnarGrootKoerkamp/sassy
Fast approximate string searching
Meteorix/pylcs
super fast cpp implementation of longest common subsequence/substring
wolfgarbe/SymSpellCompound
SymSpellCompound: compound aware automatic spelling correction
je-suis-tm/recursion-and-dynamic-programming
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
words/dice-coefficient
Sørensen–Dice coefficient
wolfgarbe/LinSpell
Fast approximate strings search & spelling correction
universal-automata/liblevenshtein-java
Various utilities regarding Levenshtein transducers. (Java)
1ytic/edit-distance-papers
A curated list of papers dedicated to edit-distance as objective function
Genivia/FuzzyMatcher
Fast fuzzy regex matcher: specify max edit distance to find approximate matches. FuzzyMatcher is now included in RE/flex.
AsadiAhmad/Edit-Distance-Spark
Calculating Edit Distance with PySpark
pekoto-zz/FastFuzzyStringMatcherDotNet
A BK tree implementation for fast fuzzy string matching
taleinat/levenshtein-search
A Javascript library for fuzzy substring search.
dedupeio/pyhacrf
:triangular_ruler: Hidden alignment conditional random field for classifying string pairs.
mammothb/editdistpy
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
nikcomestotalk/autosuggest
Instant auto suggestion and completion
schiffma/distlib
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
poke1024/simtrie
An efficient data structure for fast string similarity searches
zzw922cn/TF2_soft_dtw
Custom TensorFlow2 implementations of forward and backward computation of soft-DTW algorithm in batch mode.
OlivierBinette/StringCompare
Efficient String Comparison Functions and Fuzzy String Matching