Tech Report CS-92-16
Two Experiments on Learning Probabilistic Dependency Grammars from Corpora
Glenn Carroll and Eugene Charniak
We present a scheme for learning probabilistic dependency grammars from positive training examples plus constraints on rules. In particular, we present the results of two experiments. The first, in which the constraints were minimal, was unsuccessful. The second, with significant constraints, was successful within the bounds of the task we had set.