To find the MAP parse tree argmax a p(a, x) (where p(a, x) is used rank the output of q(a|x)) and to compute the language modeling perplexity (where a ∼ q(a|x)), we collect 100 samples from q(a|x), same as<cite> Dyer et al. (2016)</cite> .