LZ compression of static linked list tries

Strahil Ristov, Damir Boras, Tomislava Lauc


A variant of LZ (Lempel-Ziv) procedure for compressing static trie structures is investigated for different types of natural language data. A compressed trie is produced from the set of 40,000 bilingual dictionary entries and the results are compared to previous results for a set of 750,000 different word forms. A possible use of a sliding window in LZ procedure for linearization of algorithm execution time is investigated. The results show considerable application potential.


natural language processing, dictionary, LZ data compression, trie data structure

Full Text:


Creative Commons License
This work is licensed under a Creative Commons Attribution-NoDerivatives 4.0 International License.

Crossref Similarity Check logo

Crossref logologo_doaj

 Hrvatski arhiv weba logo