Now, SpellChecker use the trigram algorithm to find similar words. It
works well for keyboard fumbles, but not well enough for short words
and for languages like french where a same sound can be wrote
differently.
Spellchecking is a classical computer task, and aspell provides some
nice and
Instead of "overriding" the trigram approach you may want to do a
combination. That is create trigrams out of the list of words from the
dictionary and weigh the matches much higher than those coming from the
index or even have a first dictionary exact lookup and then a trigram/index
based lookup
: Now, SpellChecker use the trigram algorithm to find similar words. It
: works well for keyboard fumbles, but not well enough for short words
: and for languages like french where a same sound can be wrote
: differently.
: Spellchecking is a classical computer task, and aspell provides some
: nic
The SpellChecker code mix indexing function, ngram treatment, and
querying functions. Extending it will not produce clean code.
Is it relevant to first refactor SpellChecker code for extracting
dictionary reading function and indexing/searching functions?
SpellChecker will get a method to add
