A Comparison of Empirical Tree Entropies

06/01/2020
by   Danny Hucke, et al.
0

Whereas for strings, higher-order empirical entropy is the standard entropy measure, several different notions of empirical entropy for trees have been proposed in the past, notably label entropy, degree entropy, conditional versions of the latter two, and empirical entropy of trees (here, called label-shape entropy). In this paper, we carry out a systematic comparison of these entropy measures. We underpin our theoretical investigations by experimental results with real XML data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/10/2019

Entropy Bounds for Grammar-Based Tree Compressors

The definition of k^th-order empirical entropy of strings is extended to...
research
09/10/2017

A Product Shape Congruity Measure via Entropy in Shape Scale Space

Product shape is one of the factors that trigger preference decisions of...
research
07/23/2021

Entropy, Derivation Operators and Huffman Trees

We build a theory of binary trees on finite multisets that categorifies,...
research
11/23/2011

Falsification and future performance

We information-theoretically reformulate two measures of capacity from s...
research
03/08/2016

A non-extensive entropy feature and its application to texture classification

This paper proposes a new probabilistic non-extensive entropy feature fo...
research
03/13/2013

An Entropy-based Learning Algorithm of Bayesian Conditional Trees

This article offers a modification of Chow and Liu's learning algorithm ...
research
02/19/2017

Harmonic Grammar, Optimality Theory, and Syntax Learnability: An Empirical Exploration of Czech Word Order

This work presents a systematic theoretical and empirical comparison of ...

Please sign up or login with your details

Forgot password? Click here to reset