Data Structures and Algorithms
The application displays a menu which allows you to select which .txt document you want to read from to use as a dictionary. After initializing dictionary, select from 7 operations which simulate basic dictionary search functions.
- insert()
Inserts word into a .txt document.
- search()
Gets input word, checks word with dictionary, returns true if found, returns false if not found.
- searchClosest()
Gets input string, returns all words that have prefix matching string in dictionary.
- traverse()
Gets a starting pointer, recursively cout every existing word in that dictionary after that point.
- searchErrorIteration()
Gets input, checks if string is valid word without 1 insertion error, suggests correct word.
- searchErrorDeletion()
Gets input, checks if string is valid word without 1 deletion error, suggests correct word.
- searchErrorSubstitution()
Gets input, checks if string is valid word without 1 substitution error, suggests correct word.
- searchErrorTransposition()
Gets input, checks if string is valid word without 1 transposition error, suggests correct word.
Check out the wiki for an indepth explanation of how each function works.