The BK-Tree – A Data Structure for Spell Checking | NullWords Blog
To build a BK-Tree all you have to do is take any word from your set and plop it in as your root node, and then add words to the tree based on their distance to the root. For instance if I started a tree with the word set [book, books, cake] then my tree would look like this if I started by making the word book my root node:
Read full article from The BK-Tree – A Data Structure for Spell Checking | NullWords Blog
No comments:
Post a Comment