{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T10:37:13Z","timestamp":1648723033400},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,1,23]],"date-time":"2009-01-23T00:00:00Z","timestamp":1232668800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10849-009-9081-1","type":"journal-article","created":{"date-parts":[[2009,1,22]],"date-time":"2009-01-22T04:00:10Z","timestamp":1232596810000},"page":"293-316","source":"Crossref","is-referenced-by-count":3,"title":["Associative Grammar Combination Operators for Tree-Based Grammars"],"prefix":"10.1007","volume":"18","author":[{"given":"Yael","family":"Sygal","sequence":"first","affiliation":[]},{"given":"Shuly","family":"Wintner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,1,23]]},"reference":[{"key":"9081_CR1","first-page":"21","volume-title":"Proceedings of the ESSLLI-2000 Workshop on Linguistic Theory and Grammar Implementation","author":"A. Abeill\u00e9","year":"2000","unstructured":"Abeill\u00e9 A., Candito M.-H., Kinyon A. (2000) FTAG: Developing and maintaining a wide-coverage grammar for French. In: Erhard H., Meurers D., Wintner S.(eds) Proceedings of the ESSLLI-2000 Workshop on Linguistic Theory and Grammar Implementation. Morgan Kaufmann Publishers, Germany, pp 21\u201332"},{"key":"9081_CR2","doi-asserted-by":"crossref","unstructured":"Bonfante, G., Guillaume, B., Perrier, G. (2004). Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation. In Proceedings of the 20th international conference on Computational Linguistics (COLING 04), Association for Computational Linguistics, Morristown, NJ, pp. 303\u2013309.","DOI":"10.3115\/1220355.1220399"},{"key":"9081_CR3","doi-asserted-by":"crossref","unstructured":"Candito, M.-H. (1996). A principle-based hierarchical representation of LTAGs. In Proceedings of the 16th conference on Computational linguistics (COLING 1996), pp. 194\u2013199, Copenhagen, Denmark.","DOI":"10.3115\/992628.992664"},{"key":"9081_CR4","doi-asserted-by":"crossref","unstructured":"Cohen-Sygal, Y., & Wintner, S. (2006, July). Partially specified signatures: A vehicle for grammar modularity. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING-ACL 2006), Sydney, Australia, pp. 145\u2013152.","DOI":"10.3115\/1220175.1220194"},{"key":"9081_CR5","doi-asserted-by":"crossref","unstructured":"Crabb\u00e9, B. (2005, April). Grammatical development with XMG. In Proceedings of the 5th International Conference on Logical Aspects of Computational Linguistics (LACL), Bordeaux, France.","DOI":"10.1007\/11422532_6"},{"key":"9081_CR6","unstructured":"Crabb\u00e9, B., & Duchier, D. (2004). Metagrammar redux. In Proceedings of the International Workshop on Constraint Solving and Language Processing (CSLP), Copenhagen, Denemark."},{"key":"9081_CR7","unstructured":"Duchier, D., & Gardent, C. (1999). A constraint-based treatment of descriptions. In Third International Workshop on Computational Semantics (IWCS-3)."},{"key":"9081_CR8","doi-asserted-by":"crossref","unstructured":"Duchier, D., & Gardent, C. (2001). Tree descriptions, constraints and incrementality. In H. Bunt, R. Muskens & E. Thijsse (Eds.), Computing meaning, Vol. 2, Volume 77 of studies in linguistics and philosophy (pp. 205\u2013227). Dordrecht: Kluwer Academic Publishers.","DOI":"10.1007\/978-94-010-0572-2_12"},{"key":"9081_CR9","unstructured":"Duchier, D., Le Roux, J., & Parmentier, Y. (2004). The metagrammar compiler: An NLP application with a multi-paradigm architecture. In Proceedings of the Second International Mozart\/Oz Conference (MOZ 2004), Charleroi, Belgium, October."},{"key":"9081_CR10","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/S0022-0000(75)80019-5","volume":"10","author":"A. Joshi","year":"1975","unstructured":"Joshi A., Leon K., Levy S., Masako T. (1975) Tree adjunct grammars. Journal of Computer and System Sciences 10: 136\u2013163","journal-title":"Journal of Computer and System Sciences"},{"key":"9081_CR11","doi-asserted-by":"crossref","unstructured":"Kahane, S. (2006, July). Polarized unification grammars. In Proceedings of the 21st International Conference on Computational Linguistics and 44th Annual Meeting of the Association for Computational Linguistics (COLING-ACL 2006), Sydney, Australia, pp. 137\u2013144.","DOI":"10.3115\/1220175.1220193"},{"key":"9081_CR12","unstructured":"Kahane, S., & Lareau, F. (2005). Meaning-text unification grammar: Modularity and polarization. In Proceedings of the 2nd International Conference on Meaning-Text Theory, pp. 197\u2013206, Moscow."},{"issue":"2","key":"9081_CR13","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1023\/A:1011431526022","volume":"4","author":"L. Kallmeyer","year":"2001","unstructured":"Kallmeyer L. (2001) Local tree description grammars. Grammars 4(2): 85\u2013137","journal-title":"Grammars"},{"key":"9081_CR14","unstructured":"Parmentier, Y., Kallmeyer, L., Lichte, T., & Maier, W. (2007, June). Xmg: Extending metagrammars to mctag. In Actes de l\u2019atelier sur les formalismes syntaxiques de haut niveau, Conference sur le Traitement Automatique des Langues Naturelles, TALN 2007, Toulouse, France."},{"key":"9081_CR15","doi-asserted-by":"crossref","unstructured":"Perrier, G. (2000). Interaction grammars. In Proceedings of the 18th conference on Computational linguistics (COLING 2000), pp. 600\u2013606.","DOI":"10.3115\/992730.992733"},{"key":"9081_CR16","doi-asserted-by":"crossref","unstructured":"Rambow, O., Vijay-Shanker, K., & Weir, D. (1995). D-tree grammars. In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics, Sarrebrucken, pp. 151\u2013158.","DOI":"10.3115\/981658.981679"},{"issue":"4","key":"9081_CR17","first-page":"481","volume":"18","author":"K. Vijay-Shanker","year":"1992","unstructured":"Vijay-Shanker K. (1992) Using descriptions of trees in a tree adjoining grammar. Computational Linguistics 18(4): 481\u2013517","journal-title":"Computational Linguistics"},{"key":"9081_CR18","unstructured":"XTAG Research Group. (2001). A lexicalized tree adjoining grammar for English. Technical Report IRCS-01-03 IRCS, University of Pennsylvania."}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-009-9081-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-009-9081-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-009-9081-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:31:02Z","timestamp":1559255462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-009-9081-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1,23]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["9081"],"URL":"https:\/\/doi.org\/10.1007\/s10849-009-9081-1","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1,23]]}}}