Word‐based text compression
- 1 February 1989
- journal article
- research article
- Published by Wiley in Software: Practice and Experience
- Vol. 19 (2) , 185-198
Abstract
The development of efficient algorithms to support arithmetic coding has meant that powerful models of text can now be used for data compression. Here the implementation of models based on recognizing and recording words is considered. Move‐to‐the‐front and several variable‐order Markov models have been tested with a number of different data structures, and first the decisions that went into the implementations are discussed and then experimental results are given that show English text being represented in under 2‐2 bits per character. Moreover the programs run at speeds comparable to other compression techniques, and are suited for practical use.Keywords
This publication has 10 references indexed in Scilit:
- Data Compression Using Dynamic Markov ModellingThe Computer Journal, 1987
- Technical correspondenceCommunications of the ACM, 1987
- Arithmetic coding for data compressionCommunications of the ACM, 1987
- A locally adaptive data compression schemeCommunications of the ACM, 1986
- Self-adjusting binary search treesJournal of the ACM, 1985
- Dynamic huffman codingJournal of Algorithms, 1985
- A Technique for High-Performance Data CompressionComputer, 1984
- Data Compression Using Adaptive Coding and Partial String MatchingIEEE Transactions on Communications, 1984
- Compression of individual sequences via variable-rate codingIEEE Transactions on Information Theory, 1978
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975