9. An automated dictionary system, comprising: a processor receiving a message containing words; said processor parsing the words of the message; said processor comparing each word to entries of at least one dictionary to identify new words that are not in said at least one dictionary; said processor storing said new words in a supplementary word list; and said processor parsing a group of adjacent words, wherein if none of said adjacent words are found in said at least one dictionary, storing said adjacent words with additional information that allows them to remain linked.
9. An automated dictionary system, comprising: a processor receiving a message containing words; said processor parsing the words of the message; said processor comparing each word to entries of at least one dictionary to identify new words that are not in said at least one dictionary; said processor storing said new words in a supplementary word list; and said processor parsing a group of adjacent words, wherein if none of said adjacent words are found in said at least one dictionary, storing said adjacent words with additional information that allows them to remain linked. 10. The system of claim 9 , wherein the parsing and comparing of the words is performed as each word is retrieved.