Annotation of regular polysemy and underspecification

Héctor Martínez Alonso; Bolette Sandford Pedersen; Núria Bel

Annotation of regular polysemy and underspecification

Héctor Martínez Alonso, Bolette Sandford Pedersen, Núria Bel

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

8 Citations (Scopus)

Abstract

We present the result of an annotation task on regular polysemy for a series of seman- tic classes or dot types in English, Dan- ish 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 unsuper- vised system to choose the most likely sense from all the annotations.

Original language	English
Title of host publication	Proceedings from the 51st annual meeting in Association for Computational Linguistics
Place of Publication	Sofia (Bulgaria)
Publisher	Association for Computational Linguistics
Publication date	2013
Pages	725-730
ISBN (Electronic)	978 1627489775
Publication status	Published - 2013

Cite this

Annotation of regular polysemy and underspecification. / Martínez Alonso, Héctor; Pedersen, Bolette Sandford; Bel, Núria.

Proceedings from the 51st annual meeting in Association for Computational Linguistics. Sofia (Bulgaria) : Association for Computational Linguistics, 2013. p. 725-730.

Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

@inproceedings{b924962d3bdd49ce896ec3c8c9d0944a,

title = "Annotation of regular polysemy and underspecification",

abstract = "We present the result of an annotation task on regular polysemy for a series of seman- tic classes or dot types in English, Dan- ish 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 unsuper- vised system to choose the most likely sense from all the annotations.",

author = "{Mart{\'i}nez Alonso}, H{\'e}ctor and Pedersen, {Bolette Sandford} and N{\'u}ria Bel",

year = "2013",

language = "English",

pages = "725--730",

booktitle = "Proceedings from the 51st annual meeting in Association for Computational Linguistics",

publisher = "Association for Computational Linguistics",

}

TY - GEN

T1 - Annotation of regular polysemy and underspecification

AU - Martínez Alonso, Héctor

AU - Pedersen, Bolette Sandford

AU - Bel, Núria

PY - 2013

Y1 - 2013

N2 - We present the result of an annotation task on regular polysemy for a series of seman- tic classes or dot types in English, Dan- ish 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 unsuper- vised system to choose the most likely sense from all the annotations.

AB - We present the result of an annotation task on regular polysemy for a series of seman- tic classes or dot types in English, Dan- ish 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 unsuper- vised system to choose the most likely sense from all the annotations.

M3 - Article in proceedings

SP - 725

EP - 730

BT - Proceedings from the 51st annual meeting in Association for Computational Linguistics

PB - Association for Computational Linguistics

CY - Sofia (Bulgaria)

ER -