Branch and Bound Algorithm for Dependency Parsing with Non-local Features
نویسندگان
چکیده
منابع مشابه
Branch and Bound Algorithm for Dependency Parsing with Non-local Features
Graph based dependency parsing is inefficient when handling non-local features due to high computational complexity of inference. In this paper, we proposed an exact and efficient decoding algorithm based on the Branch and Bound (B&B) framework where nonlocal features are bounded by a linear combination of local features. Dynamic programming is used to search the upper bound. Experiments are co...
متن کاملTransition-based Dependency Parsing with Rich Non-local Features
Transition-based dependency parsers generally use heuristic decoding algorithms but can accommodate arbitrarily rich feature representations. In this paper, we show that we can improve the accuracy of such parsers by considering even richer feature sets than those employed in previous systems. In the standard Penn Treebank setup, our novel features improve attachment score form 91.4% to 92.9%, ...
متن کاملNon-Projective Dependency Parsing with Non-Local Transitions
We present a novel transition system, based on the Covington non-projective parser, introducing non-local transitions that can directly create arcs involving nodes to the left of the current focus positions. This avoids the need for long sequences of No-Arc transitions to create long-distance arcs, thus alleviating error propagation. The resulting parser outperforms the original version and ach...
متن کاملDependency Parsing Features for Semantic Parsing
Current semantic parsing systems either largely ignore the syntactic structure of the natural language input or attempt to learn highly underconstrained, noisy syntactic representations. We present two new classes of features for statistical semantic parsing that utilize information about syntactic structure, extracted from a dependency parse of an utterance, to score semantic parses for that u...
متن کاملDependency Parsing with Bounded Block Degree and Well-nestedness via Lagrangian Relaxation and Branch-and-Bound
We present a novel dependency parsing method which enforces two structural properties on dependency trees: bounded block degree and well-nestedness. These properties are useful to better represent the set of admissible dependency structures in treebanks and connect dependency parsing to context-sensitive grammatical formalisms. We cast this problem as an Integer Linear Program that we solve wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Association for Computational Linguistics
سال: 2013
ISSN: 2307-387X
DOI: 10.1162/tacl_a_00208