A BK Tree using the Levenshtein Distence as metric to impliment a spell checker
-
Updated
Jul 23, 2019 - C++
A BK Tree using the Levenshtein Distence as metric to impliment a spell checker
This application is an implementation of a spell checker for English text. The spell checker incorporates a database of known words, which is built from a simple word list. The Burkhard-Keller Tree (BK-Tree for short) organizes the word list for efficient searching.
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."