EP0283685A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
A spelling assistance method for compound words
Assignee: International Business Machines Corp
•
Filing: 1988-02-05
•
Granted: —
•
Expires: 2008-02-05
Abstract
Abstract This invention describes a method for automatically providing correctly spelled compound words as candidates to replace a misspelled compound word in many natural languages such as Dutch, Danish, German, Icelandic, Norwegian, Swedish, Swiss German, etc. The basic technique consists of looking up words in a dictionary by the association of component flags with each possible constituent word within the misspelled compound word as well as with the possible replacement candidates for each letter string between these possible constituent words, and by the application of powerful tree-scanning techniques that isolate the possible components of a compound word and determine their correctness in isolation and association of each other.
Inventors
- 👤 Antonio Zamora
- 👤 Rudolf Arnold Frisch
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-11-08 10:47
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 6
Claim 1
Independent Claim
208 words
A method for identifying an unknown component in a compound word and providing spelling candidates within the context of the compound word, comprising the steps of: inputting a compound word from a stream of text; matching the initial components of the input compound word to the entries in a dictionary data base; terminating the analysis if the complete compound word is matched with an entry in said dictionary; identifying the unknown component as the leading component of said compound word if the leading component thereof was not matched with said dictionary; matching successive groups of contiguous characters in said compound word until an ending component is successfully matched with the entries in said dictionary; generating a plurality of alternate compound word candidates by combining front component entries from said dictionary which are similar to said front component of said input compound word, with end component entries from said dictionary which are similar to said end component of said input compound word; checking each of said plurality of compound word candidates for appropriate compound flags, elisions, and binding characters stored in said dictionary in conjunction with said component word entries therein; displaying a subplurality of said plurality of compound word candidates which validly check as being appropriate compound words.
Claim 2
Independent Claim
208 words
A method for identifying an unknown component in a compound word and providing spelling candidates within the context of the compound word, comprising the steps of: inputting a compound word from a stream of text; matching the initial components of the input compound word to the entries in a dictionary data base; terminating the analysis if the complete compound word is matched with an entry in said dictionary; identifying the unknown component as the leading component of said compound word if the leading component thereof was not matched with said dictionary; matching successive groups of contiguous characters in said compound word until an ending component is successfully matched with the entries in said dictionary; generating a plurality of alternate compound word candidates by combining front component entries from said dictionary which are similar to said front component of said input compound word, with end component entries from said dictionary which are similar to said end component of said input compound word; checking each of said plurality of compound word candidates for appropriate compound flags, elisions, and binding characters stored in said dictionary in conjunction with said component word entries therein; displaying a subplurality of said plurality of compound word candidates which validly check as being appropriate compound words.
Claim 3
Dependent Claim
104 words
method for identifying the incorrect components within a compound word, comprising the steps of: accessing a dictionary data base and identifying the leading components of the incorrect compound word; marking the beginning of the incorrect component of the compound word as starting from the character following the last identified leading component of the compound word; skipping characters in the compound word until all the remaining characters of the compound word match against the dictionary entries, the matched entries being the final components of the compound word; marking the ending of the incorrect component as the character preceding the final components of the compound word.
Claim 4
Dependent Claim
104 words
method for identifying the incorrect components within a compound word, comprising the steps of: accessing a dictionary data base and identifying the leading components of the incorrect compound word; marking the beginning of the incorrect component of the compound word as starting from the character following the last identified leading component of the compound word; skipping characters in the compound word until all the remaining characters of the compound word match against the dictionary entries, the matched entries being the final components of the compound word; marking the ending of the incorrect component as the character preceding the final components of the compound word.
Claim 5
Dependent Claim
76 words
In the method of claim 2, a method of generating compound words where an incorrect component is replaced with a correct component, comprising the steps of: identifying the incorrect component; isolating from a dictionary, a set of correctly spelled words which are similar morphologically to the incorrect component; creating a compound word by juxtaposing the leading components, a word from the set of correctly spelled words, and the final components, for all words of the set.
Claim 6
Dependent Claim
48 words
In the method of claim 3, a method of generating compound words where an incorrect component is replaced with a correct component, comprising the steps of: verifying the attributes of the replaced component against a dictionary to determine if the replaced component results in a valid compound word.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.