Non-Deterministic Oracles for Unrestricted Non-Projective Transition-Based Dependency Parsing
Code (0)
등록된 구현이 없습니다.
Tasks
Dependency ParsingTransition-Based Dependency ParsingSimilar Papers 제목 키워드 기반
Exploiting Dynamic Oracles to Train Projective Dependency Parsers on Non-Projective Trees
Because the most common transition systems are projective, training a transition-based dependency parser often implies to either ignore or rewrite the non-projective training examples, which has an adverse impact on accu…
Dependency 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 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 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