<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="zhai-etal-2013-unsupervised">
    <titleInfo>
        <title>Unsupervised Tree Induction for Tree-based Translation</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Feifei</namePart>
        <namePart type="family">Zhai</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Jiajun</namePart>
        <namePart type="family">Zhang</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Yu</namePart>
        <namePart type="family">Zhou</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Chengqing</namePart>
        <namePart type="family">Zong</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2013</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>Transactions of the Association for Computational Linguistics</title>
        </titleInfo>
        <originInfo>
            <issuance>continuing</issuance>
            <publisher>MIT Press</publisher>
            <place>
                <placeTerm type="text">Cambridge, MA</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">periodical</genre>
        <genre authority="bibutilsgt">academic journal</genre>
    </relatedItem>
    <abstract>In current research, most tree-based translation models are built directly from parse trees. In this study, we go in another direction and build a translation model with an unsupervised tree structure derived from a novel non-parametric Bayesian model. In the model, we utilize synchronous tree substitution grammars (STSG) to capture the bilingual mapping between language pairs. To train the model efficiently, we develop a Gibbs sampler with three novel Gibbs operators. The sampler is capable of exploring the infinite space of tree structures by performing local changes on the tree nodes. Experimental results show that the string-to-tree translation system using our Bayesian tree structures significantly outperforms the strong baseline string-to-tree system using parse trees.</abstract>
    <identifier type="citekey">zhai-etal-2013-unsupervised</identifier>
    <identifier type="doi">10.1162/tacl_a_00224</identifier>
    <location>
        <url>https://aclanthology.org/Q13-1020</url>
    </location>
    <part>
        <date>2013</date>
        <detail type="volume"><number>1</number></detail>
        <extent unit="page">
            <start>243</start>
            <end>254</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Unsupervised Tree Induction for Tree-based Translation
%A Zhai, Feifei
%A Zhang, Jiajun
%A Zhou, Yu
%A Zong, Chengqing
%J Transactions of the Association for Computational Linguistics
%D 2013
%V 1
%I MIT Press
%C Cambridge, MA
%F zhai-etal-2013-unsupervised
%X In current research, most tree-based translation models are built directly from parse trees. In this study, we go in another direction and build a translation model with an unsupervised tree structure derived from a novel non-parametric Bayesian model. In the model, we utilize synchronous tree substitution grammars (STSG) to capture the bilingual mapping between language pairs. To train the model efficiently, we develop a Gibbs sampler with three novel Gibbs operators. The sampler is capable of exploring the infinite space of tree structures by performing local changes on the tree nodes. Experimental results show that the string-to-tree translation system using our Bayesian tree structures significantly outperforms the strong baseline string-to-tree system using parse trees.
%R 10.1162/tacl_a_00224
%U https://aclanthology.org/Q13-1020
%U https://doi.org/10.1162/tacl_a_00224
%P 243-254

Markdown (Informal)

[Unsupervised Tree Induction for Tree-based Translation](https://aclanthology.org/Q13-1020) (Zhai et al., TACL 2013)

• Unsupervised Tree Induction for Tree-based Translation (Zhai et al., TACL 2013)

ACL

• Feifei Zhai, Jiajun Zhang, Yu Zhou, and Chengqing Zong. 2013. Unsupervised Tree Induction for Tree-based Translation. Transactions of the Association for Computational Linguistics, 1:243–254.