Translating system for processing text with markup signs

• US 5,587,902 A
• Filed: 05/26/1993
• Issued: 12/24/1996
• Est. Priority Date: 05/26/1992
• Status: Expired due to Term

• Current Assignee: Sharp Kabushiki Kaisha (Hon Hai Precision Industry Co., Ltd.)
• Original Assignee: Sharp Kabushiki Kaisha (Hon Hai Precision Industry Co., Ltd.)
• Inventors: Kugimiya, Shuzo
• Primary Examiner(s): Hayes, Gail O.
• Assistant Examiner(s): Ives, Felicia
• Application Number:
  US08/067,143
• Time in Patent Office: 1,308 Days
• Field of Search: 364/419.02, 364/419.06, 364/419.08, 364/419.1, 595/148, 595/145
• US Class Current: 704/2
• CPC Class Codes: G06F 40/117 Tagging; Marking up details of markup languages G06F40/143; Designating a block; Setting of attributes style sheets, e.g. eXtensible Stylesheet Language Transformation [XSLT], G06F40/154
• CPC Class Codes: G06F 40/143 Markup, e.g. Standard Generalized Markup Language [SGML] or Document Type Definition [DTD]
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
• CPC Class Codes: G06F 40/221 Parsing markup language streams streaming G06F40/149
• CPC Class Codes: G06F 40/268 Morphological analysis
• CPC Class Codes: G06F 40/55 Rule-based translation

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.

Claims

1. 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.

2. 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.

3. 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.

4. 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.

5. 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.

6. A translating machine as recited in claim 1, wherein said first language is English.

7. A translating machine as recited in claim 6, wherein said second language is Japanese.

8. 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.

9. 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.

10. 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.