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.
Cite
CITATION STYLE
McCord, M., & Bernth, A. (1998). The LMT transformational system. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1529, pp. 344–355). Springer Verlag. https://doi.org/10.1007/3-540-49478-2_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
