Abstrakt
We present a MIRA-based labeller designed to assign dependency relation labels to edges in a dependency parse tree, tuned for Czech language. The labeller was created to be used as a second stage to unlabelled dependency parsers but can also improve output from labelled dependency parsers.
We evaluate two existing techniques which can be used for labelling and experiment with combining them together. We describe the feature set used.
Our final setup significantly outperforms the best results from the CoNLL 2009 shared task.