Note that a subgradient-based method could handle some of those parts efficiently (arcs, consecutive siblings, grandparents, and head bigrams) by composing arc-factored models, head automata, and a sequence labeler.
no lightweight decomposition seems possible for incorporating parts for all siblings, directed paths, and non-projective arcs.