Hierarchical A (HA) uses of a hierarchy of coarse grammars to speed up parsing without sacrificing optimality. HA prioritizes search in refined grammars using Viterbi outside cost...
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
Inducing a grammar directly from text is one of the oldest and most challenging tasks in Computational Linguistics. Significant progress has been made for inducing dependency gram...