| 摘要 |
The present invention relates to a method for forming a maximal tree for compressing information comprising symbols, in which said maximal tree is generated by searching statistical data of different symbols from a training data. In the method a table is formed, in which each row consists of a string having a first end and a second end, and a symbol of the training data in said first end, the rest of the string consisting of a minimal number of preceding symbols in the training data to make the so-defined context unique for said symbol. The contexts are sorted in lexical order with priority on the first end. The invention also relates to a device comprising means for forming a maximal tree for compressing information comprising symbols, in which said maximal tree is generated by searching statistical data of different symbols from a training data. The device comprises means for forming a table, in which each row consists of a string having a first end and a second end, and a symbol of the training data in said first end, the rest of the string consisting of a minimal number of preceding symbols in the training data to make the so-defined context unique for said symbol. The device further comprises means for sorting the contexts in lexical order with priority on the first end.
|
