Skip to the main content

Journal of computing and information technology, Vol. 5 No. 3, 1997.

Original scientific paper

LZ compression of static linked list tries

Strahil Ristov ; Ruđer Bošković Institute, Zagreb, Croatia
Damir Boras ; Faculty of Philosophy, University of Zagreb, Croatia
Tomislava Lauc ; Faculty of Philosophy, University of Zagreb, Croatia

Full text: english pdf 2.921 Kb

page 199-204

downloads: 188

cite

Abstract

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.

Keywords

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

Hrčak ID:

150261

URI

https://hrcak.srce.hr/150261

Publication date:

30.9.1997.

Visits: 482 *