Discriminative classifiers for deterministic dependency parsing

35Citations
Citations of this article
98Readers
Mendeley users who have this article in their library.

Abstract

Deterministic parsing guided by treebank-induced classifiers has emerged as a simple and efficient alternative to more complex models for data-driven parsing. We present a systematic comparison of memory-based learning (MBL) and support vector machines (SVM) for inducing classifiers for deterministic dependency parsing, using data from Chinese, English and Swedish, together with a variety of different feature models. The comparison shows that SVM gives higher accuracy for richly articulated feature models across all languages, albeit with considerably longer training times. The results also confirm that classifier-based deterministic parsing can achieve parsing accuracy very close to the best results reported for more complex parsing models.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Hall, J., Nivre, J., & Nilsson, J. (2006). Discriminative classifiers for deterministic dependency parsing. In COLING/ACL 2006 - 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Main Conference Poster Sessions (pp. 316–323). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1273073.1273114

Readers over time

‘09‘10‘11‘12‘13‘14‘15‘16‘17‘18‘19‘20‘21‘22‘23‘24‘2506121824

Readers' Seniority

Tooltip

PhD / Post grad / Masters / Doc 37

64%

Researcher 12

21%

Professor / Associate Prof. 6

10%

Lecturer / Post doc 3

5%

Readers' Discipline

Tooltip

Computer Science 49

80%

Linguistics 8

13%

Engineering 3

5%

Neuroscience 1

2%

Save time finding and organizing research with Mendeley

Sign up for free
0