An experiment on the upper bound of interjudge agreement: the case of tagging

Authors:
Atro Voutilainen
Affiliations:
University of Helsinki, Finland
Venue:
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
Year:
1999

Citing 3
Cited 2

Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text

Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II
Specifying a shallow grammatical representation for parsing purposes

EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics

Definitional, personal, and mechanical constraints on part of speech annotation performance

Natural Language Engineering
Methods for Amharic part-of-speech tagging

AfLaT '09 Proceedings of the First Workshop on Language Technologies for African Languages

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the controversial issue about the upper bound of interjudge agreement in the use of a low-level grammatical representation. Pessimistic views suggest that several percent of words in running text are undecidable in terms of part-of-speech categories. Our experiments with 55kW data give reason for optimism: linguists with only 30 hours' training apply the EngCG-2 morphological tags with almost 100% interjudge agreement.