Cache Transition Systems for Graph Parsing

@article{Gildea2018CacheTS,
  title={Cache Transition Systems for Graph Parsing},
  author={Daniel Gildea and Giorgio Satta and Xiaochang Peng},
  journal={Computational Linguistics},
  year={2018},
  volume={44},
  pages={85-118}
}
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… CONTINUE READING