Parsing for deep dependency representations can be viewed as the search for Maximum Subgraphs for a certain graph class G (Kuhlmann and Jonsson, 2015), a generalization of the MST perspective for tree parsing.
we have the following optimization problem: Given an arc-weighted graph The choice of G determines the computational complexity of dependency parsing.