Accession Number : ADA256365


Title :   Grammatical Trigrams: A Probabilistic Model of Link Grammar


Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA SCHOOL OF COMPUTER SCIENCE


Personal Author(s) : Lafferty, John ; Sleator, Saniel ; Temperley, Davy


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a256365.pdf


Report Date : Sep 1992


Pagination or Media Count : 12


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.


Descriptors :   *ALGORITHMS , *CONTEXT FREE GRAMMARS , MODELS , PARAMETERS , ESTIMATES , AXES , LANGUAGE , MOTIVATION , PAPER , NATURAL LANGUAGE , ENTROPY , GRAMMARS


Subject Categories : Computer Programming and Software


Distribution Statement : APPROVED FOR PUBLIC RELEASE