US5448474A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for isolation of Chinese words from connected Chinese text
Assignee: International Business Machines Corp
•
Filing: 1993-03-03
•
Granted: 1995-09-05
•
Expires: 2013-03-03
Abstract
Abstract A process is described for mechanically analyzing connected Chinese text and isolating the words comprising the text. The process uses a dictionary, straightforward rules dealing with punctuation, a method for identifying all words in a string of Chinese text and resolving overlapping words into a set of adjacent words for the input text through successively stricter filtering mechanisms that eliminate illogical segmentations, and a method for resolving ambiguities.
Inventors
- 👤 Antonio Zamora
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-06 19:12
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/253; G06F40/40; G06F40/53
Claims Analysis
Total Claims: 8
Claim 1
Independent Claim
93 words
In a data processing system, a method for isolating words from connected text, comprising the steps of: reading an input string of text into a data processing system; identifying in the system all words in the input string; performing in the system a First Adjacency Process to delete words that are not adjacent to another word; performing in the system a Restoration Process to restore a longest word containing an unreferenced character deleted by said First Adjacency Process forming a sequence of isolated words; outputting the sequence of isolated words with indicated separations.
Claim 2
Dependent Claim
93 words
In a data processing system, a method for isolating words from connected text, comprising the steps of: reading an input string of text into a data processing system; identifying in the system all words in the input string; performing in the system a First Adjacency Process to delete words that are not adjacent to another word; performing in the system a Restoration Process to restore a longest word containing an unreferenced character deleted by said First Adjacency Process forming a sequence of isolated words; outputting the sequence of isolated words with indicated separations.
Claim 3
Dependent Claim
112 words
In a computer system with input and output, a method of using a data structure to identify words from input text, comprising: matching all substrings of the input text which are stored as words in a reference dictionary; flagging any characters that are not encompassed by the dictionary word as single-character words; identifying overlapped words and eliminating words that are not connected to adjacent words by scanning every entry in the data structure; and flagging an entry as deleted if it does not represent a word that is at the beginning of the input text or preceded by another word at the end of the input text or followed by another word.
Claim 4
Dependent Claim
112 words
In a computer system with input and output, a method of using a data structure to identify words from input text, comprising: matching all substrings of the input text which are stored as words in a reference dictionary; flagging any characters that are not encompassed by the dictionary word as single-character words; identifying overlapped words and eliminating words that are not connected to adjacent words by scanning every entry in the data structure; and flagging an entry as deleted if it does not represent a word that is at the beginning of the input text or preceded by another word at the end of the input text or followed by another word.
Claim 5
Dependent Claim
42 words
The method of claim 2, which further comprises: resolving overlapped words into adjacent words by an iterative process of identifying all characters that are not included in non-deleted words and for each such character restoring a deleted word that contains the character.
Claim 6
Dependent Claim
29 words
The method of claim 3, which further comprises: consolidating numeric strings by the identification of adjacent all-numeric strings and creation of a data structure entry for consecutive all-numeric strings.
Claim 7
Dependent Claim
67 words
The method of claim 3, which further comprises: eliminating words that are not connected to adjacent words by scanning every entry in the data structure and flagging the word as deleted if it does not represent a word that is at the beginning of the input text or preceded by another non-deleted word and at the end of the input text or followed by another non-deleted word.
Claim 8
Dependent Claim
68 words
The method of claim 5, which further comprises: identifying the location and scope of ambiguities by an iterative process of scanning the data structure to find multiple entries referring to the same location of the input text string, creating an output data structure corresponding to each alternate string in the data structure, and recursively attaching adjacent words to the smaller string, until all strings are of equal length.
References Cited (Backward Citations)
US4327421A
Cited
US4679951A
Cited
US4365235A
Cited
US4484305A
Cited
US4750122A
Cited
US5109509A
Cited
US4742516A
Cited
US4583951A
Cited
US4866670A
Cited
US4777600A
Cited
US4669901A
Cited
US4937745A
Cited
US5079702A
Cited
US5161245A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-09-04 | 1999-03-06 | 1999-09-05 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-09-04 | 2003-03-06 | 2003-09-05 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-09-04 | 2007-03-06 | 2007-09-05 | $7700.00 | Window Closed / Lapsed |