EP0281742A2
Expired / Lapsed
EP
⏱️ 0.0 years remaining
Method for verifying spelling of compound words
Assignee: International Business Machines Corp
•
Filing: 1988-01-22
•
Granted: —
•
Expires: 2008-01-22
Abstract
Abstract This invention describes a method for automatically verifying spelling of compound words in many natural languages such as German, Danish, Swedish, Norwegian, Dutch, Icelandic, Afrikaans, Swiss German, etc. The basic technology of looking up words in a dictionary is supplemented by the association of component flags with each word and by the application of powerful tree-scanning techniques that isolate the components of compound words and determine their correctness in isolation and in association with each other. The technique can be used in word processing systems to support spelling verification, to hyphenate text, and to unhyphenate text.
Inventors
- 👤 Rudolph Arnold Frisch
- 👤 Antonio Zamora
Bibliographic Details
Application Number
—
Jurisdiction
EP
Data Source
google_patents
Last Synchronized
2026-10-31 22:19
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/191; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
237 words
A computer method for parsing a compound word composed of a plurality of word components, comprising the steps of: storing a dictionary of stored word components and associating with each of said components a flag indicating whether said word component can be an independent word, a prefix of a word, a middle element of a word, a suffix, or a code specifying the type of morphological transformation it can undergo; inputting an input word stream which includes a compound word which is to be parsed; selecting all words from the dictionary that match an initial substring of the input word and retaining only the dictionary words which have a component flag indicating that said dictionary word can be a prefix element; processing all the remaining portions of the input word, selecting all words from the dictionary that match an initial substring of said remaining portion of the input word and retaining only the dictionary words which have a component flag indicating that the word can be a middle element of a word; processing all the remaining portions of the input word, selecting all words from the dictionary that exactly match said remaining portion of the input word and retaining only the dictionary words which have a component flag indicating that the word can be a word suffix element; applying morphological rules during the search for middle or suffix elements if no suitable dictionary candidates can be found.
Claim 2
Dependent Claim
237 words
A computer method for parsing a compound word composed of a plurality of word components, comprising the steps of: storing a dictionary of stored word components and associating with each of said components a flag indicating whether said word component can be an independent word, a prefix of a word, a middle element of a word, a suffix, or a code specifying the type of morphological transformation it can undergo; inputting an input word stream which includes a compound word which is to be parsed; selecting all words from the dictionary that match an initial substring of the input word and retaining only the dictionary words which have a component flag indicating that said dictionary word can be a prefix element; processing all the remaining portions of the input word, selecting all words from the dictionary that match an initial substring of said remaining portion of the input word and retaining only the dictionary words which have a component flag indicating that the word can be a middle element of a word; processing all the remaining portions of the input word, selecting all words from the dictionary that exactly match said remaining portion of the input word and retaining only the dictionary words which have a component flag indicating that the word can be a word suffix element; applying morphological rules during the search for middle or suffix elements if no suitable dictionary candidates can be found.
Claim 3
Dependent Claim
15 words
The process as stated in claim 1 where only prefix and suffix elements are considered.
Claim 4
Dependent Claim
25 words
The process as stated in claim 1 where the search for matches against the dictionary is controlled by a tree-scanning procedure implemented with a stack.
Claim 5
Dependent Claim
60 words
The process as stated in claim 1 where the morphological rule applied during the search for middle and suffix elements consists of identifying whether the remaining portion of the input word under consideration starts with a vowel and the preceding element ends in a double consonant, in which case a copy of said consonant is inserted ahead of said vowel.
Claim 6
Dependent Claim
45 words
The process as stated in claim 1 where the morphological rule applied during the search for middle and suffix elements consists of identifying whether the remaining portion of the input word under consideration starts with the letter "S," in which case said letter is removed.
Claim 7
Dependent Claim
43 words
The process as stated in claim 1 where the morphological rule applied during the search for middle or suffix elements consists of identifying whether the dictionary term is capitalized, in which case the initial letter of said dictionary term is made lower case.
Claim 8
Dependent Claim
37 words
The process as stated in claim 1 where the morphological rule applied during the search for middle or suffix elements consists of a morphological transformation specified by the code associated in the dictionary with the preceding element.
Claim 9
Dependent Claim
27 words
The process as stated in claim 1 where the components identified by said process are stored as reference to provide hyphenation points for the input compound word.
References Cited (Backward Citations)
No citation records indexed.
USPTO Annuity & Maintenance Windows
Maintenance schedule is calculated for granted US utility patents.