文章基本信息

标题：Cache Transition Systems for Graph Parsing
本地全文：下载
作者：Daniel Gildea ; Giorgio Satta ; Xiaochang Peng 等
期刊名称：Computational Linguistics
印刷版ISSN：0891-2017
电子版ISSN：1530-9312
出版年度：2018
卷号：44
期号：1
页码：85-118
DOI：10.1162/COLI_a_00308
语种：English
出版社：MIT Press
摘要：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.