The binarized decomposition forest compactly encodes the hierarchical structure among phrases and non-phrases.
the coarse abstraction of phrases with X and non-phrases with B provides little information on the constraints of the hierarchy.