{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T23:05:16Z","timestamp":1725750316889},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642409349"},{"type":"electronic","value":"9783642409356"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40935-6_11","type":"book-chapter","created":{"date-parts":[[2013,9,27]],"date-time":"2013-09-27T01:14:50Z","timestamp":1380244490000},"page":"143-157","source":"Crossref","is-referenced-by-count":6,"title":["PAC Learning of Some Subclasses of Context-Free Grammars with Basic Distributional Properties from Positive Data"],"prefix":"10.1007","author":[{"given":"Chihiro","family":"Shibata","sequence":"first","affiliation":[]},{"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"11_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11872436_6","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Clark","year":"2006","unstructured":"Clark, A.: PAC-learning unambiguous NTS languages. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol.\u00a04201, pp. 59\u201371. Springer, Heidelberg (2006)"},{"key":"11_CR3","unstructured":"Clark, A.: A learnable representation for syntax using residuated lattices. In: Proceedings of the 14th Conference on Formal Grammar, Bordeaux, France (2009)"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Clark, A.: Distributional learning of some context-free languages with a minimally adequate teacher. In: Sempere, Garc\u00eda (eds.) [12], pp. 24\u201337","DOI":"10.1007\/978-3-642-15488-1_4"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere, Garc\u00eda (eds.) [12], pp. 38\u201351","DOI":"10.1007\/978-3-642-15488-1_5"},{"key":"11_CR6","series-title":"Lecture Notes in Artificial Intelligence","volume-title":"Grammatical Inference: Algorithms and Applications","year":"2008","unstructured":"Clark, A., Coste, F., Miclet, L. (eds.): ICGI 2008. LNCS (LNAI), vol.\u00a05278. Springer, Heidelberg (2008)"},{"key":"11_CR7","first-page":"1725","volume":"8","author":"A. Clark","year":"2007","unstructured":"Clark, A., Eyraud, R.: Polynomial identification in the limit of substitutable context-free languages. Journal of Machine Learning Research\u00a08, 1725\u20131745 (2007)","journal-title":"Journal of Machine Learning Research"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Clark, A., Eyraud, R., Habrard, A.: A note on contextual binary feature grammars. In: EACL 2009 workshop on Computational Linguistic Aspects of Grammatical Inference, pp. 33\u201340 (2009)","DOI":"10.3115\/1705475.1705481"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Clark, A., Thollard, F.: Partially distribution-free learning of regular languages from positive samples. In: COLING (2004)","DOI":"10.3115\/1220355.1220368"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/(SICI)1098-2418(199809)13:2<99::AID-RSA1>3.0.CO;2-M","volume":"13","author":"D. Dubhashi","year":"1998","unstructured":"Dubhashi, D., Ranjan, D.: Balls and bins: A study in negative dependence. Random Structures and Algorithms\u00a013(2), 99\u2013124 (1998)","journal-title":"Random Structures and Algorithms"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Luque, F.M., L\u00f3pez, G.G.I.: PAC-learning unambiguous k,l-NTS\u2009\u2264\u2009 languages. In: Sempere, Garc\u00eda (eds.) [12], pp. 122\u2013134","DOI":"10.1007\/978-3-642-15488-1_11"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","volume-title":"Grammatical Inference: Theoretical Results and Applications","year":"2010","unstructured":"Sempere, J.M., Garc\u00eda, P. (eds.): ICGI 2010. LNCS, vol.\u00a06339. Springer, Heidelberg (2010)"},{"key":"11_CR13","first-page":"380","volume":"34","author":"H. Shirakawa","year":"1993","unstructured":"Shirakawa, H., Yokomori, T.: Polynomial-time MAT learning of c-deterministic context-free grammars. Transaction of Information Processing Society of Japan\u00a034, 380\u2013390 (1993)","journal-title":"Transaction of Information Processing Society of Japan"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Tajima, Y., Kotani, Y.: Polynomial time probabilistic learning of a subclass of linear languages with queries. In: Clark, et al. [6], pp. 187\u2013199","DOI":"10.1007\/978-3-540-88009-7_15"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Yoshinaka, R.: Identification in the limit of k,l-substitutable context-free languages. In: Clark, et al. [6], pp. 266\u2013279","DOI":"10.1007\/978-3-540-88009-7_21"},{"key":"11_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-642-22321-1_37","volume-title":"Developments in Language Theory","author":"R. Yoshinaka","year":"2011","unstructured":"Yoshinaka, R.: Towards dual approaches for learning context-free grammars based on syntactic concept lattices. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 429\u2013440. Springer, Heidelberg (2011)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-642-28332-1_46","volume-title":"Language and Automata Theory and Applications","author":"R. Yoshinaka","year":"2012","unstructured":"Yoshinaka, R.: Integration of the dual approaches in the distributional learning of context-free grammars. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 538\u2013550. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40935-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T12:26:37Z","timestamp":1558095997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40935-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642409349","9783642409356"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40935-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}