Efficient online scalar annotation with bounded support

32Citations
Citations of this article
105Readers
Mendeley users who have this article in their library.

Abstract

We describe a novel method for efficiently eliciting scalar annotations for dataset construction and system quality estimation by human judgments. We contrast direct assessment (annotators assign scores to items directly), online pairwise ranking aggregation (scores derive from annotator comparison of items), and a hybrid approach (EASL: Efficient Annotation of Scalar Labels) proposed here. Our proposal leads to increased correlation with ground truth, at far greater annotator efficiency, suggesting this strategy as an improved mechanism for dataset creation and manual system evaluation.

Cite

CITATION STYLE

APA

Sakaguchi, K., & Van Durme, B. (2018). Efficient online scalar annotation with bounded support. In ACL 2018 - 56th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference (Long Papers) (Vol. 1, pp. 208–218). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/p18-1020

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free