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

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 🦖

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.

🔤 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.

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

Python library for computing edit distance between arbitrary Python sequences.

Levenshtein edit-distance on PyTorch and CUDA

Study group for algorithms in Ruby, hosted at App Academy

Levenshtein algorithm in C

Fast approximate string searching

AStarix: Fast and Optimal Sequence-to-Graph Aligner

super fast cpp implementation of longest common subsequence/substring

SymSpellCompound: compound aware automatic spelling correction