Contractions: breaking the tokenization-tagging circularity

Authors:
António Horta Branco;João Ricardo Silva
Affiliations:
University of Lisbon, Dept. of Informatics;University of Lisbon, Dept. of Informatics
Venue:
PROPOR'03 Proceedings of the 6th international conference on Computational processing of the Portuguese language
Year:
2003

Citing 2
Cited 2

Periods, capitalized words, etc.

Computational Linguistics
Building a large annotated corpus of English: the penn treebank

Computational Linguistics - Special issue on using large corpora: II

A suite of shallow processing tools for Portuguese: LX-suite

EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
A large portuguese corpus on-line: cleaning and preprocessing

PROPOR'12 Proceedings of the 10th international conference on Computational Processing of the Portuguese Language

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ambiguous strings are strings of non-whitespace characters, typically coinciding with orthographic contractions of word forms, that depending on the specific occurrence, are to be considered as consisting of one or more than one token. This sort of strings is shown to raise the problem of undesired circularity between tokenization and tagging. This paper presents a strategy to resolve ambiguous strings and dissolve such circularity.