A .NET port of java-string-similarity
-
Updated
Jan 15, 2026 - C#
A .NET port of java-string-similarity
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
High-performance fuzzy string matching for .NET with bit-parallel Levenshtein/Indel algorithms, FuzzyWuzzy-compatible scorers, and fast extraction APIs.
A project for string similarities.
A project for string similarities.
A fuzzy string dictionary based on Levenshtein automata
C# version of calculating the Damerau Levenshtein Distance. Code is based on the Wikipedia article.
Keyboard‑aware Damerau‑Levenshtein for .NET: detects real typos using key proximity and finds the best match fast.
To associate your repository with the string-distance topic, visit your repo's landing page and select "manage topics."