Abstract
The transfer component of a machine translation (MT) system typically comprises three aspects, namely the transfer structure used to transfer source into target structures, the (set of) transfer rules and the transfer process, which interpretes the set of transfer rules to derive the target from the source structure. The transfer structure can be formally considered as a term and the set of transfer rules as a term-rewrite system, which is terminating if a well-founded ordering on the terms can be defined, but not confluent. Most of the interpreters of rewrite systems require both termination and confluence. This paper is concerned with the transfer process and presents a well-founded ordering on the terms representing the transfer structures and an algorithm for the interpretation of terminating and non-confluent rewrite systems, which is used within the transfer component of the MT system of the project KIT-FAST 1 at the Technical University of Berlin. The other aspects concerning the transfer component will be dealt with in [We89b].
This work has been developed in the project KIT-FAST (KIT = Künstliche Intelligenz und Textverstehen (Artificial Intelligence and Text Understanding); FAST = Functor-Argument Structure for Translation), which constitutes the Berlin component of the complementary research project of EUROTRA-D. It receives grants by the Federal Minister for Research and Technology under contract 1013211.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
BB87]: K.H. Bläsius, H.-J. Bürckert (eds.): “Deduktionssysteme, Automatisierung des logischen Denkens”, Oldenbourg 1987, pp. 115–133
De82]: N. Dershowitz: “Orderings for Term-Rewriting Systems”, Theoretical Computer Science 17 (1982), North-Holland, pp. 279–301
De85]: N. Dershowitz: “Termination”, in: G.Goos, J. Hartmanis (eds.): “Rewriting Techniques and Applications”, LNCS 202, Dijon, France, May 1985, pp. 180–224
[Hau86]: Ch. Hauenschild: “KIT/NASEV oder die Problematik des Transfers bei der Maschinellen Übersetzung”, in: I. Bätori, H.J. Weber (eds.): “Neue Ansätze in Maschineller Sprachübersetzung: Wissensrepräsentation und Textbezug”, Sprache und Information, Niemeyer 1986, pp. 167–196
Ch. Hauenschild, S. Busemann: “A Constructive Version of GPSG for Machine Translation”, in: E. Steiner et al. (eds.): “From Syntax to Semantics - Insights from Machine Translation”, Pinter 1988, pp. 216–238
Ch. Hauenschild, C. Umbach: “Funktor-Argument-Struktur, Die satzsemantische Repräsentations- und Transferebene im Projekt KIT-FAST”, in: J. Schütz (ed.): “Workshop Semantik und Transfer”, EUROTRA-D Working Papers No.6, Saarbrücken, Juni 1988, pp. 16–35
G. Huet, D.C. Oppen: “Equations and Rewrite Rules”, in: R.V. Book (ed.): “Formal Language Theory, Perspectives and Open Problems”, Academic Press 1980, pp. 349–405
We89a]: W. Weisweber: “Transfer in MT by Term-Rewriting”, in: J. Müller, H. Ganzinger (eds.): “Ext. Abstracts of the 1st German Workshop Term Rewriting: Theory and Applications”; SEKI Report SR-89-02, University of Kaiserslautern, March 89
We89b]: W. Weisweber: “The Transfer Component of KIT-FAST: Machine Translation with Term-Rewriting”; KIT-Report in preparation, Technical University of Berlin
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weisweber, W. (1989). Transfer in Machine Translation by Non-Confluent Term-Rewrite Systems. In: Metzing, D. (eds) GWAI-89 13th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-75100-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-75100-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51743-6
Online ISBN: 978-3-642-75100-4
eBook Packages: Springer Book Archive