hrcak mascot   Srce   HID

Izvorni znanstveni članak

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

Puni tekst: engleski, pdf (3 MB) str. 199-204 preuzimanja: 77* citiraj
APA 6th Edition
Ristov, S., Boras, D. i Lauc, T. (1997). LZ compression of static linked list tries. Journal of computing and information technology, 5 (3), 199-204. Preuzeto s https://hrcak.srce.hr/150261
MLA 8th Edition
Ristov, Strahil, et al. "LZ compression of static linked list tries." Journal of computing and information technology, vol. 5, br. 3, 1997, str. 199-204. https://hrcak.srce.hr/150261. Citirano 20.02.2020.
Chicago 17th Edition
Ristov, Strahil, Damir Boras i Tomislava Lauc. "LZ compression of static linked list tries." Journal of computing and information technology 5, br. 3 (1997): 199-204. https://hrcak.srce.hr/150261
Harvard
Ristov, S., Boras, D., i Lauc, T. (1997). 'LZ compression of static linked list tries', Journal of computing and information technology, 5(3), str. 199-204. Preuzeto s: https://hrcak.srce.hr/150261 (Datum pristupa: 20.02.2020.)
Vancouver
Ristov S, Boras D, Lauc T. LZ compression of static linked list tries. Journal of computing and information technology [Internet]. 1997 [pristupljeno 20.02.2020.];5(3):199-204. Dostupno na: https://hrcak.srce.hr/150261
IEEE
S. Ristov, D. Boras i T. Lauc, "LZ compression of static linked list tries", Journal of computing and information technology, vol.5, br. 3, str. 199-204, 1997. [Online]. Dostupno na: https://hrcak.srce.hr/150261. [Citirano: 20.02.2020.]

Sažetak
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.

Ključne riječi
natural language processing; dictionary; LZ data compression; trie data structure

Hrčak ID: 150261

URI
https://hrcak.srce.hr/150261

Posjeta: 115 *