Computation of the probability of initial substring generation by stochastic context-free grammars

Computation of the probability of initial substring generation by stochastic context-free grammars (1991)

by Frederick Jelinek , John D. Lafferty

Venue:	Computational Linguistics
Citations:	68 - 0 self

Datum	Value	Source
TITLE	Computation of the probability of initial substring generation by stochastic context-free grammars	INFERENCE
AUTHOR NAME	Frederick Jelinek	SVM HeaderParse 0.2
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
AUTHOR NAME	John D. Lafferty	SVM HeaderParse 0.2
AUTHOR AFFIL	IBM T. J. Watson Research Center	SVM HeaderParse 0.2
ABSTRACT	Speech recognition language models are based on probabilities P(Wk+I = v [ WlW2~..., Wk) that the next word Wk+l will be any particular word v of the vocabulary, given that the word sequence Wl, w2,..., Wk is hypothesized to have been uttered in the past. If probabilistic context-free grammars are to be used as the basis of the language model, it will be necessary to compute the probability that successive application of the grammar rewrite rules (beginning with the sentence start symbol s) produces a word string whose initial substring is an arbitrary sequence wl, w2,..., Wk+l. In this paper we describe a new algorithm that achieves the required computation in at most a constant times k3-steps. 1.	SVM HeaderParse 0.2
YEAR	1991	INFERENCE
VENUE	Computational Linguistics	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	315--323	INFERENCE
VOLUME	17	INFERENCE
CITATIONS	5 found	ParsCit 1.0