Affiliation:
1. The Weizmann Institute of Science, Rehovot, Israel 76100
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.
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Management Information Systems
Reference13 articles.
1. {EVE} S. Even Algorithmic Combinatorics MacMillan New York N.Y. 1973. {EVE} S. Even Algorithmic Combinatorics MacMillan New York N.Y. 1973.
2. A classification of compression methods and their usefulness for a large data processing center
3. {KNU} D. E. Knuth The Art of Computer Programming Vol. 3 - Sorting and Searching Addison-Wesley Reading MA 1973. {KNU} D. E. Knuth The Art of Computer Programming Vol. 3 - Sorting and Searching Addison-Wesley Reading MA 1973.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献