Dependency Parsing as a Classification Problem

Deniz Yuret (2006) ( PDF ): Dependency Parsing as a Classification Problem. In Proceedings of the Tenth Conference on Computational Natural Language Learning (CoNLL-X).

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.