Following Das and Petrov (2011) and Subramanya et al.
all the graph-based models are better than the supervised baseline; for our objectives using pairwise Gaussian fields with sparse unary penalties, the accuracies are equal or better with respect to NGF-2 ; however, the lexicon sizes are reduced by a few hundred to a few thousand entries.