<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="nesson-etal-2006-induction">
    <titleInfo>
        <title>Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Rebecca</namePart>
        <namePart type="family">Nesson</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Stuart</namePart>
        <namePart type="family">Shieber</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Alexander</namePart>
        <namePart type="family">Rush</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2006-aug 8-12</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 7th Conference of the Association for Machine Translation in the Americas: Technical Papers</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Machine Translation in the Americas</publisher>
            <place>
                <placeTerm type="text">Cambridge, Massachusetts, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>The more expressive and flexible a base formalism for machine translation is, the less efficient parsing of it will be. However, even among formalisms with the same parse complexity, some formalisms better realize the desired characteristics for machine translation formalisms than others. We introduce a particular formalism, probabilistic synchronous tree-insertion grammar (PSTIG) that we argue satisfies the desiderata optimally within the class of formalisms that can be parsed no less efficiently than context-free grammars and demonstrate that it outperforms state-of-the-art word-based and phrase-based finite-state translation models on training and test data taken from the EuroParl corpus (Koehn, 2005). We then argue that a higher level of translation quality can be achieved by hybridizing our in- duced model with elementary structures produced using supervised techniques such as those of Groves et al. (2004).</abstract>
    <identifier type="citekey">nesson-etal-2006-induction</identifier>
    <location>
        <url>https://aclanthology.org/2006.amta-papers.15</url>
    </location>
    <part>
        <date>2006-aug 8-12</date>
        <extent unit="page">
            <start>128</start>
            <end>137</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation
%A Nesson, Rebecca
%A Shieber, Stuart
%A Rush, Alexander
%S Proceedings of the 7th Conference of the Association for Machine Translation in the Americas: Technical Papers
%D 2006
%8 aug 8 12
%I Association for Machine Translation in the Americas
%C Cambridge, Massachusetts, USA
%F nesson-etal-2006-induction
%X The more expressive and flexible a base formalism for machine translation is, the less efficient parsing of it will be. However, even among formalisms with the same parse complexity, some formalisms better realize the desired characteristics for machine translation formalisms than others. We introduce a particular formalism, probabilistic synchronous tree-insertion grammar (PSTIG) that we argue satisfies the desiderata optimally within the class of formalisms that can be parsed no less efficiently than context-free grammars and demonstrate that it outperforms state-of-the-art word-based and phrase-based finite-state translation models on training and test data taken from the EuroParl corpus (Koehn, 2005). We then argue that a higher level of translation quality can be achieved by hybridizing our in- duced model with elementary structures produced using supervised techniques such as those of Groves et al. (2004).
%U https://aclanthology.org/2006.amta-papers.15
%P 128-137

Markdown (Informal)

[Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation](https://aclanthology.org/2006.amta-papers.15) (Nesson et al., AMTA 2006)

• Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation (Nesson et al., AMTA 2006)

ACL

• Rebecca Nesson, Stuart Shieber, and Alexander Rush. 2006. Induction of Probabilistic Synchronous Tree-Insertion Grammars for Machine Translation. In Proceedings of the 7th Conference of the Association for Machine Translation in the Americas: Technical Papers, pages 128–137, Cambridge, Massachusetts, USA. Association for Machine Translation in the Americas.