Constructing Word-Based Text Compression Algorithms (1992)
| Venue: | Proc. IEEE Data Compression Conference |
| Citations: | 25 - 0 self |
BibTeX
@INPROCEEDINGS{Horspool92constructingword-based,
author = {Nigel Horspool and Gordon Cormack},
title = {Constructing Word-Based Text Compression Algorithms},
booktitle = {Proc. IEEE Data Compression Conference},
year = {1992},
pages = {62--81},
publisher = {IEEE Computer Society Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Text compression algorithms are normally defined in terms of a source alphabet S of 8-bit ASCII codes. We consider choosing S to be an alphabet whose symbols are the words of English or, in general, alternate maximal strings of alphanumeric characters and non-alphanumeric characters. The compression algorithm would be able to take advantage of longer-range correlations between words and thus achieve better compression. The large size of S leads to some implementation problems, but these are overcome to construct word-based LZW, word-based Adaptive Huffman, and wordbased Context Modelling compression algorithms. 1
Citations
| 380 | A technique for high-performance data compression - Welch - 1984 |
| 100 | Variations on a theme by Huffman - Gallager - 1978 |
| 16 | Algorithms for Adaptive Huffman Codes - Cormack - 1984 |
| 1 | A General-Purpose Data Compression Technique with Practical Applications - Horspool, Cormack - 1984 |
