The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

Investigating multilingual dependency parsing

Author

Editor

  • 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.

Publishing year

2006

Language

English

Pages

206-210

Publication/Series

Proceedings of the Tenth Conference on Computational Natural Language Learning (CONLL-X)

Document type

Conference paper

Publisher

Association for Computational Linguistics

Topic

  • Computer Science

Keywords

  • 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