Abstract
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transform and then Huffman coding is used to the permutated string.
The original method from 1994 was designed for an alphabet compression. In 2001, versions working with word and n-grams alphabet were presented.
The newest version copes with the syllable alphabet. The goal of this article is to compare the BWT compression working with alphabet of letters, syllables, words, 3-grams and 5-grams.