Abstract: A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During attempted verfication of a text word, all initial substrings of the word found in the dictionary are saved in a list. If the entire word is not found in the dictionary, the longest substring in the substring list is subtracted from the entire word to be verified to yield a "remainder" portion of the input text word. The dictionary words are then compared with this remainder portion to determine if a match occurs. If so, then both portions of the word are found in the dictionary and spelling of the word is considered correct. If the remainder is not found in the dictionary, successively shorter initial substrings are accessed to yield successively longer remainders. The word is considered correctly spelled if both a substring and a remainder are found in the dictionary. This techinque is applied recursively so that multiple-piece compounds can also be found.

Abstract: A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During verification of a text word, an attempt is made to find a pair of words in the dictionary of which the text word consists. A table associated with the dictionary includes compound class information relative to each of the words stored therein. The compound class of each of the pair of words of which the input text word consists are tested for compatibility to determine if each of the pair of words may acceptably be used in a compound word in the physical position in which it is found in the input text word.