<?xml version="1.0" encoding="UTF-8"?>
<modsCollection xmlns="http://www.loc.gov/mods/v3">
<mods ID="gildea-etal-2018-cache">
    <titleInfo>
        <title>Cache Transition Systems for Graph Parsing</title>
    </titleInfo>
    <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">Giorgio</namePart>
        <namePart type="family">Satta</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <name type="personal">
        <namePart type="given">Xiaochang</namePart>
        <namePart type="family">Peng</namePart>
        <role>
            <roleTerm authority="marcrelator" type="text">author</roleTerm>
        </role>
    </name>
    <originInfo>
        <dateIssued>2018-04</dateIssued>
    </originInfo>
    <typeOfResource>text</typeOfResource>
    <genre authority="bibutilsgt">journal article</genre>
    <relatedItem type="host">
        <titleInfo>
            <title>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>Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characterize the relationship between the parameter m and the class of graphs that can be produced through the graph-theoretic concept of tree decomposition. We find empirically that small cache sizes cover a high percentage of sentences in existing semantic corpora.</abstract>
    <identifier type="citekey">gildea-etal-2018-cache</identifier>
    <identifier type="doi">10.1162/COLI_a_00308</identifier>
    <location>
        <url>https://aclanthology.org/J18-1004</url>
    </location>
    <part>
        <date>2018-04</date>
        <detail type="volume"><number>44</number></detail>
        <detail type="issue"><number>1</number></detail>
        <extent unit="page">
            <start>85</start>
            <end>118</end>
        </extent>
    </part>
</mods>
</modsCollection>

%0 Journal Article
%T Cache Transition Systems for Graph Parsing
%A Gildea, Daniel
%A Satta, Giorgio
%A Peng, Xiaochang
%J Computational Linguistics
%D 2018
%8 April
%V 44
%N 1
%I MIT Press
%C Cambridge, MA
%F gildea-etal-2018-cache
%X Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree. Our system includes a cache with fixed size m, and we characterize the relationship between the parameter m and the class of graphs that can be produced through the graph-theoretic concept of tree decomposition. We find empirically that small cache sizes cover a high percentage of sentences in existing semantic corpora.
%R 10.1162/COLI_a_00308
%U https://aclanthology.org/J18-1004
%U https://doi.org/10.1162/COLI_a_00308
%P 85-118

Markdown (Informal)

[Cache Transition Systems for Graph Parsing](https://aclanthology.org/J18-1004) (Gildea et al., CL 2018)

• Cache Transition Systems for Graph Parsing (Gildea et al., CL 2018)

ACL

• Daniel Gildea, Giorgio Satta, and Xiaochang Peng. 2018. Cache Transition Systems for Graph Parsing. Computational Linguistics, 44(1):85–118.