Compression and explanation using hierarchical grammars

dc.contributor.author	Nevill-Manning, Craig G.
dc.contributor.author	Witten, Ian H.
dc.date.accessioned	2008-10-28T22:43:35Z
dc.date.available	2008-10-28T22:43:35Z
dc.date.issued	1996-07
dc.identifier.citation	Nevill-Manning, C. G. & Witten, I. H. (1996). Compression and explanation using hierarchical grammars. (Working paper 96/16). Hamilton, New Zealand: University of Waikato, Department of Computer Science.	en_US
dc.identifier.issn	1170-487X
dc.identifier.uri	https://hdl.handle.net/10289/1169
dc.description.abstract	Data compression is an eminently pragmatic pursuit: by removing redundancy, storage can be utilised more efficiently. Identifying redundancy also serves a less prosaic purpose-it provides cues for detecting structure, and the recognition of structure coincides with one of the goals of artificial intelligence: to make sense of the world by algorithmic means. This paper describes an algorithm that excels at both data compression and structural inference. This algorithm is implemented in a system call SEQUITUR that efficiently deals with sequences containing millions of symbols.	en_US
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.relation.ispartofseries	Computer Science Working Papers
dc.subject	computer science	en_US
dc.subject	Machine learning
dc.title	Compression and explanation using hierarchical grammars	en_US
dc.type	Working Paper	en_US
uow.relation.series	96/16