{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:39Z","timestamp":1725489279338},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676058"},{"type":"electronic","value":"9783540451549"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45154-4_10","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:55:49Z","timestamp":1186883749000},"page":"106-117","source":"Crossref","is-referenced-by-count":1,"title":["Monte-Carlo Sampling for NP-Hard Maximization Problems in the Framework of Weighted Parsing"],"prefix":"10.1007","author":[{"given":"Jean-C\u00e9dric","family":"Chappelier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Rajman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1214\/aoms\/1177706362","volume":"30","author":"R.E. Bechhofer","year":"1959","unstructured":"R.E. Bechhofer, S. Elmaghraby, and N. Morse. A single-sample multiple-decision procedure for selecting the multinomial event which has the largest probability. Ann. Math. Statist., 30:102\u2013119, 1959.","journal-title":"Ann. Math. Statist."},{"issue":"2","key":"10_CR2","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1080\/03610918508812441","volume":"14","author":"R.E. Bechhofer","year":"1985","unstructured":"R.E. Bechhofer and D.M. Goldsman. Truncation of the Bechhofer-Kiefer-Sobel sequential procedure for selecting the multinomial event which has the largest probability. Communications in Statistics: simulation and computation, 14(2):283\u2013315, 1985.","journal-title":"Communications in Statistics: simulation and computation"},{"key":"10_CR3","volume-title":"Sequential Identification and Ranking Procedures","author":"R.E. Bechhofer","year":"1968","unstructured":"R.E. Bechhofer, J. Kiefer, and M. Sobel. Sequential Identification and Ranking Procedures. University of Chicago Press, Chicago, 1968."},{"key":"10_CR4","unstructured":"R. Bod. Applying Monte Carlo techniques to Data Oriented Parsing. In Proceedings Computational Linguistics in the Netherlands, Tilburg (The Netherlands), 1992."},{"key":"10_CR5","volume-title":"Enriching Linguistics with Statistics: Performance Models of Natural Language","author":"R. Bod","year":"1995","unstructured":"R. Bod. Enriching Linguistics with Statistics: Performance Models of Natural Language. Academische Pers, Amsterdam (The Netherlands), 1995."},{"key":"10_CR6","series-title":"CSLI Lecture Notes","volume-title":"Beyond Grammar, An Experience-Based Theory of Language","author":"R. Bod","year":"1998","unstructured":"R. Bod. Beyond Grammar, An Experience-Based Theory of Language. Number 88 in CSLI Lecture Notes. CSLI Publications, Standford (CA), 1998."},{"key":"10_CR7","unstructured":"R. Bod and R. Scha. Data-Oriented language processing: An overview. Technical Report LP-96-13, Departement of Computational Linguistics, University of Amsterdam, 1996. cmp-lg\/9611003."},{"key":"10_CR8","unstructured":"J.-C. Chappelier and M. Rajman. Extraction stochastique d\u2019arbres d\u2019analyse pour le mod\u00e9le DOP. In Proc. of 5\u00e9me conf\u00e9rence sur le Traitement Automatique du Langage Naturel (TALN98), pages 52\u201361, Paris (France), June 1998."},{"key":"10_CR9","unstructured":"J.-C. Chappelier and M. Rajman. A generalized CYK algorithm for parsing stochastic CFG. In TAPD\u201998 Workshop, pages 133\u2013137, Paris (France), 1998."},{"key":"10_CR10","unstructured":"J.-C. Chappelier, M. Rajman, R. Aragues, and A. Rozenknop. Lattice parsing for speech recognition. In Proc. of 6\u00e9me conf\u00e9rence sur le Traitement Automatique du Langage Naturel (TALN\u201999), pages 95\u2013104, July 1999."},{"issue":"10","key":"10_CR11","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/34.329008","volume":"16","author":"A. Corazza","year":"1994","unstructured":"A. Corazza, R. Demori, R. Gretter, and G. Satta. Optimal probabilistic evaluation functions for search controlled by stochastic context-free grammars. IEEE Trans, on Pattern Analysis and Machine Intelligence, 16(10):1018\u20131027, October 1994.","journal-title":"IEEE Trans, on Pattern Analysis and Machine Intelligence"},{"key":"10_CR12","unstructured":"J. Goodman. Parsing Inside-Out. PhD thesis, Harvard University, May1998. cmp-lg\/9805007."},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"F. Jelinek, J. D. Lafferty, and R. L. Mercer. Basic methods of probabilistic context-free grammars. In P. Laface and R. De Mori, editors, Speech Recognition and Understanding: Recent Advances, Trends and Applications, volume 75 of F: Computer and System Science. Springer, 1992.","DOI":"10.1007\/978-3-642-76626-8_35"},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1214\/aoms\/1177706363","volume":"30","author":"H. Kesten","year":"1959","unstructured":"H. Kesten and N. Morse. A property of the multinomial distribution. Ann. Math. Statist., 30:120\u2013127, 1959.","journal-title":"Ann. Math. Statist."},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"W. Kuich. Semirings and formal power series: Their relevance to formal languages and automata. In G. Rozenberg and A. Salomaa, editors, Handbook of formal languages, volume 1, chapter 9, pages 609\u2013677. Springer-Verlag, 1997.","DOI":"10.1007\/978-3-642-59136-5_9"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Yves Schabes. Stochastic lexicalized tree-adjoining grammars. In Proc. 14th Int. Conf. of Computationnal Linguistics (COLING), pages 426\u2013432, Nantes (France), August 1992.","DOI":"10.3115\/992133.992136"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"K. Sima\u2019an. Computational complexity of probabilistic disambiguation by means of tree grammars. In Proceedings of COLING\u201996, Copenhagen (Denmark), 1996. cmp-lg\/9606019.","DOI":"10.3115\/993268.993392"},{"issue":"2","key":"10_CR18","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\u2013201, 1995.","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing \u2014 NLP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45154-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T08:58:34Z","timestamp":1550739514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45154-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676058","9783540451549"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45154-4_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}