{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:13:27Z","timestamp":1725905607561},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319633411"},{"type":"electronic","value":"9783319633428"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-63342-8_6","type":"book-chapter","created":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T06:36:51Z","timestamp":1500100611000},"page":"68-80","source":"Crossref","is-referenced-by-count":1,"title":["Distributional Learning of Regular Formal Graph System of Bounded Degree"],"prefix":"10.1007","author":[{"given":"Takayoshi","family":"Shoudai","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Matsumoto","sequence":"additional","affiliation":[]},{"given":"Yusuke","family":"Suzuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,16]]},"reference":[{"key":"6_CR1","unstructured":"Chiang, D., Andreas, J., Bauer, D., Hermann, K.M., Jones, B., Knight, K.: Parsing graphs with hyperedge replacement grammars. In: Proceeding of ACL 2013, pp. 924\u2013932. Association for Computational Linguistic (2013)"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-642-20169-1_12","volume-title":"Formal Grammar","author":"A Clark","year":"2011","unstructured":"Clark, A.: A learnable representation for syntax using residuated lattices. In: Groote, P., Egg, M., Kallmeyer, L. (eds.) FG 2009. LNCS, vol. 5591, pp. 183\u2013198. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-20169-1_12"},{"key":"6_CR3","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. J. Mach. Learn. Res. 8, 1725\u20131745 (2007)","journal-title":"J. Mach. Learn. Res."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Drewes, F., Kreowski, H.J., Habel, A.: Hyperedge replacement graph grammars. In: Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1, pp. 95\u2013162. World Scientific (1997)","DOI":"10.1142\/9789812384720_0002"},{"issue":"10","key":"6_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1162\/coli_a_00040","volume":"37","author":"D Gildea","year":"2011","unstructured":"Gildea, D.: Grammar factorization by tree decomposition. Comput. Linguist. 37(10), 231\u2013248 (2011)","journal-title":"Comput. Linguist."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Hara, S., Shoudai, T.: Polynomial time MAT learning of c-deterministic regular formal graph systems. In: Proceeding IIAI-AAI 2014, pp. 204\u2013211. IEEE (2014)","DOI":"10.1109\/IIAI-AAI.2014.51"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","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 (LNAI), vol. 6925, pp. 398\u2013412. Springer, Heidelberg (2011). doi:\n10.1007\/978-3-642-24412-4_31"},{"issue":"5","key":"6_CR8","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF00289017","volume":"27","author":"C Lautemann","year":"1990","unstructured":"Lautemann, C.: The complexity of graph languages generated by hyperedge replacement. Acta Informatica 27(5), 399\u2013421 (1990)","journal-title":"Acta Informatica"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-540-75225-7_25","volume-title":"Algorithmic Learning Theory","author":"R Okada","year":"2007","unstructured":"Okada, R., Matsumoto, S., Uchida, T., Suzuki, Y., Shoudai, T.: Exact learning of finite unions of graph patterns from queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 298\u2013312. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-75225-7_25"},{"issue":"2","key":"6_CR10","first-page":"99","volume":"E78\u2013D","author":"T Uchida","year":"1995","unstructured":"Uchida, T., Shoudai, T., Miyano, S.: Parallel algorithms for refutation tree problem on formal graph systems. IEICE Trans. Inf. Syst. E78\u2013D(2), 99\u2013112 (1995)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"6_CR11","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. 7183, pp. 538\u2013550. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-28332-1_46"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Yoshinaka, R.: General perspective on distributionally learnable classes. In: Proceeding of MoL 2015, pp. 87\u201398. Association for Computational Linguistic (2015)","DOI":"10.3115\/v1\/W15-2308"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63342-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,15]],"date-time":"2017-07-15T06:39:07Z","timestamp":1500100747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63342-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319633411","9783319633428"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63342-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}