<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="li-khudanpur-2008-large">
    <titleInfo>
        <title>Large-scale Discriminative n-gram Language Models for Statistical Machine Translation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Zhifei</namePart>
        <namePart type="family">Li</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Sanjeev</namePart>
        <namePart type="family">Khudanpur</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2008-oct 21-25</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 8th 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">Waikiki, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We extend discriminative n-gram language modeling techniques originally proposed for automatic speech recognition to a statistical machine translation task. In this context, we propose a novel data selection method that leads to good models using a fraction of the training data. We carry out systematic experiments on several benchmark tests for Chinese to English translation using a hierarchical phrase-based machine translation system, and show that a discriminative language model significantly improves upon a state-of-the-art baseline. The experiments also highlight the benefits of our data selection method.</abstract>
    <identifier type="citekey">li-khudanpur-2008-large</identifier>
    <location>
        <url>https://aclanthology.org/2008.amta-papers.12</url>
    </location>
    <part>
        <date>2008-oct 21-25</date>
        <extent unit="page">
            <start>133</start>
            <end>142</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Large-scale Discriminative n-gram Language Models for Statistical Machine Translation
%A Li, Zhifei
%A Khudanpur, Sanjeev
%S Proceedings of the 8th Conference of the Association for Machine Translation in the Americas: Research Papers
%D 2008
%8 oct 21 25
%I Association for Machine Translation in the Americas
%C Waikiki, USA
%F li-khudanpur-2008-large
%X We extend discriminative n-gram language modeling techniques originally proposed for automatic speech recognition to a statistical machine translation task. In this context, we propose a novel data selection method that leads to good models using a fraction of the training data. We carry out systematic experiments on several benchmark tests for Chinese to English translation using a hierarchical phrase-based machine translation system, and show that a discriminative language model significantly improves upon a state-of-the-art baseline. The experiments also highlight the benefits of our data selection method.
%U https://aclanthology.org/2008.amta-papers.12
%P 133-142

Markdown (Informal)

[Large-scale Discriminative n-gram Language Models for Statistical Machine Translation](https://aclanthology.org/2008.amta-papers.12) (Li & Khudanpur, AMTA 2008)

• Large-scale Discriminative n-gram Language Models for Statistical Machine Translation (Li & Khudanpur, AMTA 2008)

ACL

• Zhifei Li and Sanjeev Khudanpur. 2008. Large-scale Discriminative n-gram Language Models for Statistical Machine Translation. In Proceedings of the 8th Conference of the Association for Machine Translation in the Americas: Research Papers, pages 133–142, Waikiki, USA. Association for Machine Translation in the Americas.