Compound word spelling verification

• US 4,701,851 A
• Filed: 10/24/1984
• Issued: 10/20/1987
• Est. Priority Date: 10/24/1984
• Status: Expired due to Fees

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Neff, Mary S., Bass, Vance R., Bonebrake, Veronica A., Garrison, David A., Williams, Susan C., Landis, James K., Urquhart, Robert J.
• Primary Examiner(s): Goldberg, E. A.
• Assistant Examiner(s): Donovan, Lincoln
• Application Number:
  US06/664,183
• Time in Patent Office: 1,091 Days
• Field of Search: 364/419, 364/900, 364/200, 369/83, 400/63
• US Class Current: 715/257
• CPC Class Codes: G06F 40/232 Orthographic correction, e.g. spell checking or vowelisation

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.

Claims

1. In a computer system including a dictionary against which text words are compared for spelling verification, a method of verifying the spelling of an input text compound word which word is not stored in said dictionary, comprising:

identifying a longest dictionary word which is an initial substring of said compound word;

determining a first remainder of said compound word which consists of that portion of said compound word succeeding said initial substring;

comparing said first remainder with said dictionary; and

signaling that said compound word is correctly spelled if said first remainder is found in said dictionary.

2. In the method of claim 1, wherein said step of comparing said first remainder with said dictionary further comprises:

searching said dictionary and building a list of initial remainder substrings of said first remainder;

beginning with the longest of said initial remainder substrings, determining a second remainder of said longest of said initial remainder substrings; and

signaling that said first remainder is found in said dictionary if said second remainder is found in said dictionary.

3. In a computer system including a dictionary against which text words are compared for spelling verification, a method of verifying the spelling of an input text compound word which word is not stored in said dictionary, comprising:

searching said dictionary and building a list of initial substrings of said compound word found in said dictionary;

beginning with the longest of said substrings, determining a first remainder of said word;

comparing said first remainder with said dictionary; and

if said first remainder is not found in said dictionary, determining successively longer remainders which complement successively shorter ones of said substrings;

comparing said successively longer remainders with said dictionary until one of said successively longer remainders is found in said dictionary; and

signaling that said compound word is correctly spelled upon said one of said successively longer remainders being found in said dictionary.

4. In the method of claim 3, further comprising signaling that said compound word is not correctly spelled if no remainder is found in said dictionary.

5. In the method of claim 3, wherein said step of comparing said first remainder with said dictionary further comprises:

searching said dictionary and building a list of initial remainder substrings of said first remainder, each of said initial remainder substrings consisting of a word found in both said dictionary and said first remainder;

beginning with the longest of said initial remainder substrings, determining a second remainder of said longest of said initial remainder substrings; and

signaling that said first remainder is found in said dictionary if said second remainder is found in said dictionary.

6. In the method of claim 3, wherein said step of comparing each of said successively longer remainders further comprises:

for a shortest of said successively longer remainders, searching said dictionary and building a list of second initial substrings of said shortest of said successively longer remainders;

beginning with the longest of said second initial remainder substrings, determining a third remainder of said longest of said second initial remainder substrings; and

signaling that said one of said successively longer remainders is found in said dictionary if said third remainder is found in said dictionary.

7. In the methods of claims 3, 4, 5, or 6 wherein said step of searching said dictionary further comprises:

searching only those words in said dictionary having a predetermined sequence of beginning letters which exactly match an equal length sequence of beginning letters of a substring or remainder being matched against the words in said dictionary.

8. In the method of claim 7 wherein the length of said predetermined sequence of beginning letters is two letters.

9. In the method of claim 7 wherein the length of said predetermined sequence of beginning letters is three letters.