@article{gildea-etal-2018-cache,
    title = "Cache Transition Systems for Graph Parsing",
    author = "Gildea, Daniel  and
      Satta, Giorgio  and
      Peng, Xiaochang",
    journal = "Computational Linguistics",
    volume = "44",
    number = "1",
    month = apr,
    year = "2018",
    address = "Cambridge, MA",
    publisher = "MIT Press",
    url = "https://preview.aclanthology.org/fix-sig-urls/J18-1004/",
    doi = "10.1162/COLI_a_00308",
    pages = "85--118",
    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."
}