Porovnání metod pro kompresi velké abecedy
Text compression over alphabet of words or syllables brings up a new concern to deal with - the alphabet needs to be transferred between coder and decoder along with the message. Especially with small or middle-sized documents the code of the alphabet forms a signi cant part of the resulting le. The...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Dissertation |
| Language: | Czech |
| Published: |
2010
|
| Online Access: | http://www.nusl.cz/ntk/nusl-298428 |
| Summary: | Text compression over alphabet of words or syllables brings up a new concern to deal with - the alphabet needs to be transferred between coder and decoder along with the message. Especially with small or middle-sized documents the code of the alphabet forms a signi cant part of the resulting le. Therefore it is desirable to represent the alphabet as dense as possible. The topic of this thesis is a comparison of three approaches to large alphabet compression - static, semiadaptive and adaptive approach. Moreover the potential of static initialization of adaptive methods with frequent words is analyzed. Furthermore a new and highly eff ective method for compression of a set of strings is introduced. |
|---|