A BK tree implementation for fast fuzzy string matching
-
Updated
Jul 24, 2018 - C#
A BK tree implementation for fast fuzzy string matching
DNA sequence matcher
Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings
Library of tools for fuzzy matching.
Fast approximate strings search & spelling correction
IEnumerableCorrelater knows to compare two IEnumerables or strings. It returns the distance between them, and returns two arrays which represent their "best match". IEnumerableCorrelater can be used to create diff tools.
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."