View in EDS PDF Full Text

Left-right trees, a new tree structure for machine translation.

Saved in:
Bibliographic Details
Title: Left-right trees, a new tree structure for machine translation.
Authors: Kurokawa, Kouichi1, Kasai, Takumi1
Source: Systems & Computers in Japan. 5/1/1998, Vol. 29 Issue 5, p84-91. 8p.
Subjects: Translators (Computer programs), Automation, Grammar, Comparative grammar, English language, Transducers
Abstract: This paper describes a new tree structure called the left-right tree, along with its grammar and automaton, which form the theoretical basis for an English-Japanese machine translator developed by the authors. A left-right tree is a tree that differentiates between left children and right children. An English sentence is transformed into a set of left-right trees by labeling each node of the left-right tree with an English word. To represent a language, which is a collection of such left-right trees, we define a grammar for left-right tree languages, called the “tree categorical grammar.” We also define the valenced pushdown transducer as a formalized model of the parser used in the translator. Due to the valence property of the symbols, the work of the stack is restricted in the pushdown transducer. We demonstrate the equivalence of the classes of left-right tree languages produced by different representations and explain some of the properties satisfied by the classes. © 1998 Scripta Technica, Syst Comp Jpn, 29(5): 84–91, 1998 [ABSTRACT FROM AUTHOR]
Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 13380020
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Left-right trees, a new tree structure for machine translation.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Kurokawa%2C+Kouichi%22">Kurokawa, Kouichi</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Kasai%2C+Takumi%22">Kasai, Takumi</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Systems+%26+Computers+in+Japan%22">Systems & Computers in Japan</searchLink>. 5/1/1998, Vol. 29 Issue 5, p84-91. 8p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Translators+%28Computer+programs%29%22">Translators (Computer programs)</searchLink><br /><searchLink fieldCode="DE" term="%22Automation%22">Automation</searchLink><br /><searchLink fieldCode="DE" term="%22Grammar%22">Grammar</searchLink><br /><searchLink fieldCode="DE" term="%22Comparative+grammar%22">Comparative grammar</searchLink><br /><searchLink fieldCode="DE" term="%22English+language%22">English language</searchLink><br /><searchLink fieldCode="DE" term="%22Transducers%22">Transducers</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: This paper describes a new tree structure called the left-right tree, along with its grammar and automaton, which form the theoretical basis for an English-Japanese machine translator developed by the authors. A left-right tree is a tree that differentiates between left children and right children. An English sentence is transformed into a set of left-right trees by labeling each node of the left-right tree with an English word. To represent a language, which is a collection of such left-right trees, we define a grammar for left-right tree languages, called the “tree categorical grammar.” We also define the valenced pushdown transducer as a formalized model of the parser used in the translator. Due to the valence property of the symbols, the work of the stack is restricted in the pushdown transducer. We demonstrate the equivalence of the classes of left-right tree languages produced by different representations and explain some of the properties satisfied by the classes. © 1998 Scripta Technica, Syst Comp Jpn, 29(5): 84–91, 1998 [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Systems & Computers in Japan is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=13380020
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/(SICI)1520-684X(199805)29:5<84::AID-SCJ9>3.0.CO;2-J
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 8
        StartPage: 84
    Subjects:
      – SubjectFull: Translators (Computer programs)
        Type: general
      – SubjectFull: Automation
        Type: general
      – SubjectFull: Grammar
        Type: general
      – SubjectFull: Comparative grammar
        Type: general
      – SubjectFull: English language
        Type: general
      – SubjectFull: Transducers
        Type: general
    Titles:
      – TitleFull: Left-right trees, a new tree structure for machine translation.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Kurokawa, Kouichi
      – PersonEntity:
          Name:
            NameFull: Kasai, Takumi
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 05
              Text: 5/1/1998
              Type: published
              Y: 1998
          Identifiers:
            – Type: issn-print
              Value: 08821666
          Numbering:
            – Type: volume
              Value: 29
            – Type: issue
              Value: 5
          Titles:
            – TitleFull: Systems & Computers in Japan
              Type: main
ResultId 1