edit-distance topic
edlib
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
Quickenshtein
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
go-edlib
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
strsim-rs
:abc: Rust implementations of string similarity metrics
Buffer
Swift μ-framework for efficient array diffs and datasource adapters.
SymSpell
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
symspellpy
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
PolyFuzz
Fuzzy string matching, grouping, and evaluation.
js-levenshtein
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Algorithms-Study-Group
Study group for algorithms in Ruby, hosted at App Academy