US4672571A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Compound word suitability for spelling verification
Assignee: International Business Machines Corp
•
Filing: 1984-10-24
•
Granted: 1987-06-09
•
Expires: 2004-10-24
Abstract
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.
Inventors
- 👤 Vance R. Bass
- 👤 Veronica A. Bonebrake
- 👤 David A. Garrison
- 👤 James K. Landis
- 👤 Mary S. Neff
- 👤 Robert J. Urquhart
- 👤 Susan C. Williams
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-27 08:29
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
123 words
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 word which word is not stored in said dictionary, comprising: storing flags associated with words stored in said dictionary indicative of whether said words may participate in compounding and, for those words which may participate in compounding, the relative positions said words may occupy in a compound word; determining that said text word to be verified consists entirely of two or more particular words in said dictionary; and returning a verify signal if the flags associated with said particular words are compatible with compounding in the relative positions in which said words occur in said text word.
Claim 2
Dependent Claim
123 words
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 word which word is not stored in said dictionary, comprising: storing flags associated with words stored in said dictionary indicative of whether said words may participate in compounding and, for those words which may participate in compounding, the relative positions said words may occupy in a compound word; determining that said text word to be verified consists entirely of two or more particular words in said dictionary; and returning a verify signal if the flags associated with said particular words are compatible with compounding in the relative positions in which said words occur in said text word.
Claim 3
Dependent Claim
40 words
In the method of claim 1 further comprising: returning a not verify signal if said flags associated with said particular words indicate incompatibility with compounding said particular words in the relative positions in which they occur in said text word.
Claim 4
Dependent Claim
22 words
In the method of claim 2 wherein a type of said flag indicates that a dictionary word associated therewith is not compoundable.
Claim 5
Dependent Claim
33 words
In a method of claim 2 wherein a type of said flag indicates that a dictionary word associated therewith can be used alone or as the front or middle of a compound word.
Claim 6
Dependent Claim
29 words
In the method of claim 2 wherein a type of said flag indicates that a dictionary word associated therewith can be used alone or anywhere in a compound word.
Claim 7
Dependent Claim
31 words
In the method of claim 2 wherein a type of said flag indicates that a dictionary word associated therewith can be used alone or as the back of a compound word.
Claim 8
Dependent Claim
32 words
In the method of claim 2 wherein a type of said flag indicates that a dictionary word associated therewith can be used only as the beginning or middle of a compound word.
Claim 9
Dependent Claim
23 words
In the method of claim 2 wherein a dictionary word associated therewith can be used only as the back of a compound word.
Claim 10
Dependent Claim
171 words
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 word which word is not stored in said dictionary, comprising: storing flags associated with words stored in said dictionary indicative of whether said words may participate in compounding and, for those words which may participate in compounding, the relative positions said words may occupy in a compound word; identifying an initial substring of said text word which has one of said flags associated therewith indicative of compatibility with compounding said dictionary word at the front of a compound word; determining a first remainder of said text word which consists of that portion of said text word succeeding said dictionary word; comparing said first remainder with said dictionary; and signaling that text word is correctly spelled if said first remainder is found in said dictionary and has a flag associated therewith indicative that said remainder may participate in compounding at the back of said compound word.
Claim 11
Dependent Claim
171 words
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 word which word is not stored in said dictionary, comprising: storing flags associated with words stored in said dictionary indicative of whether said words may participate in compounding and, for those words which may participate in compounding, the relative positions said words may occupy in a compound word; identifying an initial substring of said text word which has one of said flags associated therewith indicative of compatibility with compounding said dictionary word at the front of a compound word; determining a first remainder of said text word which consists of that portion of said text word succeeding said dictionary word; comparing said first remainder with said dictionary; and signaling that text word is correctly spelled if said first remainder is found in said dictionary and has a flag associated therewith indicative that said remainder may participate in compounding at the back of said compound word.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1990-06-08 | 1990-12-08 | 1991-06-09 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1994-06-08 | 1994-12-08 | 1995-06-09 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1998-06-08 | 1998-12-08 | 1999-06-09 | $7700.00 | Window Closed / Lapsed |