{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:54:07Z","timestamp":1725486847781},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540728467"},{"type":"electronic","value":"9783540728474"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72847-4_12","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T18:01:24Z","timestamp":1183485684000},"page":"80-88","source":"Crossref","is-referenced-by-count":3,"title":["Fast Stochastic Context-Free Parsing: A Stochastic Version of the Valiant Algorithm"],"prefix":"10.1007","author":[{"given":"Jos\u00e9-Miguel","family":"Bened\u00ed","sequence":"first","affiliation":[]},{"given":"Joan-Andreu","family":"S\u00e1nchez","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"12_CR1","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"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/j.csl.2004.09.001","volume":"19","author":"J. Bened\u00ed","year":"2005","unstructured":"Bened\u00ed, J., S\u00e1nchez, J.: Estimation of stochastic context-free grammars and their use as language models. Computer Speech and Language\u00a019(3), 249\u2013274 (2005)","journal-title":"Computer Speech and Language"},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/978-3-642-76626-8_34","volume-title":"Speech Recognition and Understanding. Recent Advances","author":"H. Ney","year":"1992","unstructured":"Ney, H.: Stochastic grammars and pattern recognition. In: Laface, P., Mori, R.D. (eds.) Speech Recognition and Understanding. Recent Advances, pp. 319\u2013344. Springer, Heidelberg (1992)"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Sakakibara, Y., Brown, M., Hughey, R., Mian, I., Sj\u00f6lander, K., Underwood, R., Haussle, D.: 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)","DOI":"10.1109\/HICSS.1994.323568"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Baker, J.: Trainable grammars for speech recognition. In: Klatt, D.H., Wolf, J.J. (eds.) Speech Communications for the 97th Meeting of the Acoustical Society of America, pp. 31\u201335. Acoustical Society of America (1979)","DOI":"10.1121\/1.2017061"},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1016\/S0022-0000(75)80046-8","volume":"10","author":"L. Valiant","year":"1975","unstructured":"Valiant, L.: 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"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505241.505242","volume":"49","author":"L. Lee","year":"2002","unstructured":"Lee, L.: Fast context-free grammar parsing requires fast boolean matrix multiplication. Journal of the ACM\u00a049(1), 1\u201315 (2002)","journal-title":"Journal of the ACM"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(94)00265-K","volume":"143","author":"W. Rytter","year":"1995","unstructured":"Rytter, W.: Context-free recognition via shortest paths computation: a version of valiant\u2019s algorithm. Theoretical Computer Science\u00a0143, 343\u2013352 (1995)","journal-title":"Theoretical Computer Science"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BF02165411","volume":"13","author":"V. Strassen","year":"1969","unstructured":"Strassen, V.: Gaussian elimination is not optimal. Numerische Mathematik\u00a013, 354\u2013356 (1969)","journal-title":"Numerische Mathematik"},{"issue":"3","key":"12_CR10","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":"4","key":"12_CR11","first-page":"573","volume":"25","author":"J. Goodman","year":"1999","unstructured":"Goodman, J.: Semiring parsing. Computational Linguistics\u00a025(4), 573\u2013605 (1999)","journal-title":"Computational Linguistics"},{"key":"12_CR12","volume-title":"Introduction to Formal Language Theory","author":"M. Harrison","year":"1978","unstructured":"Harrison, M.: Introduction to Formal Language Theory. Addison-Wesley, London (1978)"},{"issue":"2","key":"12_CR13","first-page":"313","volume":"19","author":"M. Marcus","year":"1993","unstructured":"Marcus, M., Santorini, B., Marcinkiewicz, M.: Building a large annotated corpus of english: the penn treebank. Computational Linguistics\u00a019(2), 313\u2013330 (1993)","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Pattern Recognition and Image Analysis"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72847-4_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:05:54Z","timestamp":1605744354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72847-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540728467","9783540728474"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72847-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}