Spell Checker Data Structure

I think hashing is the possible data structure for spell checker because in hashing we use hash tables hash functions and hash values if we need check the spelling of a word then that word is sent to hash function for checking if it is right then it is stored in the hash table at the produced hash value in this way hashing is very useful in.

Spell checker data structure. Which data structure can be used for efficiently building a word dictionary and spell checker. The controller will read words from an input text file one by one and pass them to the spell checker for processing. Class trienode char letter.

If the spell checker finds an exact match it will simply indicate the word is spelled correctly. It depends entirely on what your specific requirement is and how much memory you want to use in the process. Hashing is one simple option for this.

Spell checker program using trie data structure. I m looking for a data structure who would give me the best compromise between space complexity and runtime complexity. We can put all words in a hash table.

For example following are few possibilities. For example if you are dealing only with english language words then the soundex algorithm can be used to pre process your word corpus. The answer depends upon the functionalists required in spell checker and availability of memory.

The spell checker will incorporate a database of known words built from a simple word list and organized for efficient searching. Trienode char letter boolean fullword.