Proc. of the first international conference on Rewriting techniques and applications
Transfer in Machine Translation by Non-Confluent Term-Rewrite Systems
GWAI '89 Proceedings of the 13th German Workshop on Artificial Intelligence
Views of the Syntax/Semantics Interface Proceedings of the Workshop ``GPSG and Semantics'''', organized by the project KIT-FAST, TU Berlin, Feb. 22-24, 1989
The BACK System Revisited
A Model of Multi-Level Transfer for Machine Translation and Its Partial Realization
A Model of Multi-Level Transfer for Machine Translation and Its Partial Realization
Generierung natuerlicher Sprache mit Generalisierten Phrasenstruktur-Grammatiken
Generierung natuerlicher Sprache mit Generalisierten Phrasenstruktur-Grammatiken
Textrepraesentation und Hintergrundwissen fuer die Anaphernresolution im Maschinellen Uebersetzungssystem KIT-FAST
A language for the statement of binary relations over feature structures
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A transfer model using a typed feature structure rewriting system with inheritance
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
The ,T framework in Eurotra: a theoretically committed notation for MT
COLING '86 Proceedings of the 11th coference on Computational linguistics
A lexical functional grammar system in PROLOG
COLING '86 Proceedings of the 11th coference on Computational linguistics
A constructive view of GPSG or how to make it work
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Feature logic with disjunctive unification
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Reversible unification based machine translation
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 4
Incremental speech translation
Incremental speech translation
| Hi-index | 0.00 |
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 complete and coherent algorithm has been developed which interprets these systems and is able to handle default rules.