US4903206A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Spelling error correcting system
Assignee: International Business Machines Corp
•
Filing: 1988-02-01
•
Granted: 1990-02-20
•
Expires: 2008-02-01
Abstract
Abstract Preselection of words for spelling error check utilizes unique attribute information of words. The attribute information is generated for each vocabulary word and each vocabulary word is classified based on the attribute information and then stored in the dictionary. The attribute information is generated by obtaining character categories for each vocabulary word, ordering the character categories with a predetermined criterion, taking a leading character categories, and then generating one or more combinations of m character categories from the n leading character categories, which combinations being the attribute information. For an inputted character string to be checked, the attribute information is also generated, and the vocabulary words included in one or more classes specified by the attribute are selected as the candidate words for the correct word.
Inventors
- 👤 Nobuyasu Itoh
- 👤 Hiroyasu Takahashi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-28 22:50
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/232
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
159 words
A spelling error correcting system characterized by comprising: means for storing a number of correctly spelled words, each of which can be read with one or more combinations of character categories, each combination consisting of m (m is a constant satisfying m< n) character categories out of n (n is a constant) leading character categories of the character categories included in the word and sorted based on a predetermined rule associated with character categories; means for automatically sorting character categories included in an input word based on said rule for sorting; means for automatically obtaining all combinations of m character categories out of n leading character categories of said sorted character categories; means for reading from said storing means correctly spelled words based on each of said obtained combinations of character categories; and means for matching said input word with each of said read words, said read words having a length within one from that of the input word.
Claim 2
Dependent Claim
159 words
A spelling error correcting system characterized by comprising: means for storing a number of correctly spelled words, each of which can be read with one or more combinations of character categories, each combination consisting of m (m is a constant satisfying m< n) character categories out of n (n is a constant) leading character categories of the character categories included in the word and sorted based on a predetermined rule associated with character categories; means for automatically sorting character categories included in an input word based on said rule for sorting; means for automatically obtaining all combinations of m character categories out of n leading character categories of said sorted character categories; means for reading from said storing means correctly spelled words based on each of said obtained combinations of character categories; and means for matching said input word with each of said read words, said read words having a length within one from that of the input word.
Claim 3
Dependent Claim
22 words
A spelling error correcting system as described in claim (1), wherein: said n character categories may include one or more blank characters.
Claim 4
Dependent Claim
46 words
A spelling error correcting system as described in claims (1), or (2), wherein: said storing means comprises a main storing portion which stores correctly spelled words and an index portion which specifies storing positions in said main storing portion based on said combinations of character categories.
Claim 5
Dependent Claim
42 words
A spelling error correcting system as described in claim (3), wherein: said index portion narrows down the range of words to be read, according to the character categories in predetermined m string positions of said sorted character categories in said input word.
Claim 6
Dependent Claim
20 words
A spelling error correcting system as described in claim (4), wherein: said predetermined m string positions are m leading positions.
Claim 7
Dependent Claim
34 words
A spelling error correcting system as described in claims (3), (4), or (5), wherein: said index portion narrows down the range of words to be read, according to the length of said input word.
Claim 8
Dependent Claim
171 words
A spelling error correcting system characterized by comprising: means for storing a number of correctly spelled words, each of which can be read with one or more combinations of character categories, each combination consisting of m (m is a constant satisfying m less than n) character categories out of n (n is a constant) leading character categories of the character category included in the word and sorted based on a predetermined rule associated with character categories; said rule for sorting is the ascending order of frequencies of appearance of character categories; means for sorting character categories included in an input word based on said rule for sorting; means for obtaining all combinations of m character categories out of n leading character categories of said sorted character categories, said n character categories may include one or more blank characters; means for reading from said storing means correctly spelled words based on each of said obtained combinations of character categories; and means for matching said input word with each of said read words.
Claim 9
Dependent Claim
171 words
A spelling error correcting system characterized by comprising: means for storing a number of correctly spelled words, each of which can be read with one or more combinations of character categories, each combination consisting of m (m is a constant satisfying m less than n) character categories out of n (n is a constant) leading character categories of the character category included in the word and sorted based on a predetermined rule associated with character categories; said rule for sorting is the ascending order of frequencies of appearance of character categories; means for sorting character categories included in an input word based on said rule for sorting; means for obtaining all combinations of m character categories out of n leading character categories of said sorted character categories, said n character categories may include one or more blank characters; means for reading from said storing means correctly spelled words based on each of said obtained combinations of character categories; and means for matching said input word with each of said read words.
References Cited (Backward Citations)
US4328561A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-02-19 | 1993-08-21 | 1994-02-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-19 | 1997-08-21 | 1998-02-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-19 | 2001-08-21 | 2002-02-20 | $7700.00 | Window Closed / Lapsed |