|
|
|
|
| LEADER |
01508naa a2200253uu 4500 |
| 008 |
131105s1997 xx eng|d |
| 035 |
|
|
|a (CROSBI)69266
|
| 040 |
|
|
|a HR-ZaFF
|b hrv
|c HR-ZaFF
|e ppiak
|
| 100 |
1 |
|
|a Ristov, Strahil
|
| 245 |
1 |
0 |
|a LZ compression of static linked list tries /
|c Ristov, Strahil ; Boras, Damir ; Lauc, Tomislava .
|
| 246 |
3 |
|
|i Naslov na engleskom:
|a LZ compression of static linked list tries
|
| 300 |
|
|
|a pp. 199-204
|f str.
|
| 363 |
|
|
|a Vol 5
|b No. 3
|i 1997
|
| 520 |
|
|
|a 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. A possible use of a sliding window in LZ procedure for linearization of algorithm execution time is investigated. The results show considerable application potential.
|
| 536 |
|
|
|a Projekt MZOS
|f 130743
|
| 546 |
|
|
|a ENG
|
| 690 |
|
|
|a 5.04
|
| 693 |
|
|
|a data structures for natural languages, dictionaries, compressed trie, LZ compression
|l hrv
|2 crosbi
|
| 693 |
|
|
|a data structures for natural languages, dictionaries, compressed trie, LZ compression
|l eng
|2 crosbi
|
| 700 |
1 |
|
|a Boras, Damir
|4 aut
|
| 700 |
1 |
|
|a Lauc, Tomislava
|4 aut
|
| 773 |
0 |
|
|t Journal of Computing and Information Technology (CIT)
|g Vol 5 (1997), No. 3 ; str. pp. 199-204
|
| 942 |
|
|
|c CLA
|t 1.01
|u 1
|z Znanstveni - clanak
|
| 999 |
|
|
|c 305285
|d 305283
|