Computation of the Probability of the Best Derivation of an Initial Substring from a Stochastic Context-Free Grammar

Abstract

Recently, Stochastic Context-Free Grammars have been considered important for use in Language Modeling for Automatic Speech Recognition tasks [6, 10]. In [6], Jelinek and Lafferty presented and solved the problem of computation of the probability of initial substring generation by using Stochastic Context-Free Grammars. This paper seeks to apply a Viterbi… (More)

Topics

Cite this paper

@inproceedings{Snchez1997ComputationOT, title={Computation of the Probability of the Best Derivation of an Initial Substring from a Stochastic Context-Free Grammar}, author={Joan-Andreu S{\'a}nchez and Jos{\'e}-Miguel Bened{\'i}}, year={1997} }