Affiliation:
1. CNRS, LORIA
2. Université de Lorraine, LORIA
Abstract
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.
Subject
Artificial Intelligence,Computer Science Applications,Linguistics and Language,Language and Linguistics
Reference20 articles.
1. Candito, Marie-Hélène 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–24, Philadelphia, PA.
2. XMG: eXtensible MetaGrammar
3. Integrating a unification-based semantics in a large scale lexicalised tree adjoining grammar for French
4. 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–130, Budapest.
5. 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–114, Paris.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献