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

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

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.

Python library for computing edit distance between arbitrary Python sequences.

a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm

Levenshtein edit-distance on PyTorch and CUDA

Study group for algorithms in Ruby, hosted at App Academy

Levenshtein algorithm in C

AStarix: Fast and Optimal Sequence-to-Graph Aligner

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, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibo…

Fast approximate strings search & spelling correction