Patent US5587902A successfully refreshed from Google Patents.
US5587902A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Translating system for processing text with markup signs
Assignee: Sharp Corp
•
Filing: 1993-05-26
•
Granted: 1996-12-24
•
Expires: 2013-05-26
Abstract
Abstract A method and translating machine for translating a source language with markup signs into a target language maintaining the markup signs. The system includes a separation module for separating an original text into markup signs and a text body exclusive of the markup signs, a memory for storing each markup sign in association with a corresponding word or phrase, a module for producing a parsing tree in a target language corresponding to the original text body, and a translated sentence producing module for producing target language text by attaching markup signs to translated words corresponding to the original text based on the parsing tree in the target language.
Inventors
- 👤 Shuzo Kugimiya
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 06:36
CPC Classifications
G; G06; G06F; G06F40/00; G06F40/10; G06F40/103; G06F40/117; G06F40/12; G06F40/14; G06F40/143; G06F40/20; G06F40/205; G06F40/211; G06F40/221; G06F40/268; G06F40/40; G06F40/55
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
158 words
A translating machine for translating an original text in a first language including one or a plurality of predetermined markup signs into a translated text in a second language, comprising: means for associating each of said one or a plurality of predetermined markup signs with words within the original text; separation means for separating the original text into markup signs and a text body exclusive of the markup signs; storage means for storing each markup sign with each word to which each said markup sign is associated; means for producing a parsing tree in the second language from said text body; and means for producing, in communication with said means for producing a parsing tree and said storage means, the translated text from said parsing tree and attaching a markup sign to each word within the translated text equivalent to each of said one or a plurality of markup signs associated with each word within the original text.
Claim 2
Dependent Claim
158 words
A translating machine for translating an original text in a first language including one or a plurality of predetermined markup signs into a translated text in a second language, comprising: means for associating each of said one or a plurality of predetermined markup signs with words within the original text; separation means for separating the original text into markup signs and a text body exclusive of the markup signs; storage means for storing each markup sign with each word to which each said markup sign is associated; means for producing a parsing tree in the second language from said text body; and means for producing, in communication with said means for producing a parsing tree and said storage means, the translated text from said parsing tree and attaching a markup sign to each word within the translated text equivalent to each of said one or a plurality of markup signs associated with each word within the original text.
Claim 3
Dependent Claim
107 words
A translating machine as recited in claim 1, wherein said storage means includes, a plurality of word storage means for storing the original text by individually and sequentially storing each word included in said original text in a corresponding one of said plurality of word storage means; and a plurality of markup sign storage means, at least one of which is being provided for each of said plurality of word storage means, for individually storing each of said one or a plurality of predetermined markup signs associated with each word in the original text and stored in a corresponding one of said plurality of word storage means.
Claim 4
Dependent Claim
125 words
A translating machine as recited in claim 2, wherein said separation means includes, means for initially storing said original text, means for separating a character string included in said original text by recognizing a prescribed code in separating the character string from the remainder of said original text; means for determining whether or not said separated character string is associated with one or a plurality of said predetermined markup signs; means for storing one or a plurality of the predetermined markup signs with each word in the separated character string associated with a predetermined markup sign; and means for storing the non-markup sign character string in one of said plurality of word storage means in a predetermined order in response to said association determining means.
Claim 5
Dependent Claim
71 words
A translating machine as recited in claim 3, wherein each of said predetermined markup signs includes a pair of a markup signs with a markup start sign and a markup end sign, and said determining means further comprises, means for determining whether or not said character string begins with a said markup start sign, and means for determining whether or not said character string ends with a said markup end sign.
Claim 6
Dependent Claim
67 words
A translating machine as recited in detecting claim 4, wherein said determining means further comprising, first means for detecting a said first markup start sign; second means for detecting a said first markup end sign to be paired with said first markup start sign; and means, responsive to said first and second detecting means, for associating said first markup start and end signs to said character string.
Claim 7
Dependent Claim
14 words
A translating machine as recited in claim 1, wherein said first language is English.
Claim 8
Dependent Claim
14 words
A translating machine as recited in claim 6, wherein said second language is Japanese.
Claim 9
Dependent Claim
78 words
A translating machine as recited in claim 1, wherein said means for producing the parsing tree in said second language includes, means for producing a parsing tree in said first language corresponding to said original text by performing a prescribed grammatical processing on said text body separated from the markup signs by said separation means, and means for transforming the parsing tree in said first language into a parsing tree in said second language utilizing predetermined transformation rules.
Claim 10
Dependent Claim
137 words
A translating machine as recited in claim 1, wherein said means for producing text in said second language includes, means for rearranging words in said first language stored in said word storage means in the order specified by the parsing tree in said second language; means for allocating a corresponding translation in said second language of each said rearranged words in said first language; means for attaching a markup sign to each translated word in said second language produced by said allocating means, based on said markup signs stored in said markup sign storage means corresponding to said word storage means; and means for producing a translated sentence in said second language based on the translated words rearranged in the order according to the parsing tree in said second language and attached with said necessary markup signs.
Claim 11
Dependent Claim
99 words
A translating machine as recited in claim 9, wherein said predetermined markup signs include a plurality of markup sign pairs each including a markup start sign and a markup end sign, and said attachment means includes, means for determining whether or not to attach a markup start sign to a translated word within the translated sentence corresponding to a markup start sign stored in said storage means, and means for determining whether or not to attach a markup end sign to a translated word within the translated sentence corresponding to a markup start sign stored in said storage means.
References Cited (Backward Citations)
US4821230A
Cited
US5182709A
Cited
US4962452A
Cited
GB2197510A
Cited
JPS63108461A
Cited
US4964030A
Cited
JPS6478372A
Cited
US5005127A
Cited
US4994966A
Cited
US5001633A
Cited
US5111398A
Cited
JPH039472A
Cited
US5276616A
Cited
US5270928A
Cited
JPH04259057A
Cited
JPH056396A
Cited
JPH07182344A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-12-24 | 2000-06-24 | 2000-12-24 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-12-24 | 2004-06-24 | 2004-12-24 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-12-24 | 2008-06-24 | 2008-12-24 | $7700.00 | Window Closed / Lapsed |