CoNLL X
Related Papers
K-best Spanning Tree Parsing
This paper introduces a Maximum Entropy dependency parser based on an efficient k- best Maximum Spanning Tree (MST) algo- rithm. Although recent work suggests that the edge-factored constraints of the …...
Integrating Graph-Based and Transition-Based Dependency Parsers
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning and inference. In this paper, …...
A Transition-Based Parser for 2-Planar Dependency Structures
Finding a class of structures that is rich enough for adequate linguistic represen- tation yet restricted enough for efficient computational processing is an important problem for dependency parsing. In this …...
Template Kernels for Dependency Parsing
A common approach to dependency parsing is scoring a parse via a linear function of a set of indicator features. These features are typically manually constructed from templates that are …...