Annotation of regular polysemy and underspecification

Comunicació presentada a: 51st Annual Meeting of the Association for Computational Linguistics, celebrat a Sofia, Bulgaria, del 4 al 9 d'agost de 2013.We present the result of an annotation task on regular polysemy for a series of semantic classes or dot types in English, Danish and Spanish. This article describes the annotation process, the results in terms of inter-encoder agreement, and the sense distributions obtained with two methods: majority voting with a theory-compliant backoff strategy, and MACE, an unsupervised system to choose the most likely sense from all the annotations.The research leading to these results has been funded by the European Commission’s 7th Framework Program under grant agreement 238405 (CLARA)

Annotation of regular polysemy and underspecification

Comunicació presentada a: 51st Annual Meeting of the Association for Computational Linguistics, celebrat a Sofia, Bulgaria, del 4 al 9 d'agost de 2013.We present the result of an annotation task on regular polysemy for a series of semantic classes or dot types in English, Danish and Spanish. This article describes the annotation process, the results in terms of inter-encoder agreement, and the sense distributions obtained with two methods: majority voting with a theory-compliant backoff strategy, and MACE, an unsupervised system to choose the most likely sense from all the annotations.The research leading to these results has been funded by the European Commission’s 7th Framework Program under grant agreement 238405 (CLARA)