modification of classic LZW. The modification is similar to the approach used in the Hu_Word
[3] compression algorithm. Due to special using WLZW in text databases, some its features
seem to be preferable in comparing to similar previous approaches [1, 2]. The algorithm is
two-phase, it uses only one table for words and non-words (so called tokens), and a single
data structure for lexicon is usable as text index. The length of words and non-words is …