There are 991 unique features in total in our experiments.
in our case, we sample one hidden specification tree t i while holding all other trees t −i fixed: where directly solving the subproblem (1) in our case is still hard, we therefore use a Metropolis-Hastings sampler that is similarly applied in traditional sentence parsing problems.