Investigating multilingual dependency parsing
Författare
Redaktör
- Lluís Màrquez
- Dan Klein
Summary, in English
In this paper, we describe a system for the CoNLL-X shared task of multilingual dependency parsing. It uses a baseline Nivre’s parser (Nivre, 2003) that first identifies the parse actions and then labels the dependency arcs. These two steps are implemented as SVM classifiers using LIBSVM. Features take into account the static context as well as relations dynamically built during parsing.
We experimented two main additions to our implementation of Nivre’s parser: N-best search and bidirectional parsing. We trained the parser in both left-right and right-left directions and we combined the results. To construct a single-head, rooted, and cycle-free tree, we applied the Chu-Liu/Edmonds optimization algorithm. We ran the same algorithm with the same parameters on all the languages.
We experimented two main additions to our implementation of Nivre’s parser: N-best search and bidirectional parsing. We trained the parser in both left-right and right-left directions and we combined the results. To construct a single-head, rooted, and cycle-free tree, we applied the Chu-Liu/Edmonds optimization algorithm. We ran the same algorithm with the same parameters on all the languages.
Publiceringsår
2006
Språk
Engelska
Sidor
206-210
Publikation/Tidskrift/Serie
Proceedings of the Tenth Conference on Computational Natural Language Learning (CONLL-X)
Fulltext
- Available as PDF - 63 kB
- Download statistics
Dokumenttyp
Konferensbidrag
Förlag
Association for Computational Linguistics
Ämne
- Computer Science
Nyckelord
- Natural language processing
- dependency parsing
Conference name
Tenth Conference on Computational Natural Language Learning (CONLL-X)
Conference date
2006-06-08 - 2006-06-09
Conference place
New York, United States
Status
Published