<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="callison-burch-flournoy-2001-program">
    <titleInfo>
        <title>A program for automatically selecting the best output from multiple machine translation engines</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Chris</namePart>
        <namePart type="family">Callison-Burch</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Raymond</namePart>
        <namePart type="given">S</namePart>
        <namePart type="family">Flournoy</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2001-sep 18-22</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of Machine Translation Summit VIII</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Bente</namePart>
            <namePart type="family">Maegaard</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <place>
                <placeTerm type="text">Santiago de Compostela, Spain</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>This paper describes a program that automatically selects the best translation from a set of translations produced by multiple commercial machine translation engines. The program is simplified by assuming that the most fluent item in the set is the best translation. Fluency is determined using a trigram language model. Results are provided illustrating how well the program performs for human ranked data as compared to each of its constituent engines.</abstract>
    <identifier type="citekey">callison-burch-flournoy-2001-program</identifier>
    <location>
        <url>https://aclanthology.org/2001.mtsummit-papers.12</url>
    </location>
    <part>
        <date>2001-sep 18-22</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T A program for automatically selecting the best output from multiple machine translation engines
%A Callison-Burch, Chris
%A Flournoy, Raymond S.
%Y Maegaard, Bente
%S Proceedings of Machine Translation Summit VIII
%D 2001
%8 sep 18 22
%C Santiago de Compostela, Spain
%F callison-burch-flournoy-2001-program
%X This paper describes a program that automatically selects the best translation from a set of translations produced by multiple commercial machine translation engines. The program is simplified by assuming that the most fluent item in the set is the best translation. Fluency is determined using a trigram language model. Results are provided illustrating how well the program performs for human ranked data as compared to each of its constituent engines.
%U https://aclanthology.org/2001.mtsummit-papers.12

Markdown (Informal)

[A program for automatically selecting the best output from multiple machine translation engines](https://aclanthology.org/2001.mtsummit-papers.12) (Callison-Burch & Flournoy, MTSummit 2001)

• A program for automatically selecting the best output from multiple machine translation engines (Callison-Burch & Flournoy, MTSummit 2001)

ACL

• Chris Callison-Burch and Raymond S. Flournoy. 2001. A program for automatically selecting the best output from multiple machine translation engines. In Proceedings of Machine Translation Summit VIII, Santiago de Compostela, Spain.