Combinatorial compression and partitioning of large dictionaries: theory and experiments

Authors:
Aviezri S. Fraenkel;Moshe Mor
Affiliations:
The Weizmann Institute of Science, Rehovot, Israel 76100;The Weizmann Institute of Science, Rehovot, Israel 76100
Venue:
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Year:
1983

Citing 2
Cited 0

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
An Improved Program for Constructing Open Hash Tables

Proceedings of the 7th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

A method for compressing large dictionaries is proposed, based on transforming words into lexicographically ordered strings of distinct letters, together with permutation indexes. Algorithms to generate such strings are described. Results of applying the method to the dictionaries of two databases, in Hebrew and English, are presented in detail. The main message is a method of partitioning the dictionary such that the "information bearing fraction" is stored in fast memory, and the bulk in auxiliary memory.