Abstract
The purpose of this article is to present a treatment of unbounded dependencies which is currently being experimented with in Eurotra. The treatment is based on the coindexation tool designed by the authors as an extension to the E-Framework, Eurotra's NLP formalism.Footnote 1 At present, the tool has been tested in a systematic way in the Danish, French, Italian, and Spanish modules of the Eurotra translation system. Testing work on other languages (especially German) is in progress. Our article is organized as follows: in section 1, we discuss the linguistic and translational motivations for the treatment presented here; in section 2, we give the syntax and semantics of the two main components of the coindexation tool, namely the recursion markers and the copy operator; section 3 shows how this machinery can be applied for the implementation of unbounded dependency constructions according to our approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
On the E-Framework, cf. Bech and Nygaard 1988, and Bech et al. (previous issue of this journal). A first extension to the framework, in terms of ‘recursion markers,’ was introduced by Allegranza (1988) and implemented in PROLOG by Giovanni Malnati. Allegranza and Bech (1989) integrated it with a structure-copying component due to Annelise Bech and Anders Nygaard.
References
Allegranza, V. 1988. Unbounded Dependency. In V. Allegranza and E. Steiner (eds.), Interlevel Phenomena in Eurotra. A collection of discussion papers by the LSG. Luxembourg: CEC.
Allegranza, V. and A. Bech. 1989. A Versatile Tool for Treating Unbounded Dependency Constructions in NLP and MT Systems. Gruppo DIMA Working Papers, 1, Gruppo DIMA, Turin.
Balari, S., N. Bel and E. Gilboy. 1989. Unbounded Dependencies in Machine Translation. In S. Busemann, C. Hauenschiel and C. Umbach (eds.), Views of the Syntax/Semantics Interface. KIT Report 74, TU Berlin, Berlin.
Bech, A. and A. Nygaard. 1988. The E-Framework: A Formalism for Natural Language Processing. In Proceedings of COLING-88, Budapest, 36–40.
Correa, N. 1987. An Attribute-Grammar Implementation of Government and Binding Theory. In Proceedings of the ACL-25, Stanford, 45–51.
Engdahl, E. and E. Ejerhed (eds.), 1982. Readings on Unbounded Dependencies in Scandinavian Languages. Acta Universitatis Umensis, Umea.
Gazdar, G., E. Klein, G. Pullum and I. Sag. 1985. Generalized Pharase Structure Grammar. Oxford: Basil Blackwell.
Haugeneder, H. 1985. An ATN Treatment Wh-Movement. Proceedings of the 2nd Conference of the European Chapter of the ACL, Geneva, 41–47.
Kaplan, R. and J. Maxwell III. 1988. An Algorithm for Functional Uncertainty. In Proceedings of COLING-88, Budapest, 297–303.
Karttunen, L. 1986. D-PATR: A Development Environment for Unification-Based Grammars. CSLI Report, Center for the Study of Language and Information, Stanford.
Kuhns, R.J. 1986. A PROLOG Implementation of Government-Binding Theory. In Proceedings of COLING-86, Bonn, 546–550.
Rizzi, L. 1982. Issues in Italian Syntax. Dordrecht: Foris.
Ross, J.R. 1967. Constraints on Variables in Syntax. Ph.D. dissertation, M.I.T., Cambridge, Mass.
Schmidt, P. 1988. A Syntactic Description of German in a Formalism Designed for Machine Translation. In Proceedings of COLING-88, Budapest, 589–594.
Shieber, S.M. 1986. An Introduction to Unification-Based Approaches to Grammar. CSLI Lecture Notes, 4, Center for the Study of Language and Information, Stanford.
Woods, W.A. 1970. Transition network grammars for natural language analysis. Communications of the ACM 13:591–606.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Allegranza, V., Bech, A. A treatment of unbounded dependencies in eurotra with an experimental coindexation tool. Machine Translation 6, 171–182 (1991). https://doi.org/10.1007/BF00397280
Issue Date:
DOI: https://doi.org/10.1007/BF00397280