{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:54:38Z","timestamp":1742396078333},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540615774"},{"type":"electronic","value":"9783540706311"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61577-6_6","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T21:59:34Z","timestamp":1330293574000},"page":"50-59","source":"Crossref","is-referenced-by-count":5,"title":["Comparison between the Inside-Outside algorithm and the Viterbi algorithm for stochastic context-free grammars"],"prefix":"10.1007","author":[{"given":"Joan-Andreu","family":"S\u00e1nchez","sequence":"first","affiliation":[]},{"given":"Jos\u00e9-Miguel","family":"Bened\u00ed","sequence":"additional","affiliation":[]},{"given":"Francisco","family":"Casacuberta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"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\u201335. Acoustical Society of America, June 1979.","key":"6_CR1","DOI":"10.1121\/1.2017061"},{"unstructured":"J.M. Bened\u00ed and J.A. S\u00e1nchez. 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\u2013450. AERFAI, Abril 1995.","key":"6_CR2"},{"issue":"5","key":"6_CR3","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/T-C.1973.223746","volume":"C-22","author":"T.L. Booth","year":"1973","unstructured":"T.L. Booth and R.A. Thompson. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5):442\u2013450, May 1973.","journal-title":"IEEE Transactions on Computers"},{"doi-asserted-by":"crossref","unstructured":"F. Casacuberta. Grow transformations for probabilistic functions of stochastic grammars. IJPRAI, 10(3), 1996.","key":"6_CR4","DOI":"10.1142\/S0218001496000153"},{"unstructured":"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\u2013182. NATO ASI, 1993.","key":"6_CR5"},{"unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, 1979.","key":"6_CR6"},{"unstructured":"E. Horowitz and S. Sahni. Fundamentals of Data Structures in Pascal. Computer Science Press, third edition, 1990.","key":"6_CR7"},{"issue":"3","key":"6_CR8","first-page":"315","volume":"17","author":"F. Jelinek","year":"1991","unstructured":"F. Jelinek and J.D. Lafferty. Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics, 17(3):315\u2013323, 1991.","journal-title":"Computational Linguistics"},{"key":"6_CR9","first-page":"177","volume":"1","author":"J. Kupiec","year":"1992","unstructured":"J. Kupiec. Hidden Markov estimation for unrestricted stochastic context-free grammars. Proc. of ICASSP'92 Vol. 1, pages 177\u2013180. 1992.","journal-title":"Proc. of ICASSP'92"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0885-2308(90)90022-X","volume":"4","author":"K. Lari","year":"1990","unstructured":"K. Lari and S. J. Young. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, 4:35\u201356, 1990.","journal-title":"Computer, Speech and Language"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0885-2308(91)90009-F","volume":"5","author":"K. Lari","year":"1991","unstructured":"K. Lari and S.J. Young. Applications of stochatic context-free grammars using the inside-outside algorithm. Computer, Speech and Language, (5):237\u2013257, 1991.","journal-title":"Computer, Speech and Language"},{"key":"6_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0885-2308(91)90002-8","volume":"5","author":"N. Merhav","year":"1991","unstructured":"N. Merhav and Y. Ephraim. Hidden markov modeling using a dominant state sequence with application to speech recognition. Computer Speech and Language, 5:327\u2013339, 1991.","journal-title":"Computer Speech and Language"},{"issue":"9","key":"6_CR13","doi-asserted-by":"crossref","first-page":"2111","DOI":"10.1109\/78.134449","volume":"39","author":"N. Merhav","year":"1991","unstructured":"N. Merhav and Y. Ephraim. Maximum likelihood hidden markov modeling using a dominant sequence of states. IEEE. Transactions on Signal Processing, 39(9):2111\u20132115, 1991.","journal-title":"IEEE. Transactions on Signal Processing"},{"doi-asserted-by":"crossref","unstructured":"H. Ney. Stochastic grammars and pattern recognition. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding. Recent Advances, pages 319\u2013344. Springer-Verlag, 1992.","key":"6_CR14","DOI":"10.1007\/978-3-642-76626-8_34"},{"unstructured":"S. Sahni. Concepts in Discrete Mathematics. Camelot Pub. Co., 1985.","key":"6_CR15"},{"key":"6_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Y. Sakakibara. Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science, 76:223\u2013242, 1990.","journal-title":"Theoretical Computer Science"},{"key":"6_CR17","volume-title":"Computer and Information Science UCSC-CRL-94-14","author":"Y. Sakakibara","year":"1993","unstructured":"Y. Sakakibara, M. Brown, R. Hughey, I.S. Mian, K. Sj\u00f6lander, R.C. Underwood, and D. Haussle. The application of stochastic context-free grammars to folding, aligning and modeling homologous rna. Computer and Information Science UCSC-CRL-94-14, Univ. of California, Santa Cruz, Ca., 1993."},{"key":"6_CR18","volume-title":"PhD thesis","author":"A. Stolcke","year":"1994","unstructured":"A. Stolcke. Bayesian Learning of Probabilistic Language Models. PhD thesis, University of California, Berkeley, CA., 1994."},{"issue":"2","key":"6_CR19","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"A. Stolcke. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165\u2013200, 1995.","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Advances in Structural and Syntactical Pattern Recognition"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61577-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:08:10Z","timestamp":1605647290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61577-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540615774","9783540706311"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-61577-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}