The world's fastest Scrabble program
Communications of the ACM
Efficient decoding of prefix codes
Communications of the ACM
Implementing dynamic minimal-prefix tries
Software—Practice & Experience
Order-preserving minimal perfect hash functions and information retrieval
ACM Transactions on Information Systems (TOIS) - Special issue on research and development in information retrieval
Practical minimal perfect hash functions for large databases
Communications of the ACM
An efficient implementation of trie structures
Software—Practice & Experience
Bonsai: a compact representation of trees
Software—Practice & Experience
Applications of finite automata representing large vocabularies
Software—Practice & Experience
Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Improved behaviour of tries by adaptive branching
Information Processing Letters
A method of compressing trie structures
Software—Practice & Experience
Theoretical Computer Science
Algorithms on strings, trees, and sequences: computer science and computational biology
Algorithms on strings, trees, and sequences: computer science and computational biology
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Linear Algorithm for Data Compression via String Matching
Journal of the ACM (JACM)
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Managing gigabytes (2nd ed.): compressing and indexing documents and images
Communications of the ACM
Communications of the ACM
Software—Practice & Experience
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
IP route lookups as string matching
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Searching in Compressed Dictionaries
DCC '02 Proceedings of the Data Compression Conference
Incremental construction of minimal acyclic finite-state automata
Computational Linguistics - Special issue on finite-state methods in NLP
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
| Hi-index | 0.00 |
An efficient algorithm for trie compression has already been described. Here we present its practical value and demonstrate its superiority in terms of space savings to other methods of lexicon compression. Apart from simple lexicons, a compressed trie can, with some additional processing, be used as a component in the compact representation of simple static databases. We present the potential of the algorithm in compressing natural language dictionaries.