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.

Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

Fuzzy string matching, grouping, and evaluation.

🔤 Rust implementations of string similarity metrics

The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.

Study group for algorithms in Ruby, hosted at App Academy

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

super fast cpp implementation of longest common subsequence/substring

Various utilities regarding Levenshtein transducers. (Java)

SymSpellCompound: compound aware automatic spelling correction

Instant auto suggestion and completion

Python library for computing edit distance between arbitrary Python sequences.

Levenshtein edit-distance on PyTorch and CUDA

Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

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, Fibo…

Levenshtein algorithm in C

Swift μ-framework for efficient array diffs and datasource adapters.

📐 Hidden alignment conditional random field for classifying string pairs.

A Java library for computation on permutations and sequences