SpellDictionary
that doesn't cache any words in memory. Avoids the huge footprint of SpellDictionaryHashMap
at the cost of relatively minor latency. A future version of this class that implements some caching strategies might be a good idea in the future, if there's any demand for it. This implementation requires a special dictionary file, with "code*word" lines sorted by code. It's using a dichotomy algorithm to search for words in the dictionary
@author Damien Guillaume
@version 0.1
|
|