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 language | English |
---|---|
Pages | 221-225 |
Number of pages | 5 |
Publication status | Published - 2006 |
Event | 10th Conference on Computational Natural Language Learning, CoNLL 2006 - New York City, United States Duration: 8 Jun 2006 → 9 Jun 2006 |
Conference
Conference | 10th Conference on Computational Natural Language Learning, CoNLL 2006 |
---|---|
Country/Territory | United States |
City | New York City |
Period | 8/06/06 → 9/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.
Funders | Funder number |
---|---|
Vetenskapsrådet | |
Türkiye Bilimsel ve Teknolojik Araştirma Kurumu |