<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="heafield-lavie-2010-voting">
    <titleInfo>
        <title>Voting on N-grams for Machine Translation System Combination</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Kenneth</namePart>
        <namePart type="family">Heafield</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Alon</namePart>
        <namePart type="family">Lavie</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2010-oct 31-nov 4</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers</title>
        </titleInfo>
        <originInfo>
            <publisher>Association for Machine Translation in the Americas</publisher>
            <place>
                <placeTerm type="text">Denver, Colorado, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>System combination exploits differences between machine translation systems to form a combined translation from several system outputs. Core to this process are features that reward n-gram matches between a candidate combination and each system output. Systems differ in performance at the n-gram level despite similar overall scores. We therefore advocate a new feature formulation: for each system and each small n, a feature counts n-gram matches between the system and candidate. We show post-evaluation improvement of 6.67 BLEU over the best system on NIST MT09 Arabic-English test data. Compared to a baseline system combination scheme from WMT 2009, we show improvement in the range of 1 BLEU point.</abstract>
    <identifier type="citekey">heafield-lavie-2010-voting</identifier>
    <location>
        <url>https://aclanthology.org/2010.amta-papers.34</url>
    </location>
    <part>
        <date>2010-oct 31-nov 4</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Voting on N-grams for Machine Translation System Combination
%A Heafield, Kenneth
%A Lavie, Alon
%S Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers
%D 2010
%8 oct 31 nov 4
%I Association for Machine Translation in the Americas
%C Denver, Colorado, USA
%F heafield-lavie-2010-voting
%X System combination exploits differences between machine translation systems to form a combined translation from several system outputs. Core to this process are features that reward n-gram matches between a candidate combination and each system output. Systems differ in performance at the n-gram level despite similar overall scores. We therefore advocate a new feature formulation: for each system and each small n, a feature counts n-gram matches between the system and candidate. We show post-evaluation improvement of 6.67 BLEU over the best system on NIST MT09 Arabic-English test data. Compared to a baseline system combination scheme from WMT 2009, we show improvement in the range of 1 BLEU point.
%U https://aclanthology.org/2010.amta-papers.34

Markdown (Informal)

[Voting on N-grams for Machine Translation System Combination](https://aclanthology.org/2010.amta-papers.34) (Heafield & Lavie, AMTA 2010)

• Voting on N-grams for Machine Translation System Combination (Heafield & Lavie, AMTA 2010)

ACL

• Kenneth Heafield and Alon Lavie. 2010. Voting on N-grams for Machine Translation System Combination. In Proceedings of the 9th Conference of the Association for Machine Translation in the Americas: Research Papers, Denver, Colorado, USA. Association for Machine Translation in the Americas.