Publication:
Dependency parsing as a classification problem

Thumbnail Image

Departments

School / College / Institute

Program

KU-Authors

KU Authors

Co-Authors

Publication Date

Language

Embargo Status

NO

Journal Title

Journal ISSN

Volume Title

Alternative Title

Abstract

This paper presents an approach to dependency parsing which can utilize any standard machine learning (classification) algorithm. A decision list learner was used in this work. The training data provided in the form of a treebank is converted to a format in which each instance represents information about one word pair, and the classification indicates the existence, direction, and type of the link between the words of the pair. Several distinct models are built to identify the links between word pairs at different distances. These models are applied sequentially to give the dependency parse of a sentence, favoring shorter links. An analysis of the errors, attribute selection, and comparison of different languages is presented.

Source

Publisher

Association for Computing Machinery (ACM)

Subject

Treebank, Semantic roles, Word segmentation

Citation

Has Part

Source

CoNLL-X '06: Proceedings of the Tenth Conference on Computational Natural Language Learning

Book Series Title

Edition

DOI

10.3115/1596276.1596323

item.page.datauri

Link

Rights

Copyrights Note

Endorsement

Review

Supplemented By

Referenced By

0

Views

5

Downloads

View PlumX Details