<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="yli-jyra-gomez-rodriguez-2017-generic">
    <titleInfo>
        <title>Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing</title>
    </titleInfo>
    <name type="personal">
        <namePart type="given">Anssi</namePart>
        <namePart type="family">Yli-Jyrä</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Carlos</namePart>
        <namePart type="family">Gómez-Rodríguez</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2017-07</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <relatedItem type="host">
        <titleInfo>
            <title>Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</title>
        </titleInfo>
        <name type="personal">
            <namePart type="given">Regina</namePart>
            <namePart type="family">Barzilay</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <name type="personal">
            <namePart type="given">Min-Yen</namePart>
            <namePart type="family">Kan</namePart>
            <role>
                <roleTerm authority="marcrelator" type="text">editor</roleTerm>
            </role>
        </name>
        <originInfo>
            <publisher>Association for Computational Linguistics</publisher>
            <place>
                <placeTerm type="text">Vancouver, Canada</placeTerm>
            </place>
        </originInfo>
        <genre authority="marcgt">conference publication</genre>
    </relatedItem>
    <abstract>We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.</abstract>
    <identifier type="citekey">yli-jyra-gomez-rodriguez-2017-generic</identifier>
    <identifier type="doi">10.18653/v1/P17-1160</identifier>
    <location>
        <url>https://aclanthology.org/P17-1160</url>
    </location>
    <part>
        <date>2017-07</date>
        <extent unit="page">
            <start>1745</start>
            <end>1755</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Conference Proceedings
%T Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing
%A Yli-Jyrä, Anssi
%A Gómez-Rodríguez, Carlos
%Y Barzilay, Regina
%Y Kan, Min-Yen
%S Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)
%D 2017
%8 July
%I Association for Computational Linguistics
%C Vancouver, Canada
%F yli-jyra-gomez-rodriguez-2017-generic
%X We present a simple encoding for unlabeled noncrossing graphs and show how its latent counterpart helps us to represent several families of directed and undirected graphs used in syntactic and semantic parsing of natural language as context-free languages. The families are separated purely on the basis of forbidden patterns in latent encoding, eliminating the need to differentiate the families of non-crossing graphs in inference algorithms: one algorithm works for all when the search space can be controlled in parser input.
%R 10.18653/v1/P17-1160
%U https://aclanthology.org/P17-1160
%U https://doi.org/10.18653/v1/P17-1160
%P 1745-1755

Markdown (Informal)

[Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing](https://aclanthology.org/P17-1160) (Yli-Jyrä & Gómez-Rodríguez, ACL 2017)

• Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing (Yli-Jyrä & Gómez-Rodríguez, ACL 2017)

ACL

• Anssi Yli-Jyrä and Carlos Gómez-Rodríguez. 2017. Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1745–1755, Vancouver, Canada. Association for Computational Linguistics.