S,C)-Dense Coding: An optimized compression code for natural language text databases (2003)
| Venue: | In Proc. 10th Intl. Symp. on String Processing and Information Retrieval (SPIRE’03), LNCS 2857 |
| Citations: | 17 - 11 self |
BibTeX
@INPROCEEDINGS{Brisaboa03s,c)-densecoding:,
author = {Nieves R. Brisaboa and Antonio Fariña and Gonzalo Navarro and María F. Esteller},
title = {S,C)-Dense Coding: An optimized compression code for natural language text databases},
booktitle = {In Proc. 10th Intl. Symp. on String Processing and Information Retrieval (SPIRE’03), LNCS 2857},
year = {2003},
pages = {122--136},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This work presents (s, c)-Dense Code, a new method for compressing natural language texts. This technique is a generalization of a previous compression technique called End-Tagged Dense Code that obtains better compression ratio as well as a simpler and faster encoding than Tagged Huffman. At the same time, (s, c)-Dense Code is a prefix code that maintains the most interesting features of Tagged Huffman Code with respect to direct search on the compressed text. (s, c)-Dense Coding retains all the efficiency and simplicity of Tagged Huffman, and improves its compression ratios. We formally describe the (s, c)-Dense Code and show how to compute the parameters s and c that optimize the compression for a specific corpus. Our empirical results show that (s, c)-Dense Code improves End-Tagged Dense Code and Tagged Huffman Code, and reaches only 0.5 % overhead over plain Huffman Code. 1
