Graph features are defined over the factors of a graph-based dependency parser, which was shown to improve the accuracy of a transition-based parser by Zhang and Clark (2008).
while their features were limited to certain first-and second-order factors, we use features over second-and third-order factors as found in the parsers of Bohnet and Kuhn (2012).