AbstractWe present a data compression algorithm that uses the factor automation. The method is related to the Ziv and Lempel's algorithm and gives an approximation of the entropy of a text
In recent work, Sadakane and Grossi [SODA 2006] introduced a scheme to represent any sequence S = s(...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
International audienceWe give a space-efficient simple algorithm for computing the Lempel-Ziv factor...
AbstractWe present a data compression algorithm that uses the factor automation. The method is relat...
International audienceWe give a new text compression scheme based on Forbidden Words ("antidictionar...
International audienceWe give a new text-compression scheme based on forbidden words ("antidictionar...
Let T be a text of length n on an alphabet \u3a3 of size \u3c3, and let H0 be the zero-order empiric...
More than 40 different schemes for performing text compression have been proposed in the literature....
International audienceThis paper deals with Finite State Automata used in Natural Language Processin...
We consider several basic problems for texts and show that if the input texts are given by their Lem...
summary:This paper concerns searching substrings in a string using the factor automaton. The factor ...
In this Ph. D. Thesis we investigate several data compression methods on text in natural language. O...
Data Compression may be defined as the science and art of the representation of information in a cri...
Adaptive data compression techniques can be viewed as consisting of a model specified by a database ...
This paper presents a new method of lossless data compression called LZPP, being an advanced modific...
In recent work, Sadakane and Grossi [SODA 2006] introduced a scheme to represent any sequence S = s(...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
International audienceWe give a space-efficient simple algorithm for computing the Lempel-Ziv factor...
AbstractWe present a data compression algorithm that uses the factor automation. The method is relat...
International audienceWe give a new text compression scheme based on Forbidden Words ("antidictionar...
International audienceWe give a new text-compression scheme based on forbidden words ("antidictionar...
Let T be a text of length n on an alphabet \u3a3 of size \u3c3, and let H0 be the zero-order empiric...
More than 40 different schemes for performing text compression have been proposed in the literature....
International audienceThis paper deals with Finite State Automata used in Natural Language Processin...
We consider several basic problems for texts and show that if the input texts are given by their Lem...
summary:This paper concerns searching substrings in a string using the factor automaton. The factor ...
In this Ph. D. Thesis we investigate several data compression methods on text in natural language. O...
Data Compression may be defined as the science and art of the representation of information in a cri...
Adaptive data compression techniques can be viewed as consisting of a model specified by a database ...
This paper presents a new method of lossless data compression called LZPP, being an advanced modific...
In recent work, Sadakane and Grossi [SODA 2006] introduced a scheme to represent any sequence S = s(...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
International audienceWe give a space-efficient simple algorithm for computing the Lempel-Ziv factor...
DOI
Add to ORKG