The solid lines in Figure 2 show our improvements on the dev data, with a simpler scatterplot given by in Figure 7 in the supplementary material.
we design a dynamic programming algorithm which, for any given distribution p in wang and Eisner's family, can compute the expected counts of all POS bigrams in the permuted source treebank.