ABSTRACT
A grammar of any type ( formal language theory) in which rules are assigned probabilities by a probability density function. Stochastic grammars are applied to the problem of speech recognition, in which hypotheses must be evaluated with reference to confidence values, and to a range of other problems in which information is unsure. ( hidden Markov model, Markov process)
Reference
Wetherell, C. 1980. Probabilistic languages. Computing Surveys 12.
