Computation of the Probability of the Best Derivation of an Initial Substring from a Stochastic Context-Free Grammar
暂无分享,去创建一个
[1] R. C. Underwood,et al. THE APPLICATION OF STOCHASTIC CONTEXT-FREE GRAMMARS TO FOLDING, ALIGNING AND MODELING HOMOLOGOUS RNA SEQUENCES , 1993 .
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Stanley F. Chen,et al. Bayesian Grammar Induction for Language Modeling , 1995, ACL.
[4] Giorgio Satta,et al. Optimal Probabilistic Evaluation Functions for Search Controlled by Stochastic Context-Free Grammars , 1994, IEEE Trans. Pattern Anal. Mach. Intell..
[5] Andreas Stolcke,et al. Using a stochastic context-free grammar as a language model for speech recognition , 1995, 1995 International Conference on Acoustics, Speech, and Signal Processing.
[6] Steve Young,et al. Applications of stochastic context-free grammars using the Inside-Outside algorithm , 1990 .
[7] Andreas Stolcke,et al. An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities , 1994, CL.
[8] John D. Lafferty,et al. Computation of the Probability of Initial Substring Generation by Stochastic Context-Free Grammars , 1991, Comput. Linguistics.
[9] Hermann Ney,et al. Dynamic programming parsing for context-free grammars in continuous speech recognition , 1991, IEEE Trans. Signal Process..
[10] J. Baker. Trainable grammars for speech recognition , 1979 .
[11] Ronald L. Rivest,et al. The Design and Analysis of Computer Algorithms , 1990 .
[12] Pierre Dupont. Efficient Integration of Context-Free Based Language Models in Continuous Speech Recognition , 1995 .