Grammatical Trigrams: A Probabilistic Model of Link Grammar (1992)
| Venue: | In Proceedings of the AAAI Fall Symposium on Probabilistic Approaches to Natural Language |
| Citations: | 79 - 3 self |
BibTeX
@INPROCEEDINGS{Lafferty92grammaticaltrigrams:,
author = {John Lafferty and Daniel Sleator and Davy Temperley},
title = {Grammatical Trigrams: A Probabilistic Model of Link Grammar},
booktitle = {In Proceedings of the AAAI Fall Symposium on Probabilistic Approaches to Natural Language},
year = {1992},
pages = {89--97}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present a new class of language models. This class derives from link grammar, a context-free formalism for the description of natural language. We describe an algorithm for determining maximum-likelihood estimates of the parameters of these models. The language models which we present differ from previous models based on stochastic context-free grammars in that they are highly lexical. In particular, they include the familiar n-gram models as a natural subclass. The motivation for considering this class is to estimate the contribution which grammar can make to reducing the relative entropy of natural language. To appear in Proc. of the 1992 AAAI Fall Symp. on Probabilistic Approaches to Natural Language. y IBM Thomas J. Watson Research Center, P.O. Box 704, Yorktown Heights, NY 10598, jlaff@watson.ibm.com. z School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, sleator@cs.cmu.edu. x Music Department, Columbia University, New York, NY 10027...
Citations
No citations identified.
