Two Experiments on Learning Probabilistic Dependency Grammars from Corpora (1992)
| Venue: | Working Notes of the Workshop Statistically-Based NLP Techniques |
| Citations: | 82 - 5 self |
BibTeX
@INPROCEEDINGS{Carroll92twoexperiments,
author = {Glenn Carroll and Glenn Carroll and Eugene Charniak and Eugene Charniak},
title = {Two Experiments on Learning Probabilistic Dependency Grammars from Corpora},
booktitle = {Working Notes of the Workshop Statistically-Based NLP Techniques},
year = {1992},
pages = {1--13},
publisher = {AAAI}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Introduction 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. We will explicate dependency grammars in Section 2. For the moment we simply note that they are a very restricted class of grammars which do not fit exactly into the Chomsky hierarchy, but whose appearance is most like the context-free grammars. We assume that the goal of learning a context-free grammar needs no justification. The problem has attracted a fair amount of attention, ( [1,4] are good surveys. ) but no good solutions have been found. Our choice of learning from only positive training examples needs only a little more justification. Obviously, if it is possible, a scheme which only uses positive training exampl
Citations
| 105 | Basic methods of probabilistic context-free grammars - Jelinek, Lafferty, et al. - 1992 |
| 72 | Parsing a natural language using mutual information statistics - Magerman, Marcus - 1990 |
| 44 | A survey of inductive inference: Theory and methods, Computing Surveys - Angluin, Smith - 1983 |
| 41 | Grammatical inference: introduction and survey - part I - Fu, Booth - 1986 |
| 22 | Grammatical inference by hill climbing - Cook, Rosenfeld, et al. - 1976 |
| 19 | Context free grammar induction using genetic algorithms - Wyard - 1991 |
| 3 | Trainable grammars for speech recognition. Presented at - Baker - 1979 |
| 1 | On the inference of stochastic regular grammars. Presented at Information and Control - Mude, A - 1978 |
