We ran a number of experiments on the cubepruning dependency parser of <cite>Zhang and McDonald (2012)</cite> , <cite>whose</cite> search space can be represented as a hypergraph in which the nodes are the complete and incomplete states and the hyperedges are the instantiations of the two parsing rules in the Eisner algorithm (Eisner, 1996) .