Paper: Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation

ACL ID C92-2116
Title Term-Rewriting As A Basis For A Uniform Architecture In Machine Translation
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1992
Authors

In machine translation (MT) different levels of representation can be used to translate a source language sentence onto its target language equivalent. These levels have to be related to each other. This paper describes a declarative formalism on the basis of term-rewriting which maps one representation onto an equivalent adjacent one. The different levels (e.g. represented by derivational trees, feature structures or expressions of a knowledge representation language) can be represented as terms. The equivalences between them are stated as axioms which are directed to form a non-confluent and terminating term-rewrite system. A courplete and coherent' algorithm has been developexl which interprets these systems and is able to handle default rules.