Package com.swabunga.spell.engine
package com.swabunga.spell.engine
-
ClassDescriptionThe various settings used to control how a spell checker works are read from here.A phonetic encoding algorithm that takes an English word and computes a phonetic version of it.This class is based on Levenshtein Distance algorithms, and it calculates how similar two words are.The SpellDictionary class holds the instance of the dictionary.A Generic implementation of a transformator takes an aspell phonetics file and constructs some sort of transformation table using the inner class TransformationRule.Implementation class to read the properties controlling the spell engine.An interface for all dictionary implementations.Container for various methods that any
SpellDictionary
will use.Yet anotherSpellDictionary
this one is based on Damien Guillaume's Diskbased dictionary but adds a cache to try to improve abit on performance.Another implementation ofSpellDictionary
that doesn't cache any words in memory.An implementation ofSpellDictionary
that doesn't cache any words in memory.The SpellDictionaryHashMap holds the dictionaryAn interface for all Transformators - which take a dictionary word and converts into its phonetic hash.The Word object holds information for one suggested spelling.