A node labelled i is a descendant of j in B if and only if i → j in T. The projection of a node in a binarization is the set of reflexive-transitive children of that node.
a postprocessing mechanism is needed to determine which of the generated structures are, in fact, valid trees.