Publication at Faculty of Mathematics and Physics |
2008
Abstract
In this article we want to demonstrate that annotation of multiword expressions in the Prague Dependency Treebank is a well defined task, that it is useful as well as feasible, and that we can achieve good consistency of such annotations in terms of inter-annotator agreement. We show a way to measure agreement for this type of annotation.
We also argue that some automatic pre-annotation is possible and it does not damage the results.