Comparison between the inside-outside algorithm and the viterbi algorithm for stochastic context-free grammars

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1121, Issue , 1996, Pages 50-59

  Sánchez, Joan Andreu ^a   Benedí, José Miguel ^a   Casacuberta, Francisco ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONTEXT FREE GRAMMARS; MAXIMUM LIKELIHOOD; MAXIMUM LIKELIHOOD ESTIMATION; PATTERN RECOGNITION; STOCHASTIC SYSTEMS;

MAXIMUM LIKELIHOOD APPROACHES; NON-TERMINAL SYMBOLS; STOCHASTIC CONTEXT FREE GRAMMAR; THEORETICAL BOUNDS;

VITERBI ALGORITHM;

EID: 84958530602     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61577-6_6     Document Type: Conference Paper

References (19)

1. J.K. Baker. Trainable grammars for speech recognition. In Klatt and Wolf, editors, Speech Communications for the 97th Meeting of the Acoustical Society of America, pages 31-35. Acoustical Society of America, June 1979.
2. J.M. Benedf and J.A. Ss Corrective training for the estimation of stochastic context-free grammars. In A. Calvo and R. Medina, editors, Proc. VI Spanish Symposium on Pattern Recognition and Image Analysis, pages 442-450. AERFAI, Abril 1995.
3. T.L. Booth and R.A. Thompson. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5):442-450, May 1973.
4. F. Casacuberta. Grow transformations for probabilistic functions of stochastic grammars. IJPRAI, 10(3), 1996.
5. P. Dupont. Efficient integration of context-free grammars based language models in continuous speech recognition. In New Advances and Trends in Speech Recognition and Coding, pages 179-182. NATO ASI, 1993.
6. J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.
7. E. Horowitz and S. Sahni. Fundamentals of Data Structures in Pascal. Computer Science Press, third edition, 1990.
8. F. Jelinek and J.D. Lafferty. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17(3):315-323, 1991.
9. J. Kupiec. Hidden Markov estimation for unrestricted stochastic context-free grammars. Proc. of 1CASSP'92 Vol. 1, pages 177-180. 1992.
10. K. Lari and S.J. Young. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, 4:35-56, 1990.
11. K. Lari and S. J. Young. Applications of stochatic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, (5):237-257, 1991
12. N. Merhav and Y. Ephraim. Hidden markov modeling using a dominant state sequence with application to speech recognition. Computer Speech and Language, 5:327 339, 1991.
13. N~ Merhav and Y. Ephraim Maximum likelihood hidden markov modeling using a dominant sequence of states. IEEE. Transactions on Signal Processing, 39(9):2111-2115, 1991.
14. H. Ney. Stochastic grammars and pattern recognition. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding. Recent Advances, pages 319-344. Springer- Verlag, 1992.
15. S. Sahni. Concepts in Discrete Mathematics. Camelot Pub. Co., 1985.
16. Y. Sakakibara. Learning context-free grammars from structural data in polynonfial time. Theoretical Computer Science 76:223-242, 1990.
17. Y. Sakakibara, M. Brown, R. Hughey, I.S. Mian, K. Sj61ander, R.C. Underwood, and D. Haussle. The application of stochastic context-free grammars to folding, aligning and modeling homologous rna. Computer and Information Science UCSCCRL- 94-14, Univ. of California~ Santa Cruz, Ca., 1993.
18. A. Stolcke. Bayesian Learning of Probabilistic Language Models. PhD thesis, University of California, Berkeley, CA., 1994o
19. A. Stoleke. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-200, 1995.