Stochastic Attribute-Value Grammars

Details Stochastic Attribute-Value Grammars Stochastic Attribute-Value Grammars

1996-10-23

arxiv.org/abs/cmp-lg/9610003v1

Computer Science

Computation and Language

23 pages, 21 Postscript figures, uses rotate.sty

Scientific paper

Probabilistic analogues of regular and context-free grammars are well-known in computational linguistics, and currently the subject of intensive research. To date, however, no satisfactory probabilistic analogue of attribute-value grammars has been proposed: previous attempts have failed to define a correct parameter-estimation algorithm. In the present paper, I define stochastic attribute-value grammars and give a correct algorithm for estimating 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 languages makes Gibbs sampling inapplicable, but I show how a variant of Gibbs sampling, the Metropolis-Hastings algorithm, can be used instead.

Affiliated with

Also associated with

No associations

Rating

Stochastic Attribute-Value Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Stochastic Attribute-Value Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Stochastic Attribute-Value Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-281928