Description:
In this project, you ll build a hash table and see an example of hashing in action. Many applications,
including word processors, text editors, and email clients, include a spell-checking feature. A spell
checker s job is relatively simple. Given a list of correctly-spelled words (which we ll call a wordlist)
and the input text, the spell checker reports all of the misspellings (i.e. words that are not found in the
wordlist) in the input. When a misspelling is found in the input, a good spell checker will also suggest
words appearing in the wordlist that are somewhat like each of the misspelled words.
To Search:
File list (Check if you may need any files):
SpellChecker\Program3HashingFall2014Rev.pdf
............\Project Report of 214 assignment 3.docx
............\SpellCheck\Hashnode.cpp
............\..........\Hashnode.h
............\..........\Hashtable.cpp
............\..........\Hashtable.h
............\..........\input
............\..........\Input.cpp
............\..........\Input.h
............\..........\input.txt
............\..........\Makefile
............\..........\Queue.cpp
............\..........\Queue.h
............\..........\spellcheck.cpp
............\..........\Suggest.cpp
............\..........\Suggest.h
............\..........\wordlist
............\SpellCheck
SpellChecker
Download