Premium
LZ trie and dictionary compression
Author(s) -
Ristov Strahil
Publication year - 2005
Publication title -
software: practice and experience
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.437
H-Index - 70
eISSN - 1097-024X
pISSN - 0038-0644
DOI - 10.1002/spe.643
Subject(s) - trie , computer science , lexicon , compression (physics) , simple (philosophy) , data compression , representation (politics) , space (punctuation) , algorithm , natural language processing , programming language , data structure , philosophy , materials science , epistemology , politics , political science , law , composite material , operating system
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. Copyright © 2005 John Wiley & Sons, Ltd.