Patent US4750122A successfully refreshed from Google Patents.
US4750122A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method for segmenting a text into words
Assignee: Hitachi Ltd
•
Filing: 1985-07-31
•
Granted: 1988-06-07
•
Expires: 2005-07-31
Abstract
Abstract A method of segmenting a text into words in which a dictionary search is made while using a character string in the text as a search key, and it is checked whether a word retrieved from the dictionary can be grammatically connected to another word adjacent thereto or not. Segmentation processing is carried out using only words registered in a word dictionary, processing for identifying an unknown word is carried out when the segmentation processing comes to a deadlock, and then the segmentation processing is continued for that portion of the text which follows the identified unknown word.
Inventors
- 👤 Hiroyuki Kaji
- 👤 Yoshihiko Nitta
- 👤 Atsuko Isatsu
- 👤 Fumon Shimizu
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 18:31
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/20; G06F40/237; G06F40/242; G06F40/253; G06F40/279; G06F40/284; G06F40/40; G06F40/53
Claims Analysis
Total Claims: 10
Claim 1
Independent Claim
128 words
A method of segmenting a text into words for which a dictionary search is carried out using a character string in the text as a search key, and in which it is determined whether a word retrieved from a word dictionary can be grammatically connected to a preceding word, said method comprising the steps of: segmenting a character string of the text into words using only words registered in the word dictionary; identifying a word in the text undergoing segmentation processing as a possible unknown word, when said segmentation processing reaches a deadlock; verifying that the possible unknown word is the unknown word based on character kind information in the text; and continuing said segmentation processing for a portion of said text which follows the identified unknown word.
Claim 2
Independent Claim
128 words
A method of segmenting a text into words for which a dictionary search is carried out using a character string in the text as a search key, and in which it is determined whether a word retrieved from a word dictionary can be grammatically connected to a preceding word, said method comprising the steps of: segmenting a character string of the text into words using only words registered in the word dictionary; identifying a word in the text undergoing segmentation processing as a possible unknown word, when said segmentation processing reaches a deadlock; verifying that the possible unknown word is the unknown word based on character kind information in the text; and continuing said segmentation processing for a portion of said text which follows the identified unknown word.
Claim 3
Dependent Claim
86 words
A method of segmenting a text into words according to claim 1, wherein said step of verifying an unknown word includes a step of preserving the result of segmentation which is obtained during a backtracking processing and is likely to be interrupted by the presence of an unknown word, and a step of considering a succeeding word of said result of segmentation which is obtained during the backtracking processing, as an unknown word immediately after it has been determined that other segmenting operations are now allowed.
Claim 4
Dependent Claim
61 words
A method of segmenting a text into words according to claim 1, wherein said step of verifying an unknown word includes a step of carrying out a backtracking processing within a predetermined range so that said backtracking processing is inhibited from being carried out beyond a position where the boundary between different kinds of characters coincides with the boundary between words.
Claim 5
Dependent Claim
61 words
A method of segmenting a text into words according to claim 2, wherein said step of verifying an unknown word includes a step of carrying out a backtracking processing within a predetermined range so that said backtracking processing is inhibited from being carried out beyond a position where the boundary between different kinds of characters coincides with the boundary between words.
Claim 6
Dependent Claim
73 words
A method of segmenting a text into words according to claim 1, wherein said step of verifying an unknown word includes a step of using one of a Chinese character string, a Japanese kana character string and an alphabetic character string each sandwiched between characters different in kind from said character string, as a possible unknown word, when said segmentation processing which uses only words registered in the word dictionary reaches a deadlock.
Claim 7
Dependent Claim
23 words
A method of segmenting text into words according to claim 1, wherein said text includes sentences lacking discrete boundaries between the words thereof.
Claim 8
Independent Claim
135 words
A method of segmenting a text into words comprising: a first step of carrying out a dictionary search using a character string in said text as a search key; a second step of checking whether a word of said text retrieved from a dictionary can be grammatically connected to a preceding word of said text; a third step of preserving a result obtained during the segmenting processing when a backtracking processing is carried out for a deadlock encountered in the processing in at least one of said first and second steps; a fourth step of determining the presence of an unknown word in the text, based on character kind information of the text; and a fifth step of resuming the segmenting processing utilizing the preserved result when the presence of the unknown word is determined.
Claim 9
Independent Claim
135 words
A method of segmenting a text into words comprising: a first step of carrying out a dictionary search using a character string in said text as a search key; a second step of checking whether a word of said text retrieved from a dictionary can be grammatically connected to a preceding word of said text; a third step of preserving a result obtained during the segmenting processing when a backtracking processing is carried out for a deadlock encountered in the processing in at least one of said first and second steps; a fourth step of determining the presence of an unknown word in the text, based on character kind information of the text; and a fifth step of resuming the segmenting processing utilizing the preserved result when the presence of the unknown word is determined.
Claim 10
Dependent Claim
24 words
A method of segmenting a text into words according to claim 7, wherein said text includes sentences lacking discrete boundaries between the words thereof.
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) | 1991-06-07 | 1991-12-07 | 1992-06-07 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1995-06-07 | 1995-12-07 | 1996-06-07 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 1999-06-07 | 1999-12-07 | 2000-06-07 | $7700.00 | Window Closed / Lapsed |