{"title":"Comparison of Text Models for BWT","authors":"J. Lánský, K. Chernik, Z. Vlckova","doi":"10.1109/DCC.2007.21","DOIUrl":null,"url":null,"abstract":"Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. This work is to compare the single file parsing methods used on input text files by means of Burrows-Wheeler Transform for different languages (English, Czech, and German). Since present methods based on BWT use different block sizes and moreover, they are oriented to the compression of one element type - what makes harder the mutual comparison, we modified the method to be able to compress using all required elements and to have the block size 5 MB, which is more than size of any test input file.","PeriodicalId":234035,"journal":{"name":"2007 Data Compression Conference (DCC'07)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 Data Compression Conference (DCC'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.2007.21","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12
Abstract
Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. This work is to compare the single file parsing methods used on input text files by means of Burrows-Wheeler Transform for different languages (English, Czech, and German). Since present methods based on BWT use different block sizes and moreover, they are oriented to the compression of one element type - what makes harder the mutual comparison, we modified the method to be able to compress using all required elements and to have the block size 5 MB, which is more than size of any test input file.