The key observation is that our supertagging, labelling and dependency features can each be associated with exactly one word (using the functor for the dependency features).
we can equivalently view the complete parse as a series of extended lexical entries: y = y 0 ...y N .