{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:40:44Z","timestamp":1725579644606},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642320231"},{"type":"electronic","value":"9783642320248"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32024-8_13","type":"book-chapter","created":{"date-parts":[[2012,7,14]],"date-time":"2012-07-14T03:58:00Z","timestamp":1342238280000},"page":"192-207","source":"Crossref","is-referenced-by-count":2,"title":["Polynomial Time Learning of Some Multiple Context-Free Languages with a Minimally Adequate Teacher"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Yoshinaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Clark","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1017\/CBO9780511597855.007","volume-title":"Natural Language Parsing","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions? In: Dowty, D.R., Karttunen, L., Zwicky, A. (eds.) Natural Language Parsing, pp. 206\u2013250. Cambridge University Press, Cambridge (1985)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Annual Meeting of Association for Computational Linguistics, Stanford, pp. 104\u2013111 (1987)","DOI":"10.3115\/981175.981190"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A.K. Joshi","year":"1975","unstructured":"Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences\u00a010(1), 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR4","unstructured":"Joshi, A.K.: An introduction to tree adjoining grammars. In: Manaster-Ramer, A. (ed.) Mathematics of Languge. John Benjamins (1987)"},{"key":"13_CR5","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/BFb0052152","volume-title":"Logical Aspects of Computational Linguistics","author":"E.P. Stabler","year":"1997","unstructured":"Stabler, E.P.: Derivational Minimalism. In: Retor\u00e9, C. (ed.) LACL 1996. LNCS (LNAI), vol.\u00a01328, pp. 68\u201395. Springer, Heidelberg (1997)"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/0022-0000(91)90018-Z","volume":"43","author":"J. Engelfriet","year":"1991","unstructured":"Engelfriet, J., Heyker, L.: The string generating power of context-free hypergraph grammars. Journal of Computer and System Sciences\u00a043(2), 328\u2013360 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_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":"13_CR8","unstructured":"Huybrechts, R.A.C.: The weak inadequacy of context-free phrase structure grammars. In: de Haan, G., Trommelen, M., Zonneveld, W. (eds.) Van Periferie naar Kern, Foris, Dordrecht, Holland (1984)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/BF00630917","volume":"8","author":"S.M. Shieber","year":"1985","unstructured":"Shieber, S.M.: Evidence against the context-freeness of natural language. Linguistics and Philosophy\u00a08, 333\u2013343 (1985)","journal-title":"Linguistics and Philosophy"},{"issue":"2","key":"13_CR10","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"},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1006\/jcss.1995.1026","volume":"50","author":"D. Angluin","year":"1995","unstructured":"Angluin, D., Kharitonov, M.: When won\u2019t membership queries help? Journal of Computer and System Sciences\u00a050(2), 336\u2013355 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"13_CR12","first-page":"473","volume":"5","author":"A. Clark","year":"2004","unstructured":"Clark, A., Thollard, F.: PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research\u00a05, 473\u2013497 (2004)","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(91)90374-B","volume":"88","author":"H. Seki","year":"1991","unstructured":"Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science\u00a088(2), 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"13_CR14","unstructured":"Kracht, M.: The Mathematics of Language. Studies in Generative Grammar, vol.\u00a063, pp. 408\u2013409. Mouton de Gruyter (2003)"},{"issue":"1-2","key":"13_CR15","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0304-3975(97)00190-4","volume":"223","author":"O. Rambow","year":"1999","unstructured":"Rambow, O., Satta, G.: Independent parallelism in finite copying parallel rewriting systems. Theoretical Computer Science\u00a0223(1-2), 87\u2013120 (1999)","journal-title":"Theoretical Computer Science"},{"key":"13_CR16","unstructured":"Kaji, Y., Nakanishi, R., Seki, H., Kasami, T.: The universal recognition problems for parallel multiple context-free grammars and for their subclasses. IEICE Transaction on Information and Systems\u00a0E75-D(7), 499\u2013508 (1992)"},{"key":"13_CR17","doi-asserted-by":"crossref","unstructured":"Clark, A.: Distributional learning of some context-free languages with a minimally adequate teacher. In: Proceedings of the ICGI, Valencia, Spain (September 2010)","DOI":"10.1007\/978-3-642-15488-1_4"},{"issue":"2","key":"13_CR18","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":"13_CR19","unstructured":"Kanazawa, M.: A prefix-correct earley recognizer for multiple context-free grammars. In: Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms, pp. 49\u201356 (2008)"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-15488-1_19","volume-title":"Grammatical Inference: Theoretical Results and Applications","author":"R. Yoshinaka","year":"2010","unstructured":"Yoshinaka, R.: Polynomial-Time Identification of Multiple Context-Free Languages from Positive Data and Membership Queries. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol.\u00a06339, pp. 230\u2013244. Springer, Heidelberg (2010)"},{"key":"13_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-88009-7_3","volume-title":"Grammatical Inference: Algorithms and Applications","author":"A. Clark","year":"2008","unstructured":"Clark, A., Eyraud, R., Habrard, A.: A Polynomial Algorithm for the Inference of Context Free Languages. In: Clark, A., Coste, F., Miclet, L. (eds.) ICGI 2008. LNCS (LNAI), vol.\u00a05278, pp. 29\u201342. Springer, Heidelberg (2008)"},{"key":"13_CR22","unstructured":"Clark, A.: A learnable representation for syntax using residuated lattices. In: Proceedings of the 14th Conference on Formal Grammar, Bordeaux, France (2009)"},{"issue":"4","key":"13_CR23","first-page":"519","volume":"6","author":"A. Okhotin","year":"2001","unstructured":"Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics\u00a06(4), 519\u2013535 (2001)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"13_CR24","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":"13_CR25","doi-asserted-by":"crossref","unstructured":"Melamed, I.D.: Multitext grammars and synchronous parsers. In: Proceedings of NAACL\/HLT, pp. 79\u201386 (2003)","DOI":"10.3115\/1073445.1073466"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32024-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T21:58:37Z","timestamp":1556920717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32024-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642320231","9783642320248"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32024-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}