{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:11:11Z","timestamp":1725743471354},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642399978"},{"type":"electronic","value":"9783642399985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39998-5_1","type":"book-chapter","created":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T21:59:20Z","timestamp":1375135160000},"page":"1-16","source":"Crossref","is-referenced-by-count":0,"title":["On IO-Copying and Mildly-Context Sensitive Formalisms"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Bourreau","sequence":"first","affiliation":[]},{"given":"Laura","family":"Kallmeyer","sequence":"additional","affiliation":[]},{"given":"Sylvain","family":"Salvati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-642-23211-4_2","volume-title":"The Mathematics of Language","author":"P. Bourreau","year":"2011","unstructured":"Bourreau, P., Salvati, S.: A Datalog recognizer for almost affine \u03bb-CFGs. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds.) MOL 12. LNCS, vol.\u00a06878, pp. 21\u201338. Springer, Heidelberg (2011)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"de Groote, P.: Towards abstract categorial grammars. In: Association for Computational Linguistics, 39th Annual Meeting and 10th Conference of the European Chapter, Proceedings of the Conference, pp. 148\u2013155 (2001)","DOI":"10.3115\/1073012.1073045"},{"issue":"4","key":"1_CR3","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/s10849-004-2114-x","volume":"13","author":"P. Groote de","year":"2004","unstructured":"de Groote, P., Pogodalla, S.: On the expressive power of abstract categorial grammars: Representing context-free formalisms. Journal of Logic, Language and Information\u00a013(4), 421\u2013438 (2004)","journal-title":"Journal of Logic, Language and Information"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: Grammars with macro-like productions. In: IEEE Conference Record of 9th Annual Symposium on Switching and Automata Theory, pp. 131\u2013142. IEEE (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Fischer, M.J.: Grammars with macro-like productions. PhD thesis, Harvard University (1968)","DOI":"10.1109\/SWAT.1968.12"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Joshi, A.K.: Tree-adjoining grammars: How much context-sensitivity is required to provide reasonable strucutral descriptions? In: Natural Language Parsing: Psychological, Computational and Theoretical Perspectives, pp. 206\u2013250 (1985)","DOI":"10.1017\/CBO9780511597855.007"},{"key":"1_CR7","unstructured":"Joshi, A.K., Shanker, V.K., Weir, D.J.: The converence of mildly context-sensitive grammar formalisms. In: Sells, P., Shieber, S.M., Wasow, T. (eds.) Foundational Issues in Natural Language Processing, pp. 31\u201381. The MIT Press (1991)"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11168-011-9081-6","volume":"8","author":"L. Kallmeyer","year":"2010","unstructured":"Kallmeyer, L.: On mildly context-sensitive non-linear rewriting. Research on Language and Computation\u00a08(2), 341\u2013363 (2010)","journal-title":"Research on Language and Computation"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Kanazawa, M.: Abstract families of abstract categorial grammars. In: Proceedings of WoLLIC, Stanford University CSLI (2006)","DOI":"10.1016\/j.entcs.2006.05.037"},{"key":"1_CR10","unstructured":"Kanazawa, M.: Parsing and generation as Datalog queries. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, Prague, pp. 176\u2013183. Association for Computational Linguistics (2007)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s10849-009-9109-6","volume":"19","author":"M. Kanazawa","year":"2010","unstructured":"Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. Journal of Logic, Language and Information\u00a019(2), 137\u2013161 (2010)","journal-title":"Journal of Logic, Language and Information"},{"key":"1_CR12","unstructured":"Muskens, R.: Lambda Grammars and the Syntax-Semantics Interface. In: van Rooy, R., Stokhof, M. (eds.) Proceedings of the Thirteenth Amsterdam Colloquium, Amsterdam, pp. 150\u2013155 (2001)"},{"key":"1_CR13","unstructured":"Salvati, S.: Encoding second-order ACGs with deterministic tree walking transducers. In: Proceedings of Formal Grammar, Malaga, Spain (2006)"},{"key":"1_CR14","unstructured":"Salvati, S.: MIX is a 2-MCFL and the word problem in \u21242 is captured by the IO and the OI hierarchies. Technical report, INRIA (2011)"},{"issue":"2","key":"1_CR15","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., Matsamura, T., Mamoru, F., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science\u00a088(2), 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"key":"1_CR16","series-title":"Lecture Notes in Artificial Intelligence","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)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Venkateswaran, H.: Properties that characterize LOGCFL. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, pp. 141\u2013150. ACM (1987)","DOI":"10.1145\/28395.28411"},{"key":"1_CR18","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 the Association for Computational Linguistics, Stanford (1987)","DOI":"10.3115\/981175.981190"},{"key":"1_CR19","unstructured":"Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania (1988)"},{"key":"1_CR20","unstructured":"Yoshinaka, R.: Linearization of affine abstract categorial grammars. In: Proceedings of the 11th Conference on Formal Grammar, Malaga, Spain, pp. 185\u2013199 (2006)"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39998-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T01:49:27Z","timestamp":1557971367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39998-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642399978","9783642399985"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39998-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}