Dependency Parsing as a Sequence Labeling Task

Abstract

The aim of this paper is to explore the feasibility of solving the dependency parsing problem using sequence labeling tools. We introduce an algorithm to transform a dependency tree into a tag sequence suitable for a sequence labeling algorithm and evaluate several parameter settings on the standard treebank data. We focus mainly on Czech, as a high-inflective freeword-order language, which is not so easy to parse using traditional techniques, but we also test our approach on English for comparison.