{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:13Z","timestamp":1725574093317},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540261544"},{"type":"electronic","value":"9783540322382"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11492542_21","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:04:07Z","timestamp":1294437847000},"page":"163-171","source":"Crossref","is-referenced-by-count":0,"title":["Time Reduction of Stochastic Parsing with 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":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Bened\u00ed, J.M., S\u00e1nchez, J.A.: Estimation of stochastic context-free grammars and their use as language models. Computer Speech and Language (2005) (to appear)","DOI":"10.1016\/j.csl.2004.09.001"},{"issue":"3","key":"21_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput.\u00a09(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"issue":"3","key":"21_CR3","first-page":"315","volume":"17","author":"F. Jelinek","year":"1991","unstructured":"Jelinek, F., Lafferty, J.D.: Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics\u00a017(3), 315\u2013323 (1991)","journal-title":"Computational Linguistics"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0885-2308(90)90022-X","volume":"4","author":"K. Lari","year":"1990","unstructured":"Lari, K., Young, S.J.: The estimation of stochastic context-free grammars using the insideoutside algorithm. Computer Speech and Language\u00a04, 35\u201356 (1990)","journal-title":"Computer Speech and Language"},{"issue":"2","key":"21_CR5","first-page":"313","volume":"19","author":"M.P. Marcus","year":"1993","unstructured":"Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of english: the penn treebank. Computational Linguistics\u00a019(2), 313\u2013330 (1993)","journal-title":"Computational Linguistics"},{"key":"21_CR6","series-title":"Recent Advances","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-642-76626-8_34","volume-title":"Speech Recognition and Understanding","author":"H. Ney","year":"1992","unstructured":"Ney, H.: Stochastic grammars and pattern recognition. In: Laface, P., De Mori, R. (eds.) Speech Recognition and Understanding. Recent Advances, pp. 319\u2013344. Springer, Heidelberg (1992)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Pereira, F., Schabes, Y.: Inside-outside reestimation from partially bracketed corpora. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 128\u2013135. University of Delaware (1992)","DOI":"10.3115\/981967.981984"},{"issue":"3","key":"21_CR8","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218001402001691","volume":"16","author":"I. Salvador","year":"2002","unstructured":"Salvador, I., Bened\u00ed, J.M.: Rna modeling by combining stochastic context-free grammars and n-gram models. International Journal of Pattern Recognition and Artificial Intelligence\u00a016(3), 309\u2013315 (2002)","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"issue":"2","key":"21_CR9","first-page":"165","volume":"21","author":"A. Stolcke","year":"1995","unstructured":"Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics\u00a021(2), 165\u2013200 (1995)","journal-title":"Computational Linguistics"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L.G. Valiant","year":"1975","unstructured":"Valiant, L.G.: General context-free recognition in less than cubic time. Journal of computer and system sciences\u00a010, 308\u2013315 (1975)","journal-title":"Journal of computer and system sciences"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11492542_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:35Z","timestamp":1605625115000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11492542_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540261544","9783540322382"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11492542_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}