{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:32:50Z","timestamp":1725895970556},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642201684"},{"type":"electronic","value":"9783642201691"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20169-1_3","type":"book-chapter","created":{"date-parts":[[2011,3,28]],"date-time":"2011-03-28T05:21:04Z","timestamp":1301289664000},"page":"31-46","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Component Tree Insertion Grammars"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Boullier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beno\u00eet","family":"Sagot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","volume-title":"How much context-sensitivity is necessary for characterizing structural descriptions \u2014 Tree Adjoining Grammars","author":"A.K. Joshi","year":"1985","unstructured":"Joshi, A.K.: In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) How much context-sensitivity is necessary for characterizing structural descriptions \u2014 Tree Adjoining Grammars. Cambridge University Press, New-York (1985)"},{"key":"3_CR2","unstructured":"Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA (1988)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1075\/z.35.07jos","volume-title":"Mathematics of Language","author":"A.K. Joshi","year":"1987","unstructured":"Joshi, A.K.: An introduction to tree adjoining grammars. In: Manaster-Ramer, A. (ed.) Mathematics of Language, pp. 87\u2013114. John Benjamins, Amsterdam (1987)"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"104","DOI":"10.3115\/981175.981190","volume-title":"Proceedings of the 25th Meeting of the Association for Computational Linguistics (ACL 1987)","author":"K. Vijay-Shanker","year":"1987","unstructured":"Vijay-Shanker, K., Weir, D., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Meeting of the Association for Computational Linguistics (ACL 1987), pp. 104\u2013111. Stanford University, CA (1987)"},{"issue":"3","key":"3_CR5","first-page":"759","volume":"41","author":"P. Boullier","year":"2000","unstructured":"Boullier, P.: On TAG parsing. Traitement Automatique des Langues (T.A.L.)\u00a041(3), 759\u2013793 (2000)","journal-title":"Traitement Automatique des Langues (T.A.L.)"},{"key":"3_CR6","unstructured":"Boullier, P.: On Multicomponent TAG parsing. In: 6\n                    me\n                   conference annuelle sur le Traitement Automatique des Langues Naturelles (TALN 1999), Cargse, Corse, France, pp. 321\u2013326 (July 1999); see also Research Report No. 3668 at \n                    \n                      http:\/\/www.inria.fr\/RRRT\/RR-3668.html\n                    \n                    \n                  , INRIA-Rocquencourt, France, 39 pages (April 1999)"},{"key":"3_CR7","first-page":"42","volume-title":"Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001)","author":"F. Barth\u00e9lemy","year":"2001","unstructured":"Barth\u00e9lemy, F., Boullier, P., Deschamp, P., de la Clergerie, \u00c9.: Guided parsing of range concatenation languages. In: Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics (ACL 2001), pp. 42\u201349. University of Toulouse, France (July 2001)"},{"key":"3_CR8","unstructured":"Schabes, Y., Waters, R.C.: Tree insertion grammar: A cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics 21 (1994)"},{"key":"3_CR9","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., Takahashi, M.: Tree adjunct grammars. Journal of Computer and System Sciences\u00a010, 136\u2013163 (1975)","journal-title":"Journal of Computer and System Sciences"},{"key":"3_CR10","first-page":"17","volume-title":"Proceedings of TAG+4","author":"P. Boullier","year":"1998","unstructured":"Boullier, P.: A generalization of mildly context-sensitive formalisms. In: Proceedings of TAG+4, pp. 17\u201320. University of Pennsylvania, Philadelphia (August 1998)"},{"key":"3_CR11","series-title":"Text, Speech and Language Technology","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/1-4020-2295-6_13","volume-title":"New Developments in Parsing Technology","author":"P. Boullier","year":"2004","unstructured":"Boullier, P.: Range Concatenation Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds.) New Developments in Parsing Technology. Text, Speech and Language Technology, vol.\u00a023, pp. 269\u2013289. Kluwer Academic Publishers, Dordrecht (2004)"},{"key":"3_CR12","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, 191\u2013229 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"2\/3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1009907814595","volume":"3","author":"P. Boullier","year":"2000","unstructured":"Boullier, P.: A cubic time extension of context-free grammars. Grammars\u00a03(2\/3), 111\u2013131 (2000)","journal-title":"Grammars"}],"container-title":["Lecture Notes in Computer Science","Formal Grammar"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20169-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T18:47:08Z","timestamp":1547750828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20169-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642201684","9783642201691"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20169-1_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}