Application of feature propagation to dependency parsing (original) (raw)
2009, … of the 11th International Conference on …
Related papers
Dependency parsing with undirected graphs
2012
Abstract We introduce a new approach to transitionbased dependency parsing in which the parser does not directly construct a dependency structure, but rather an undirected graph, which is then converted into a directed dependency tree in a post-processing step. This alleviates error propagation, since undirected parsers do not need to observe the single-head constraint.
A Transition-Based Dependency Parser Using a Dynamic Parsing Strategy
2013
We present a novel transition-based, greedy dependency parser which implements a flexible mix of bottom-up and top-down strategies. The new strategy allows the parser to postpone difficult decisions until the relevant information becomes available. The novel parser has a 12% error reduction in unlabeled attachment score over an arc-eager parser, with a slow-down factor of 2.8.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.