Classic textual compression methods work over the alphabet of characters or alphabet of words. For languages with rich morphology as well as for compression of smaller files it can be advantageous to use an alphabet of syllables. For some compression methods like the ones based on Burrows-Wheeler transformation the syllable is a reasonable solution also for large files - even for languages having quite simple morphology. Although the main goal of our research is the compression over the alphabet of syllables, all implemented methods can compress also over the alphabet of words. For small files we use the LZW method and Huffman coding. These methods were improved by the use of initialized dictionary containing characteristic syllables specif...
Goal of this work was to design and test methods for creating and parsing input data from file or st...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
Provided that an easy mechanism exists for it, it is possible to de-compose a text into strings that...
Classic textual compression methods work over the alphabet of characters or alphabet of words. For l...
There are two basic types of text compression by symbols -- in the first case symbols are represente...
A syllablebased compression is a new method of a text compression, offering interesting tradeoff bet...
Syllable-based compression achieves sufficient results on small or middle-sized text documents. Sinc...
In this paper, we present a new lossless text compression technique which utilizes syllable-based mo...
Burrows-Wheeler transform is one of the most favorite lossless data compression algorithm. Second ph...
Syllable based compression is a new approach to text compression. An important aspect of this approa...
Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that ...
Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that ...
Abstract. The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string...
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alph...
In this paper, we present a text compression technique which utilises morpheme-based text compressio...
Goal of this work was to design and test methods for creating and parsing input data from file or st...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
Provided that an easy mechanism exists for it, it is possible to de-compose a text into strings that...
Classic textual compression methods work over the alphabet of characters or alphabet of words. For l...
There are two basic types of text compression by symbols -- in the first case symbols are represente...
A syllablebased compression is a new method of a text compression, offering interesting tradeoff bet...
Syllable-based compression achieves sufficient results on small or middle-sized text documents. Sinc...
In this paper, we present a new lossless text compression technique which utilizes syllable-based mo...
Burrows-Wheeler transform is one of the most favorite lossless data compression algorithm. Second ph...
Syllable based compression is a new approach to text compression. An important aspect of this approa...
Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that ...
Provided that an easy mechanism exists for it, it is possible to decompose a text into strings that ...
Abstract. The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string...
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alph...
In this paper, we present a text compression technique which utilises morpheme-based text compressio...
Goal of this work was to design and test methods for creating and parsing input data from file or st...
Semistatic word-based byte-oriented compression codes are known to be attractive alternatives to com...
Provided that an easy mechanism exists for it, it is possible to de-compose a text into strings that...