@inproceedings{mccord-bernth-1998-lmt,
title = "The {LMT} Transformational System",
author = "McCord, Michael and
Bernth, Arendse",
editor = "Farwell, David and
Gerber, Laurie and
Hovy, Eduard",
booktitle = "Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers",
month = oct # " 28-31",
year = "1998",
address = "Langhorne, PA, USA",
publisher = "Springer",
url = "https://link.springer.com/chapter/10.1007/3-540-49478-2_31",
pages = "344--355",
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.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="mccord-bernth-1998-lmt">
<titleInfo>
<title>The LMT Transformational System</title>
</titleInfo>
<name type="personal">
<namePart type="given">Michael</namePart>
<namePart type="family">McCord</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Arendse</namePart>
<namePart type="family">Bernth</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<originInfo>
<dateIssued>1998-oct 28-31</dateIssued>
</originInfo>
<typeOfResource>text</typeOfResource>
<relatedItem type="host">
<titleInfo>
<title>Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers</title>
</titleInfo>
<name type="personal">
<namePart type="given">David</namePart>
<namePart type="family">Farwell</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Laurie</namePart>
<namePart type="family">Gerber</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Eduard</namePart>
<namePart type="family">Hovy</namePart>
<role>
<roleTerm authority="marcrelator" type="text">editor</roleTerm>
</role>
</name>
<originInfo>
<publisher>Springer</publisher>
<place>
<placeTerm type="text">Langhorne, PA, USA</placeTerm>
</place>
</originInfo>
<genre authority="marcgt">conference publication</genre>
</relatedItem>
<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.</abstract>
<identifier type="citekey">mccord-bernth-1998-lmt</identifier>
<location>
<url>https://link.springer.com/chapter/10.1007/3-540-49478-2_31</url>
</location>
<part>
<date>1998-oct 28-31</date>
<extent unit="page">
<start>344</start>
<end>355</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T The LMT Transformational System
%A McCord, Michael
%A Bernth, Arendse
%Y Farwell, David
%Y Gerber, Laurie
%Y Hovy, Eduard
%S Proceedings of the Third Conference of the Association for Machine Translation in the Americas: Technical Papers
%D 1998
%8 oct 28 31
%I Springer
%C Langhorne, PA, USA
%F mccord-bernth-1998-lmt
%X 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.
%U https://link.springer.com/chapter/10.1007/3-540-49478-2_31
%P 344-355
Markdown (Informal)
[The LMT Transformational System](https://link.springer.com/chapter/10.1007/3-540-49478-2_31) (McCord & Bernth, AMTA 1998)
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.