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 formall
The compression of texts written in natural language can exploit information about its linguistic ch...
Abstract. We present a technique to build an index based on sux arrays for compressed texts. We also...
In this paper, we present a text compression technique which utilises morpheme-based text compressio...
Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternativ...
[Abstract] Text databases are growing in the last years due to the widespread use of digital librar...
Semistatic word-based byte-oriented compressors are known to be attractive alternatives to compress ...
AbstractIn this paper we present the adaptation of a compression technique, specially designed to co...
AbstractNatural language compression has made great progress in the last two decades. The main step ...
An algorithm for very efficient compression of a set of natural language text files is presented. No...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
An algorithm for very efficient compression of a set of natural language text files is presented. No...
Tyt. z nagłówka.Bibliografia s. 778-779.Dostępny również w formie drukowanej.STRESZCZENIE: Gęste kod...
In this Ph. D. Thesis we investigate several data compression methods on text in natural language. O...
We address the problem of adaptive compression of natural language text, focusing on the case where ...
A description and comparison is presented of four compression techniques for word coding having appl...
The compression of texts written in natural language can exploit information about its linguistic ch...
Abstract. We present a technique to build an index based on sux arrays for compressed texts. We also...
In this paper, we present a text compression technique which utilises morpheme-based text compressio...
Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternativ...
[Abstract] Text databases are growing in the last years due to the widespread use of digital librar...
Semistatic word-based byte-oriented compressors are known to be attractive alternatives to compress ...
AbstractIn this paper we present the adaptation of a compression technique, specially designed to co...
AbstractNatural language compression has made great progress in the last two decades. The main step ...
An algorithm for very efficient compression of a set of natural language text files is presented. No...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
An algorithm for very efficient compression of a set of natural language text files is presented. No...
Tyt. z nagłówka.Bibliografia s. 778-779.Dostępny również w formie drukowanej.STRESZCZENIE: Gęste kod...
In this Ph. D. Thesis we investigate several data compression methods on text in natural language. O...
We address the problem of adaptive compression of natural language text, focusing on the case where ...
A description and comparison is presented of four compression techniques for word coding having appl...
The compression of texts written in natural language can exploit information about its linguistic ch...
Abstract. We present a technique to build an index based on sux arrays for compressed texts. We also...
In this paper, we present a text compression technique which utilises morpheme-based text compressio...