{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T12:42:36Z","timestamp":1648816956172},"reference-count":20,"publisher":"MIT Press - Journals","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Linguistics"],"published-print":{"date-parts":[[2015,3]]},"abstract":"<jats:p> In parsing with Tree Adjoining Grammar (TAG), independent derivations have been shown by Schabes and Shieber (1994) to be essential for correctly supporting syntactic analysis, semantic interpretation, and statistical language modeling. However, the parsing algorithm they propose is not directly applicable to Feature-Based TAGs (FB-TAG). We provide a recognition algorithm for FB-TAG that supports both dependent and independent derivations. The resulting algorithm combines the benefits of independent derivations with those of Feature-Based grammars. In particular, we show that it accounts for a range of interactions between dependent vs. independent derivation on the one hand, and syntactic constraints, linear ordering, and scopal vs. nonscopal semantic dependencies on the other hand. <\/jats:p>","DOI":"10.1162\/coli_a_00217","type":"journal-article","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T15:11:01Z","timestamp":1424704261000},"page":"41-70","source":"Crossref","is-referenced-by-count":2,"title":["Multiple Adjunction in Feature-Based Tree-Adjoining Grammar"],"prefix":"10.1162","volume":"41","author":[{"given":"Claire","family":"Gardent","sequence":"first","affiliation":[{"name":"CNRS, LORIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shashi","family":"Narayan","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Lorraine, LORIA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"281","reference":[{"key":"R2","unstructured":"Candito, Marie-H\u00e9l\u00e8ne and Sylvain Kahane. 1998. Can the TAG derivation tree represent a semantic graph? An answer in the light of Meaning-Text Theory. In Proceedings of the Fourth Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+4), pages 21\u201324, Philadelphia, PA."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1162\/COLI_a_00144"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.3115\/1599081.1599113"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Gardent, Claire and Laura Kallmeyer. 2003. Semantic construction in Feature-Based TAG. In Proceedings of the 10th Conference of the European Chapter of the Association for Computational Linguistics (EACL), pages 123\u2013130, Budapest.","DOI":"10.3115\/1067807.1067825"},{"key":"R7","unstructured":"Joshi, Aravind K. 2000. Relationship between strong and weak generative power of formal systems. In Proceedings of the 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 107\u2013114, Paris."},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_2"},{"key":"R10","unstructured":"Kallmeyer, Laura and Marco Kuhlmann. 2012. A formal model for plausible dependencies in lexicalized tree adjoining grammar. In Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11), pages 108\u2013116, Paris."},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.3115\/981658.981679"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.3115\/992133.992135"},{"key":"R14","unstructured":"Schabes, Yves. 1991. The valid prefix property and left to right parsing of tree-adjoining grammar. In Proceedings of the 2nd International Workshop on Parsing Technologies (IWPT), pages 21\u201330, Cancun."},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.3115\/992133.992136"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.3115\/982023.982055"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.3115\/981967.981989"},{"key":"R18","unstructured":"Schabes, Yves and Stuart M. Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics, 20(1):91\u2013124."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1994.tb00003.x"},{"key":"R22","doi-asserted-by":"publisher","DOI":"10.3115\/981210.981221"},{"key":"R23","unstructured":"Vijay-Shanker, K. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania, Philadelphia."},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.3115\/991719.991783"},{"key":"R27","unstructured":"Vijay-Shanker, K. and David J. Weir. 1993. Parsing some constrained grammar formalisms. Computational Linguistics, 19(4):591\u2013636."},{"key":"R28","doi-asserted-by":"publisher","DOI":"10.3115\/982023.982057"}],"container-title":["Computational Linguistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mitpressjournals.org\/doi\/pdf\/10.1162\/COLI_a_00217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,12]],"date-time":"2021-03-12T21:27:42Z","timestamp":1615584462000},"score":1,"resource":{"primary":{"URL":"https:\/\/direct.mit.edu\/coli\/article\/41\/1\/41-70\/1498"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["10.1162\/COLI_a_00217"],"URL":"https:\/\/doi.org\/10.1162\/coli_a_00217","relation":{},"ISSN":["0891-2017","1530-9312"],"issn-type":[{"value":"0891-2017","type":"print"},{"value":"1530-9312","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3]]}}}