@inproceedings{jones-havrilla-1998-twisted,
title = "Twisted pair grammar: support for rapid development of machine translation for low density languages",
author = "Jones, Douglas and
Havrilla, Rick",
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_29",
pages = "318--332",
abstract = "We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface.",
}
<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="jones-havrilla-1998-twisted">
<titleInfo>
<title>Twisted pair grammar: support for rapid development of machine translation for low density languages</title>
</titleInfo>
<name type="personal">
<namePart type="given">Douglas</namePart>
<namePart type="family">Jones</namePart>
<role>
<roleTerm authority="marcrelator" type="text">author</roleTerm>
</role>
</name>
<name type="personal">
<namePart type="given">Rick</namePart>
<namePart type="family">Havrilla</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 describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface.</abstract>
<identifier type="citekey">jones-havrilla-1998-twisted</identifier>
<location>
<url>https://link.springer.com/chapter/10.1007/3-540-49478-2_29</url>
</location>
<part>
<date>1998-oct 28-31</date>
<extent unit="page">
<start>318</start>
<end>332</end>
</extent>
</part>
</mods>
</modsCollection>
%0 Conference Proceedings
%T Twisted pair grammar: support for rapid development of machine translation for low density languages
%A Jones, Douglas
%A Havrilla, Rick
%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 jones-havrilla-1998-twisted
%X We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface.
%U https://link.springer.com/chapter/10.1007/3-540-49478-2_29
%P 318-332
Markdown (Informal)
[Twisted pair grammar: support for rapid development of machine translation for low density languages](https://link.springer.com/chapter/10.1007/3-540-49478-2_29) (Jones & Havrilla, AMTA 1998)
ACL