Recurrent models and lower bounds for projective syntactic decoding
The current state-of-the-art in neural graph-based parsing uses only approximate decoding at the training phase. In this paper aim to understand this result better. We show how recurrent models can carry out projective maximum spanning tree decoding. This result holds for both current state-of-the-art models for shift-reduce and graph-based parsers, projective or not. We also provide the first proof on the lower bounds of projective maximum spanning tree decoding.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Efficient Discontinuous Phrase-Structure Parsing via the Generalized Maximum Spanning Arborescence
We present a new method for the joint task of tagging and non-projective dependency parsing. We demonstrate its usefulness with an application to discontinuous phrase-structure parsing where decoding lexicalized spines a…
Dependency ParsingNon-Projective Dependency Parsing via Latent Heads Representation (LHR)
In this paper, we introduce a novel approach based on a bidirectional recurrent autoencoder to perform globally optimized non-projective dependency parsing via semi-supervised learning. The syntactic analysis is complete…
Dependency ParsingGlobal Greedy Dependency Parsing
Most syntactic dependency parsing models may fall into one of two categories: transition- and graph-based models. The former models enjoy high inference efficiency with linear time complexity, but they rely on the stacki…
ARCDependency ParsingRe-RankingSentenceLinear-time calculation of the expected sum of edge lengths in random projective linearizations of trees
The syntactic structure of a sentence is often represented using syntactic dependency trees. The sum of the distances between syntactically related words has been in the limelight for the past decades. Research on depend…
SentenceFast and Accurate Non-Projective Dependency Tree Linearization
We propose a graph-based method to tackle the dependency tree linearization task. We formulate the task as a Traveling Salesman Problem (TSP), and use a biaffine attention model to calculate the edge costs. We facilitate…
Traveling Salesman Problem