Prefix Probabilities from Stochastic Tree Adjoining Grammars

Details Prefix Probabilities from Stochastic Tree Adjoining Grammars Prefix Probabilities from Stochastic Tree Adjoining Grammars

1998-09-18

arxiv.org/abs/cs/9809026v1

In Proceedings of COLING-ACL '98 (Montreal)

Computer Science

Computation and Language

7 pages, 2 Postscript figures, uses colacl.sty, graphicx.sty, psfrag.sty

Scientific paper

Language models for speech recognition typically use a probability model of the form Pr(a_n | a_1, a_2, ..., a_{n-1}). Stochastic grammars, on the other hand, are typically used to assign structure to utterances. A language model of the above form is constructed from such grammars by computing the prefix probability Sum_{w in Sigma*} Pr(a_1 ... a_n w), where w represents all possible terminations of the prefix a_1 ... a_n. The main result in this paper is an algorithm to compute such prefix probabilities given a stochastic Tree Adjoining Grammar (TAG). The algorithm achieves the required computation in O(n^6) time. The probability of subderivations that do not derive any words in the prefix, but contribute structurally to its derivation, are precomputed to achieve termination. This algorithm enables existing corpus-based estimation techniques for stochastic TAGs to be used for language modelling.

Affiliated with

Also associated with

No associations

Rating

Prefix Probabilities from Stochastic Tree Adjoining 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 Prefix Probabilities from Stochastic Tree Adjoining Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Prefix Probabilities from Stochastic Tree Adjoining Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-458224