Goal of this work was to design and test methods for creating and parsing input data from file or stream in a way they are optimalized for following compression algorithms. We used two runs through data, first run collected analytical data and second run was for parsing. First part of this document is focused on methods TD2 and TD3 [4] for trie compression and their extension for unicode alphabets. In second part there are presented methods for creating dictionary without considering partitiong on words or syllabels. All methods are considered over unicode alphabet and implemetned as part of modular program XBW
Dictionary code compression is a technique where long instructions in the memory are replaced with s...
Dictionary-based compression schemes are the most commonly used data compression schemes since they ...
Linear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compressi...
Dictionary-based compression algorithms include a parsing strategy to transform the input text into ...
This thesis deals with improving the existing dictionary compression method TD3. This method is base...
Classic textual compression methods work over the alphabet of characters or alphabet of words. For l...
This thesis is an exploration of hybrid dictionary/statistical algorithms for compressing textual in...
We introduce pseudo-prefix dictionaries, which allow an approximation scheme for optimal compression...
This work concerns the search for text compressors that compress better than existing dictionary cod...
Burrows-Wheeler transform is one of the most favorite lossless data compression algorithm. Second ph...
The aim of this thesis is to analyse dictionary methods of data compression and their characteristic...
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alph...
AbstractA lossless dictionary-based data compression technique has been proposed in this paper which...
Abstract. Linear time optimal parsing algorithms are very rare in the dictionary based branch of the...
Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternativ...
Dictionary code compression is a technique where long instructions in the memory are replaced with s...
Dictionary-based compression schemes are the most commonly used data compression schemes since they ...
Linear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compressi...
Dictionary-based compression algorithms include a parsing strategy to transform the input text into ...
This thesis deals with improving the existing dictionary compression method TD3. This method is base...
Classic textual compression methods work over the alphabet of characters or alphabet of words. For l...
This thesis is an exploration of hybrid dictionary/statistical algorithms for compressing textual in...
We introduce pseudo-prefix dictionaries, which allow an approximation scheme for optimal compression...
This work concerns the search for text compressors that compress better than existing dictionary cod...
Burrows-Wheeler transform is one of the most favorite lossless data compression algorithm. Second ph...
The aim of this thesis is to analyse dictionary methods of data compression and their characteristic...
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alph...
AbstractA lossless dictionary-based data compression technique has been proposed in this paper which...
Abstract. Linear time optimal parsing algorithms are very rare in the dictionary based branch of the...
Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternativ...
Dictionary code compression is a technique where long instructions in the memory are replaced with s...
Dictionary-based compression schemes are the most commonly used data compression schemes since they ...
Linear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compressi...