{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:54Z","timestamp":1759638234592,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540880080"},{"type":"electronic","value":"9783540880097"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-88009-7_9","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:52:54Z","timestamp":1221882774000},"page":"111-124","source":"Crossref","is-referenced-by-count":5,"title":["A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness"],"prefix":"10.1007","author":[{"given":"Anna","family":"Kasprzik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45007-6_22","volume-title":"Developments in Language Theory","author":"F. Drewes","year":"2003","unstructured":"Drewes, F., H\u00f6gberg, J.: Learning a Regular Tree Language from a Teacher. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 279\u2013291. Springer, Heidelberg (2003)"},{"issue":"2","key":"9_CR2","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":"9_CR3","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1024695608419","volume":"1","author":"J. Rogers","year":"2003","unstructured":"Rogers, J.: Syntactic Structures as Multi-dimensional Trees. Research on Language and Computation\u00a01, 265\u2013305 (2003)","journal-title":"Research on Language and Computation"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0304-3975(01)00349-8","volume":"293","author":"J. Rogers","year":"2003","unstructured":"Rogers, J.: wMSO Theories as Grammar Formalisms. TCS\u00a0293, 291\u2013320 (2003)","journal-title":"TCS"},{"issue":"2\u20133","key":"9_CR5","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science\u00a076(2\u20133), 223\u2013242 (1990)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","volume-title":"Natural Language Processing","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description. In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Processing. Cambridge University Press, Cambridge (1985)"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0304-3975(92)90124-X","volume":"104","author":"D.J. Weir","year":"1992","unstructured":"Weir, D.J.: A geometric hierarchy beyond context-free languages. Theoretical Computer Science\u00a0104(2), 235\u2013261 (1992)","journal-title":"Theoretical Computer Science"},{"unstructured":"Kasprzik, A.: Two Equivalent Regularizations of Tree Adjoining Grammars. Technical Report 08-1, University of Trier (2008), \n                      urts117.uni-trier.de\/cms\/index.php?id=15939","key":"9_CR8"},{"unstructured":"Kasprzik, A.: Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees. Technical Report 08-3, University of Trier (2008), \n                      urts117.uni-trier.de\/cms\/index.php?id=15939","key":"9_CR9"},{"key":"9_CR10","first-page":"128","volume-title":"Proc. 4th Annual Workshop on Comp. Learning Th.","author":"O. Maler","year":"1991","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. In: Proc. 4th Annual Workshop on Comp. Learning Th., pp. 128\u2013136. Morgan Kaufmann, San Francisco (1991)"},{"issue":"2","key":"9_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s00224-005-1233-3","volume":"40","author":"F. Drewes","year":"2007","unstructured":"Drewes, F., H\u00f6gberg, J.: Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory of Computing Systems\u00a040(2), 163\u2013185 (2007)","journal-title":"Theory of Computing Systems"}],"container-title":["Lecture Notes in Computer Science","Grammatical Inference: Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-88009-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:49:33Z","timestamp":1715312973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-88009-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540880080","9783540880097"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-88009-7_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}