When combined with a discriminative online learning algorithm and a rich feature set, these models provide state-of-the-art performance across multiple languages.
in this paper we extend the MST parsing framework to incorporate higher-order feature representations of bounded-size connected subgraphs.