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 🦖

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.

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

Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.

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

:abc: 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

Fast approximate string searching

Trie data structure meant for auto-completion use cases. Supports prefix and edit 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 algorithm in C

Study group for algorithms in Ruby, hosted at App Academy

Levenshtein edit-distance on PyTorch and CUDA

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, Fibonacci

Sørensen–Dice coefficient

Fast approximate strings search & spelling correction

Various utilities regarding Levenshtein transducers. (Java)

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 Javascript library for fuzzy substring search.

A BK tree implementation for fast fuzzy string matching

Calculating Edit Distance with PySpark

Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.