{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:41:49Z","timestamp":1743133309933,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662530412"},{"type":"electronic","value":"9783662530429"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53042-9_6","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T09:36:04Z","timestamp":1470389764000},"page":"94-111","source":"Crossref","is-referenced-by-count":0,"title":["Distributional Learning and Context\/Substructure Enumerability in Nonlinear Tree Grammars"],"prefix":"10.1007","author":[{"given":"Makoto","family":"Kanazawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ryo","family":"Yoshinaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1999.1684","volume":"61","author":"R Bloem","year":"2000","unstructured":"Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. Syst. Sci. 61, 1\u201350 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/3-540-08342-1_8","volume-title":"Automata, Languages and Programming","author":"C B\u00f6hm","year":"1977","unstructured":"B\u00f6hm, C., Coppo, M., Dezani-Ciancaglini, M.: Termination tests inside \n            $$\\lambda $$\n          -calculus. In: Salomaa, A., Steinby, M. (eds.) Automata, Languages and Programming. LNCS, vol. 52, pp. 95\u2013110. Springer, Heidelberg (1977)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere and Garc\u00eda [11], pp. 38\u201351","DOI":"10.1007\/978-3-642-15488-1_5"},{"issue":"1\u20132","key":"6_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10994-013-5403-2","volume":"96","author":"A Clark","year":"2014","unstructured":"Clark, A., Yoshinaka, R.: Distributional learning of parallel multiple context-free grammars. Mach. Learn. 96(1\u20132), 5\u201331 (2014). doi:\n10.1007\/s10994-013-5403-2","journal-title":"Mach. Learn."},{"key":"6_CR5","unstructured":"Kanazawa, M.: Parsing and generation as datalog queries. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, Prague, Czech Republic, pp. 176\u2013183 (2007)"},{"issue":"2","key":"6_CR6","first-page":"250","volume":"15","author":"M Kanazawa","year":"2009","unstructured":"Kanazawa, M.: A lambda calculus characterization of MSO definable tree transductions (abstract). Bull. Symbolic Logic 15(2), 250\u2013251 (2009)","journal-title":"Bull. Symbolic Logic"},{"key":"6_CR7","unstructured":"Kanazawa, M.: Parsing and generation as datalog query evaluation. IfColog J. Logics Their Appl. (to appear). \nhttp:\/\/research.nii.ac.jp\/~kanazawa\/publications\/pagadqe.pdf"},{"key":"6_CR8","first-page":"131","volume-title":"Trends in Logic XIII","author":"M Kanazawa","year":"2014","unstructured":"Kanazawa, M.: Almost affine lambda terms. In: Indrzejczak, A., Kaczmarek, J., Zawidzki, M. (eds.) Trends in Logic XIII, pp. 131\u2013148. \u0141\u00f3d\u017a University Press, \u0141\u00f3d\u017a (2014)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/978-3-642-24412-4_31","volume-title":"Algorithmic Learning Theory","author":"A Kasprzik","year":"2011","unstructured":"Kasprzik, A., Yoshinaka, R.: Distributional learning of simple context-free tree grammars. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS, vol. 6925, pp. 398\u2013412. Springer, Heidelberg (2011)"},{"key":"6_CR10","series-title":"FG Online Proceedings","first-page":"143","volume-title":"Proceedings of FG 2006: The 11th conference on Formal Grammar","author":"S Salvati","year":"2007","unstructured":"Salvati, S.: Encoding second order string ACG with deterministic tree walking transducers. In: Wintner, S. (ed.) Proceedings of FG 2006: The 11th conference on Formal Grammar. FG Online Proceedings, pp. 143\u2013156. CSLI Publications, Stanford (2007)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Grammatical Inference: Theoretical Results and Applications. Proceedings of 10th International Colloquium, ICGI 2010, Valencia, Spain, 13\u201316 September 2010","year":"2010","unstructured":"Sempere, J.M., Garc\u00eda, P. (eds.): Grammatical Inference: Theoretical Results and Applications. Proceedings of 10th International Colloquium, ICGI 2010, Valencia, Spain, 13\u201316 September 2010. LNCS. Springer, Heidelberg (2010)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6339, pp. 230\u2013244. Springer, Heidelberg (2010)"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6795, pp. 429\u2013440. Springer, Heidelberg (2011)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-3-642-22221-4_17","volume-title":"Logical Aspects of Computational Linguistics","author":"R Yoshinaka","year":"2011","unstructured":"Yoshinaka, R., Kanazawa, M.: Distributional learning of abstract categorial grammars. In: Pogodalla, S., Prost, J.-P. (eds.) Logical Aspects of Computational Linguistics. LNCS, vol. 6736, pp. 251\u2013266. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53042-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T07:06:20Z","timestamp":1517900780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53042-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662530412","9783662530429"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53042-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}