DocumentCode
3255361
Title
Compression of dictionaries via extensions to front coding
Author
Bshouty, Nader H. ; Falk, Geoffrey T.
Author_Institution
Calgary Univ., Alta., Canada
fYear
1992
fDate
28-30 May 1992
Firstpage
361
Lastpage
364
Abstract
Front-coding is a technique used to reduce the redundancy in a representation of a dictionary, taking advantage of common prefixes. However, redundancy still exists in the front-coded representation; suffixes and infixes of words are not coded. The authors method attempts to remedy this deficiency by iteratively applying front-coding techniques to the suffixes. By applying a variant Huffman coding method, it is possible to represent the Huffman tree of suffixes in the form of another dictionary, to which the method can be iteratively applied. On large natural-language dictionaries the authors have achieved compression ratios as favourable as 11%
Keywords
codes; data compression; data structures; encoding; Huffman tree of suffixes; common prefixes; dictionaries compression; front coding; front-coded representation; natural-language dictionaries; redundancy; suffixes; variant Huffman coding method; Arithmetic; Computer science; Dictionaries; Frequency; Huffman coding; Mathematics; Statistics; Writing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computing and Information, 1992. Proceedings. ICCI '92., Fourth International Conference on
Conference_Location
Toronto, Ont.
Print_ISBN
0-8186-2812-X
Type
conf
DOI
10.1109/ICCI.1992.227636
Filename
227636
Link To Document