Instead, we propose to approximate the marginals by sampling K times from the model and computing the marginals using a maximum-likelihood approach on this sample.
in our first-order dependency parsing example we set μ e to be the number of trees in the K-list that contain the edge e. As noted above, the idea of computing an MST over single-edge marginals has been proposed in Kuncoro et al.