Labeled pseudo-projective dependency parsing with support vector machines

6Citations
Citations of this article
131Readers
Mendeley users who have this article in their library.

Abstract

We use SVM classifiers to predict the next action of a deterministic parser that builds labeled projective dependency graphs in an incremental fashion. Non-projective dependencies are captured indirectly by projectivizing the training data for the classifiers and applying an inverse transformation to the output of the parser. We present evaluation results and an error analysis focusing on Swedish and Turkish.

Cite

CITATION STYLE

APA

Nivre, J., Hall, J., Nilsson, J., Eryiǧit, G., & Marinov, S. (2006). Labeled pseudo-projective dependency parsing with support vector machines. In CoNLL 2006 - Proceedings of the 10th Conference on Computational Natural Language Learning (pp. 221–225). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1596276.1596318

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free