A BK tree implementation for fast fuzzy string matching
-
Updated
Jul 24, 2018 - C#
A BK tree implementation for fast fuzzy string matching
An implementation of a BK-tree (metric tree) for spell checking. It presents a fast lookup for words within a specified distance.
Add a description, image, and links to the bk-tree topic page so that developers can more easily learn about it.
To associate your repository with the bk-tree topic, visit your repo's landing page and select "manage topics."