Spell checker |
You, as a member of a development team for a new spell checking program, are to write a module that will check the correctness of given words using a known dictionary of all correct words in all their forms.
If the word is absent in the dictionary then it can be replaced by correct words (from the dictionary) that can be obtained by
one of the following operations:
Your task is to write the program that will find all possible replacements from the dictionary for every given word.
The next part of the file contains all words that are to be checked. Each word occupies its own line. This part is also finished by
the single character `#' on a separate line. There will be at most 50 words that are to be checked.
All words in the input file (words from the dictionary and words to be checked) consist only of small alphabetic characters and
each one contains 15 characters at most.
i is has have be my more contest me too if award # me aware m contest hav oo or i fi mre #
me is correct aware: award m: i my me contest is correct hav: has have oo: too or: i is correct fi: i mre: more me