We consider tagging schemes that maintain various aspects of the structural information encoded in the tree.
we start from two tagging schemes that even if fully predicted still leave ambiguity about the actual parse tree: the number of direct dependants each word has and the distance of each word from the root of the tree.