Labeled pseudo-projective dependency parsing with support vector machines

Joakim Nivre, Johan Hall, Jens Nilsson, Gülşen Eryiǧit, Svetoslav Marinov

Research output: Contribution to conferencePaperpeer-review

6 Citations (Scopus)

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.

Original languageEnglish
Pages221-225
Number of pages5
Publication statusPublished - 2006
Event10th Conference on Computational Natural Language Learning, CoNLL 2006 - New York City, United States
Duration: 8 Jun 20069 Jun 2006

Conference

Conference10th Conference on Computational Natural Language Learning, CoNLL 2006
Country/TerritoryUnited States
CityNew York City
Period8/06/069/06/06

Bibliographical note

Publisher Copyright:
© 2006 Association for Computational Linguistics

Funding

We are grateful for the support from TÜB˙TAK (The Scientific and Technical Research Council of Turkey) and the Swedish Research Council. We also want to thank Atanas Chanev for assistance with Slovene, the organizers of the shared task for all their hard work, and the creators of the treebanks for making the data available.

FundersFunder number
Vetenskapsrådet
Türkiye Bilimsel ve Teknolojik Araştirma Kurumu

    Fingerprint

    Dive into the research topics of 'Labeled pseudo-projective dependency parsing with support vector machines'. Together they form a unique fingerprint.

    Cite this