|
|||||||||
|
|||||||||
| |||||||||
|
|||||||||
|
|||||||||
| |||||||||
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Rate Thread | Display Modes |
Dev Shed Forums Sponsor:
|
|
|
|
#1
April 15th, 2003, 11:22 PM
|
|||
|
|||
|
Writing a spellchecker
Hey guys. Check out the following article. I will be glad for comments, suggestions and any fixes
|
|
#2
April 17th, 2003, 08: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
__________________
Matthew Doucette / Xona.com
|
|
| Viewing: Dev Shed Forums > Programming Languages - More > Software Design > Writing a spellchecker |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
