Similarly, consideration of dependency arcs allows the compressed dependency tree z to be scored using a rich set of indicator features over dependency labels, part-of-speech tags and even lexical features as in Filippova and Strube (2008).
unlike the bag-of-tokens scenario, these output structures cannot be constructed efficiently due to their interdependence.