April 15th, 2003, 10:22 PM
-
Writing a spellchecker
Hey guys. Check out the following article. I will be glad for comments, suggestions and any fixes
April 17th, 2003, 07:44 AM
-
Could you store the dictionary as one huge b-tree with 26 branches on each level for the 26 letters of the alphabet? This would make storing of the dictionary smaller and quicker to access.
I.E.
Code:
and
ant
at
a
/ \
n t
/ \
d t
As you can see, the letter 'a' is only stored once (less memory) and the b-tree structure allows quick access.