Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Stochastic Attribute-Value Grammars Steven P. Abney

Summary: Stochastic Attribute-Value Grammars
Steven P. Abney
AT&T Laboratories
Probabilistic analogues of regular and context-free grammars are well-known in compu-
tational linguistics, and currently the subject of intensive research. To date, however, no
satisfactory probabilistic analogue of attribute-value grammars has been proposed: previ-
ous attempts have failed to define an adequate parameter-estimation algorithm.
In the present paper, I define stochastic attribute-value grammars and give an algo-
rithm for computing the maximum-likelihood estimate of their parameters. The estimation
algorithm is adapted from (Della Pietra, Della Pietra, and Lafferty, 1995). To estimate
model parameters, it is necessary to compute the expectations of certain functions under
random fields. In the application discussed by Della Pietra, Della Pietra, and Lafferty
(representing English orthographic constraints), Gibbs sampling can be used to estimate
the needed expectations. The fact that attribute-value grammars generate constrained lan-
guages makes Gibbs sampling inapplicable, but I show that sampling can be done using
the more general Metropolis-Hastings algorithm.
1. Introduction
Stochastic versions of regular grammars and context-free grammars have received a great
deal of attention in computational linguistics for the last several years, and basic tech-
niques of stochastic parsing and parameter estimation have been known for decades.


Source: Abney, Steven P. - School of Information, University of Michigan


Collections: Computer Technologies and Information Sciences