<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="qian-liu-2014-2">
    <titleInfo>
        <title>2-Slave Dual Decomposition for Generalized Higher Order CRFs</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Xian</namePart>
        <namePart type="family">Qian</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Yang</namePart>
        <namePart type="family">Liu</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2014</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>We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming; the other is a supermodular quadratic pseudo-Boolean maximization problem, which can be solved in cubic time using a minimum cut algorithm. We use dual decomposition to force their agreement. Experimental results on Twitter named entity recognition and sentence dependency tagging tasks show that our method outperforms spanning tree based dual decomposition.</abstract>
    <identifier type="citekey">qian-liu-2014-2</identifier>
    <identifier type="doi">10.1162/tacl_a_00187</identifier>
    <location>
        <url>https://aclanthology.org/Q14-1027</url>
    </location>
    <part>
        <date>2014</date>
        <detail type="volume"><number>2</number></detail>
        <extent unit="page">
            <start>339</start>
            <end>350</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T 2-Slave Dual Decomposition for Generalized Higher Order CRFs
%A Qian, Xian
%A Liu, Yang
%J Transactions of the Association for Computational Linguistics
%D 2014
%V 2
%I MIT Press
%C Cambridge, MA
%F qian-liu-2014-2
%X We show that the decoding problem in generalized Higher Order Conditional Random Fields (CRFs) can be decomposed into two parts: one is a tree labeling problem that can be solved in linear time using dynamic programming; the other is a supermodular quadratic pseudo-Boolean maximization problem, which can be solved in cubic time using a minimum cut algorithm. We use dual decomposition to force their agreement. Experimental results on Twitter named entity recognition and sentence dependency tagging tasks show that our method outperforms spanning tree based dual decomposition.
%R 10.1162/tacl_a_00187
%U https://aclanthology.org/Q14-1027
%U https://doi.org/10.1162/tacl_a_00187
%P 339-350

Markdown (Informal)

[2-Slave Dual Decomposition for Generalized Higher Order CRFs](https://aclanthology.org/Q14-1027) (Qian & Liu, TACL 2014)

• 2-Slave Dual Decomposition for Generalized Higher Order CRFs (Qian & Liu, TACL 2014)

ACL

• Xian Qian and Yang Liu. 2014. 2-Slave Dual Decomposition for Generalized Higher Order CRFs. Transactions of the Association for Computational Linguistics, 2:339–350.