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.- Anthology ID:
- 1998.amta-papers.30
- Volume:
- Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers
- Month:
- October 28-31
- Year:
- 1998
- Address:
- Langhorne, PA, USA
- Venue:
- AMTA
- SIG:
- Publisher:
- Springer
- Note:
- Pages:
- 344–355
- Language:
- URL:
- https://link.springer.com/chapter/10.1007/3-540-49478-2_31
- DOI:
- Cite (ACL):
- Michael McCord and Arendse Bernth. 1998. The LMT Transformational System. In Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers, pages 344–355, Langhorne, PA, USA. Springer.
- Cite (Informal):
- The LMT Transformational System (McCord & Bernth, AMTA 1998)
- PDF:
- https://link.springer.com/chapter/10.1007/3-540-49478-2_31