Abstract
We present a newly designed transformational system for the MT system LMT, consisting of a transformational formalism, LMT-TL, and an algorithm for applying transformations written in this formalism. LMT-TL is both expressive and simple because of the systematic use of a powerful pattern matching mechanism that focuses on dependency trees. LMT-TL is a language in its own right, with no “escapes” to underlying programming languages. We first provide an overview of the complete LMT translation process (all newly redesigned), and then give a self-contained description of LMT-TL, with examples.
This is a preview of subscription content, log in via an institution to check access.
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
Bernth, A.: EasyEnglish: A Tool for Improving Document Quality. Proceedings of the Fifth Conference on Applied Natural Language Processing. Association for Computational Linguistics (1997) 159–165
Bernth, A.: EasyEnglish: Preprocessing for MT. Proceedings of the Second InternationalWorkshop On Controlled Language Applications. Carnegie-Mellon University, Pittsburgh (1998) 30–41
Bernth, A.: EasyEnglish: Addressing Structural Ambiguity. These proceedings.
Bernth, A. and McCord, M. C.: LMT for Danish-English Machine Translation. In: Brown, C. G., Koch, G. eds: Natural Language Understanding and Logic Programming III. North-Holland (1991) 179–194
Bernth, A., McCord, M.C.: LMT at Tivoli Gardens. Proceedings of the 11th Nordic Conference on Computational Linguistics. Copenhagen (1998) 4–12
Gdaniec, C.: Lexical Choice and Syntactic Generation in a Transfer System: Transformations in the New LMT English-German System. These proceedings.
Lappin, S., McCord, M.C.: Anaphora Resolution in Slot Grammar. Computational Linguistics, Vol. 16. Association for Computational Linguistics (1990) 197–212
Lehmann, H.: Machine Translation for Home and Business Users. Proceedings of MT Summit V. Luxembourg, July 10–13 (1995) 107–115
McCord, M.C.: Slot Grammars. Computational Linguistics, Vol. 6. Association for Computational Linguistics (1980) 31–43
McCord, M.C.: A Prolog-Based Machine Translation System. Proceedings of the 1st Conference on Theoretical and Methodological Issues in Machine Translation, Colgate University (1985)
McCord, M.C.: Design of LMT: A Prolog-based Machine Translation System. Computational Linguistics, Vol. 15. Association for Computational Linguistics (1989) 33–52
McCord, M.C.: A New Version of the Machine Translation System LMT. Literary and Linguistic Computing 4 (1989) 218–229
McCord, M.C.: LMT, Proceedings of MT Summit II. Deutsche Gesellschaft für Dokumentation, Frankfurt (1989) 94–99
McCord, M.C.: Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars. In: Studer, R. (ed): Natural Language and Logic: International Scientific Symposium. Lecture Notes in Computer Science, Springer-Verlag, Berlin (1990) 118–145
McCord, M.C.: Heuristics for Broad-Coverage Natural Language Parsing. Proceedings of the ARPA Human Language Technology Workshop (1993) 127–132
Rimon, M., McCord, M. Schwall, U., Martínez, P.: Advances in Machine Translation Research in IBM. Proceedings of MT Summit III, Washington, D.C (1991) 11–18
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
McCord, M., Bernth, A. (1998). The LMT Transformational System. In: Farwell, D., Gerber, L., Hovy, E. (eds) Machine Translation and the Information Soup. AMTA 1998. Lecture Notes in Computer Science(), vol 1529. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49478-2_31
Download citation
DOI: https://doi.org/10.1007/3-540-49478-2_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65259-5
Online ISBN: 978-3-540-49478-2
eBook Packages: Springer Book Archive