Tree-Adjoining Grammars: Theory and implementation
Area: Language and Computation (LaCo)
Level: Introductory
Lecturers: Kata Balogh and Simon Petitjean
Abstract: This course provides an introduction into the Tree-Adjoining Grammar (TAG) formalism, in particular Lexicalized Tree-Adjoining Grammar (LTAG), together with grammar implementations and tools for parsing with TAG: XMG and TuLiPA. During the course we will show the importance of TAG and related formalisms in computational linguistics, providing syntactic and semantic analyses of different linguistic phenomena, as well as introducing implementations that show the adequacy of the formalism for natural language analysis.
Course Material:
Day 3, part 1: slides and handout
Day 3, part 2: slides
Day 4: slides
Day 5: slides - metagrammar - metagrammar at the end of the session - other possible metagrammar
Bibliography:
Abeillé, Anne and Owen Rambow. 2000. Tree adjoining grammar: An overview. In A. Abeillé and O. Rambow (eds). Tree adjoining grammars: Formalisms, linguistic analyses and processing Vol. 107 CSLI Lecture Notes. Stanford: CSLI Publications. 1–68.
Bod, Rens. 2009. From exemplar to grammar: A probabilistic analogy-based model of language learning. Cognitive Science 33(5). 752–793.
Chomsky, Noam. 1956. Three models for the description of language. IRE Transactions on Information Theory 2. 113–124.
Chomsky, Noam. 1957. Syntactic structures. Den Haag: Mouton.
Chomsky, Noam and Marcel-Paul Schützenberger. 1963. The algebraic theory of context-free languages. In Braffort, P. and D. Hirschberg (eds). Computer programming and formal systems (Studies in Logic and the Foundations of Mathematics 35). Amsterdam: North-Holland Publishing Company. 118–161.
Dowty, David R. 1979. Word meaning and Montague Grammar. The Semantics of Verbs and Times in Generative Semantics and in Montague’s PTQ. Dordrecht: D. Reidel Publishing Company.
Frank, Robert. 2002. Phrase structure composition and syntactic dependencies. Cambridge: MIT Press.
Greibach, Sheila A. 1965. A New Normal-Form Theorem for Context-Free Phrase Structure Grammars. Journal of the ACM. 12(1). 42–52.
Joshi, Aravind K. 1985. Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions. In Dowty, D., L. Karttunen and A. Zwicky (eds). Natural language parsing. Cambridge University Press. 206–250.
Joshi, Aravind K. 2004. Starting with complex primitives pays off: complicate locally, simplify globally. Cognitive Science 28. 637–668.
Joshi, Aravind K. and Yves Schabes. 1991. Tree-Adjoining Grammars and lexicalized grammars. Tech. Rep. MS-CIS-91-22 Department of Computer and Information Science. University of Pennsylvania.
Joshi, Aravind K. and Yves Schabes. 1997. Tree-Adjoining Grammars. In Rozenberg, G. and A. Salomaa (eds). Handbook of formal languages Vol. 3. Berlin, New York: Springer. 69–124.
Kallmeyer, Laura. 2010. Parsing beyond Context-Free Grammars. Berlin: Springer.
Post, Matt and Daniel Gildea. 2009. Bayesian learning of a tree substitution grammar. In Proceedings of the ACL-IJCNLP 2009 Conference. Short Papers. Suntec: Singapore. ACL. 45–48.
Prolo, Carlos A. 2002. Generating the XTAG english grammar using metarules. In Coling 2002: The 19th international conference on computational linguistics.
Schabes, Yves. 1990. Mathematical and computational aspects of lexicalized grammars. PhD thesis: University of Pennsylvania.
Schabes, Yves and Aravind K. Joshi. 1990. Parsing with lexicalized tree adjoining grammar. Tech. Rep. MS-CIS-90-11 Department of Computer and Information Science. University of Pennsylvania.
Shieber, Stuart. 1985. Evidence against the context-freeness of natural language. Linguistics and Philosophy 8. 333–343.
Vijay-Shanker, K. and Aravind K. Joshi. 1988. Feature Structures Based Tree Adjoining Grammars. In COLING Budapest 1988 , Volume 2: International Conference on Computational Linguistics.
XTAG Research Group. 2001. A Lexicalized Tree Adjoining Grammar for English. Tech. rep. Institute for Research in Cognitive Science. University of Pennsylvania.