Squibs: Restricted Non-Projectivity: Coverage vs. Efficiency
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
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 ParsingBracketing Encodings for 2-Planar Dependency Parsing
We present a bracketing-based encoding that can be used to represent any 2-planar dependency tree over a sentence of length n as a sequence of n labels, hence providing almost total coverage of crossing arcs in sequence …
Dependency ParsingPOSSentenceFormal Constraints on Dependency Syntax
Dependency syntax represents the structure of a sentence as a tree composed of dependencies, i.e., directed relations between lexical units. While in its more general form any such tree is allowed, in practice many are n…
Effective 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 Parsing