Entropy Bounds for Grammar-Based Tree Compressors.
Danny HuckeMarkus LohreyLouisa Seelbach BenknerPublished in: CoRR (2019)
Keyphrases
- information theory
- tree structure
- mutual information
- upper bound
- upper and lower bounds
- worst case
- index structure
- lower bound
- hierarchical structure
- information entropy
- b tree
- data compression
- speech understanding
- tight bounds
- binary tree
- average case
- error bounds
- lower and upper bounds
- database
- information theoretic
- relational databases
- neural network