Tag insertion complexity

Yeates, Stuart Andrew; Witten, Ian H.; Bainbridge, David

doi:10.1109/DDC.2001.917155

Files

tag insertion complexity.pdf

383.3Kb

DOI

10.1109/DDC.2001.917155

Citation

Export 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.

Permanent Research Commons link: https://hdl.handle.net/10289/1324

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.

Date

2001

Type

Conference Contribution

Publisher

IEEE Computer Society

Rights

Collections

Computing and Mathematical Sciences Papers [1455]