Show simple item record  

dc.contributor.authorYeates, Stuart Andrew
dc.contributor.authorWitten, Ian H.
dc.contributor.authorBainbridge, David
dc.coverage.spatialConference held at Snowbird, Utahen_NZ
dc.date.accessioned2008-11-13T22:23:47Z
dc.date.available2008-11-13T22:23:47Z
dc.date.issued2001
dc.identifier.citationYeates, 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.en_US
dc.identifier.urihttps://hdl.handle.net/10289/1324
dc.description.abstractThis 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.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherIEEE Computer Societyen_US
dc.rightsCopyright © IEEE 2001. This article has been published in Proceedings of the Data Compression Conference, March 2001, Snowbird, Utah.en_US
dc.sourceData Compression Conference (DCC 2001)en_NZ
dc.subjectcomputer scienceen_US
dc.subjectMachine learning
dc.titleTag insertion complexityen_US
dc.typeConference Contributionen_US
dc.identifier.doi10.1109/DDC.2001.917155en_US
dc.relation.isPartOfDCC 2001: Data Compression Conferenceen_NZ
pubs.begin-page243en_NZ
pubs.elements-id26567
pubs.end-page252en_NZ
pubs.finish-date2001en_NZ
pubs.start-date2001en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record