Paper: Automatic Translation With Attribute Grammars

ACL ID C80-1060
Title Automatic Translation With Attribute Grammars
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1980
  • Werner Dilger (University of Kaiserslautern, Kaiserslautern Germany)

The examples contained in this paper will illustrate these features. Input for the translation algorithm are the parsed sentence and a set of translation rules (in the following: TR-rules) (cf. [Wu 79]), which are defined for labels of the parse tree nodes, mainly for the labels of the terminal nodes, i. e. for the words of the input sentence. Working bottom up the parse tree the translation algorithm assigns a translation to each of the nodes of the tree by interpreting the TR-rules defined for the labels of the nodes. If a translation has been successfully assigned to the root of the tree, which is labelled by S, this translation is the translation of the whole sentence. The advantage of the translation algorithm, the most important part of which is the interpretation of the TR-rules, is...