RePair and All Irreducible Grammars are Upper Bounded by High-Order Empirical Entropy.
Carlos OchoaGonzalo NavarroPublished in: IEEE Trans. Inf. Theory (2019)
Keyphrases
- high order
- higher order
- information theoretic
- pairwise
- low order
- mutual information
- machine learning
- information theory
- bayesian logistic regression
- lower order
- natural language
- context free grammars
- zernike moments
- partial differential equations
- fourth order
- grammatical inference
- low rank
- markov random field
- hidden markov models
- computer vision
- context sensitive
- image processing