A Transition-based Algorithm for Unrestricted AMR Parsing
Non-projective parsing can be useful to handle cycles and reentrancy in AMR graphs. We explore this idea and introduce a greedy left-to-right non-projective transition-based parser. At each parsing configuration, an oracle decides whether to create a concept or whether to connect a pair of existing concepts. The algorithm handles reentrancy and arbitrary cycles natively, i.e. within the transition system itself. The model is evaluated on the LDC2015E86 corpus, obtaining results close to the state of the art, including a Smatch of 64%, and showing good behavior on reentrant edges.
Code (1)
Tasks
AMR ParsingSimilar Papers 제목 키워드 기반
Non-Deterministic Oracles for Unrestricted Non-Projective Transition-Based Dependency Parsing
A Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing
We propose an efficient dynamic oracle for training the 2-Planar transition-based parser, a linear-time parser with over 99% coverage on non-projective syntactic corpora. This novel approach outperforms the static traini…
ARCDependency ParsingA Dynamic Oracle for Linear-Time 2-Planar Dependency Parsing
We propose an efficient dynamic oracle for training the 2-Planar transition-based parser, a linear-time parser with over 99{\%} coverage on non-projective syntactic corpora. This novel approach outperforms the static tra…
ARCDependency ParsingEffective Online Reordering with Arc-Eager Transitions
We present a new transition system with word reordering for unrestricted non-projective dependency parsing. Our system is based on decomposed arc-eager rather than arc-standard, which allows more flexible ambiguity resol…
ARCDependency ParsingTransition-Based Dependency ParsingA Full Non-Monotonic Transition System for Unrestricted Non-Projective Parsing
Restricted non-monotonicity has been shown beneficial for the projective arc-eager dependency parser in previous research, as posterior decisions can repair mistakes made in previous states due to the lack of information…
ARC