Tag insertion complexity
Loading...
Permanent Link
Publisher link
Rights
Copyright © IEEE 2001. This article has been published in Proceedings of the Data Compression Conference, March 2001, Snowbird, Utah.
Abstract
This paper is about inferring markup information, a generalization of part-of-speech-tagging. We use compression models based on a marked-up training corpus and apply them to fresh, unmarked, text. In effect, this technique builds filters that extract information from text in a way that is generalized because it depends on training text rather than preprogrammed heuristics.
Citation
Yeates, S., Witten, I.H. & Bainbridge, D. (2001). Tag insertion complexity. In J. A. Stored(Ed.), Proceedings of the Data Compression Conference, March 2001, Snowbird, Utah (pp. 243-252). Washington DC, USA: IEEE Press.
Series name
Date
Publisher
IEEE Computer Society