LZ compression of static linked list tries
A variant of LZ 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...
Permalink: | http://skupni.nsk.hr/Record/ffzg.KOHA-OAI-FFZG:313468/Similar |
---|---|
Matična publikacija: |
Proceedings of the 19th International Conference on Information Technology Interfaces, ITI Zagreb : SRCE, 1997 |
Glavni autori: | Ristov, Strahil (-), Boras, Damir (Author), Lauc, Tomislava |
Vrsta građe: | Članak |
Jezik: | eng |
APA stil citiranja
Ristov, S. (1997). LZ compression of static linked list tries: LZ compression of static linked list tries. Proceedings of the 19th International Conference on Information Technology Interfaces, ITI.
Chicago stil citiranjaRistov, Strahil. "LZ compression of static linked list tries: LZ compression of static linked list tries." 1997.
MLA stil citiranjaRistov, Strahil. "LZ compression of static linked list tries: LZ compression of static linked list tries." 1997.