<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="oda-etal-2016-phrase">
    <titleInfo>
        <title>Phrase-based Machine Translation using Multiple Preordering Candidates</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Yusuke</namePart>
        <namePart type="family">Oda</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Taku</namePart>
        <namePart type="family">Kudo</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Tetsuji</namePart>
        <namePart type="family">Nakagawa</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Taro</namePart>
        <namePart type="family">Watanabe</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2016-12</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Yuji</namePart>
            <namePart type="family">Matsumoto</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Rashmi</namePart>
            <namePart type="family">Prasad</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>The COLING 2016 Organizing Committee</publisher>
            <place>
                <placeTerm type="text">Osaka, Japan</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>In this paper, we propose a new decoding method for phrase-based statistical machine translation which directly uses multiple preordering candidates as a graph structure. Compared with previous phrase-based decoding methods, our method is based on a simple left-to-right dynamic programming in which no decoding-time reordering is performed. As a result, its runtime is very fast and implementing the algorithm becomes easy. Our system does not depend on specific preordering methods as long as they output multiple preordering candidates, and it is trivial to employ existing preordering methods into our system. In our experiments for translating diverse 11 languages into English, the proposed method outperforms conventional phrase-based decoder in terms of translation qualities under comparable or faster decoding time.</abstract>
    <identifier type="citekey">oda-etal-2016-phrase</identifier>
    <location>
        <url>https://aclanthology.org/C16-1134</url>
    </location>
    <part>
        <date>2016-12</date>
        <extent unit="page">
            <start>1419</start>
            <end>1428</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Phrase-based Machine Translation using Multiple Preordering Candidates
%A Oda, Yusuke
%A Kudo, Taku
%A Nakagawa, Tetsuji
%A Watanabe, Taro
%Y Matsumoto, Yuji
%Y Prasad, Rashmi
%S Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers
%D 2016
%8 December
%I The COLING 2016 Organizing Committee
%C Osaka, Japan
%F oda-etal-2016-phrase
%X In this paper, we propose a new decoding method for phrase-based statistical machine translation which directly uses multiple preordering candidates as a graph structure. Compared with previous phrase-based decoding methods, our method is based on a simple left-to-right dynamic programming in which no decoding-time reordering is performed. As a result, its runtime is very fast and implementing the algorithm becomes easy. Our system does not depend on specific preordering methods as long as they output multiple preordering candidates, and it is trivial to employ existing preordering methods into our system. In our experiments for translating diverse 11 languages into English, the proposed method outperforms conventional phrase-based decoder in terms of translation qualities under comparable or faster decoding time.
%U https://aclanthology.org/C16-1134
%P 1419-1428

Markdown (Informal)

[Phrase-based Machine Translation using Multiple Preordering Candidates](https://aclanthology.org/C16-1134) (Oda et al., COLING 2016)

• Phrase-based Machine Translation using Multiple Preordering Candidates (Oda et al., COLING 2016)

ACL

• Yusuke Oda, Taku Kudo, Tetsuji Nakagawa, and Taro Watanabe. 2016. Phrase-based Machine Translation using Multiple Preordering Candidates. In Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers, pages 1419–1428, Osaka, Japan. The COLING 2016 Organizing Committee.