<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="ding-etal-2003-algorithm">
    <titleInfo>
        <title>An algorithm for word-level alignment of parallel dependency trees</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Yuan</namePart>
        <namePart type="family">Ding</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Daniel</namePart>
        <namePart type="family">Gildea</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Martha</namePart>
        <namePart type="family">Palmer</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2003-sep 23-27</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of Machine Translation Summit IX: Papers</title>
        </titleInfo>
        <originInfo>
            <place>
                <placeTerm type="text">New Orleans, USA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>Structural divergence presents a challenge to the use of syntax in statistical machine translation. We address this problem with a new algorithm for alignment of loosely matched non-isomorphic dependency trees. The algorithm selectively relaxes the constraints of the two tree structures while keeping computational complexity polynomial in the length of the sentences. Experimentation with a large Chinese-English corpus shows an improvement in alignment results over the unstructured models of (Brown et al., 1993).</abstract>
    <identifier type="citekey">ding-etal-2003-algorithm</identifier>
    <location>
        <url>https://aclanthology.org/2003.mtsummit-papers.13</url>
    </location>
    <part>
        <date>2003-sep 23-27</date>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T An algorithm for word-level alignment of parallel dependency trees
%A Ding, Yuan
%A Gildea, Daniel
%A Palmer, Martha
%S Proceedings of Machine Translation Summit IX: Papers
%D 2003
%8 sep 23 27
%C New Orleans, USA
%F ding-etal-2003-algorithm
%X Structural divergence presents a challenge to the use of syntax in statistical machine translation. We address this problem with a new algorithm for alignment of loosely matched non-isomorphic dependency trees. The algorithm selectively relaxes the constraints of the two tree structures while keeping computational complexity polynomial in the length of the sentences. Experimentation with a large Chinese-English corpus shows an improvement in alignment results over the unstructured models of (Brown et al., 1993).
%U https://aclanthology.org/2003.mtsummit-papers.13

Markdown (Informal)

[An algorithm for word-level alignment of parallel dependency trees](https://aclanthology.org/2003.mtsummit-papers.13) (Ding et al., MTSummit 2003)

• An algorithm for word-level alignment of parallel dependency trees (Ding et al., MTSummit 2003)

ACL

• Yuan Ding, Daniel Gildea, and Martha Palmer. 2003. An algorithm for word-level alignment of parallel dependency trees. In Proceedings of Machine Translation Summit IX: Papers, New Orleans, USA.