This paper provides an algorithmic framework for learning statistical models involving directed spanning trees, or equivalently non-projective dependency structures. We show how p...
Terry Koo, Amir Globerson, Xavier Carreras, Michae...
Parsing is a computationally intensive task due to the combinatorial explosion seen in chart parsing algorithms that explore possible parse trees. In this paper, we propose a meth...
We examine the Dual Ramsey Theorem and two related combinatorial principles VW(k, l) and OVW(k, l) from the perspectives of reverse mathematics and effective mathematics. We give a...