tion A of Malt + MST 2O (see Table 4), the difference being statistically insignificant (p > 0.05).
we appeal to the Matrix Tree Theorem for multi-digraphs to design polynomial-time algorithms for calculating both the partition function and edge expectations over all possible dependency graphs for a given sentence.