Representation Learning and Dynamic Programming for Arc-Hybrid Parsing
We present a new method for transition-based parsing where a solution is a pair made of a dependency tree and a derivation graph describing the construction of the former. From this representation we are able to derive an efficient parsing algorithm and design a neural network that learns vertex representations and arc scores. Experimentally, although we only train via local classifiers, our approach improves over previous arc-hybrid systems and reach state-of-the-art parsing accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
ARCRepresentation LearningSimilar Papers 제목 키워드 기반
Dependency-based Hybrid Trees for Semantic Parsing
We propose a novel dependency-based hybrid tree model for semantic parsing, which converts natural language utterance into machine interpretable meaning representations. Unlike previous state-of-the-art models, the seman…
Semantic ParsingFast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set
We first present a minimal feature set for transition-based dependency parsing, continuing a recent trend started by Kiperwasser and Goldberg (2016a) and Cross and Huang (2016a) of using bi-directional LSTM features. We …
ARCDependency ParsingTransition-Based Dependency ParsingOptimal Incremental Parsing via Best-First Dynamic Programming
Dynamic Programming for Higher Order Parsing of Gap-Minding Trees
Linear-Time Constituency Parsing with RNNs and Dynamic Programming
Recently, span-based constituency parsing has achieved competitive accuracies with extremely simple models by using bidirectional RNNs to model "spans". However, the minimal span parser of Stern et al (2017a) which holds…
Boundary DetectionConstituency ParsingDiscourse ParsingSentence