Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Tree-Adjoining Grammars

  • Chapter
Handbook of Formal Languages

Abstract

In this paper, we will describe a tree generating system called tree-adjoining grammar (TAG) and state some of the recent results about TAGs. The work on TAGs is motivated by linguistic considerations. However, a number of formal results have been established for TAGs, which we believe, would be of interest to researchers in formal languages and automata, including those interested in tree grammars and tree automata.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anne Abeillé, Kathleen M. Bishop, Sharon Cote, and Yves Schabes. 1990. A lexicalized tree adjoining grammar for English. Technical Report MS-CIS-90–24, Department of Computer and Information Science, University of Pennsylvania.

    Google Scholar 

  2. Anne Abeillé. 1988. Parsing french with tree adjoining grammar: some linguistic accounts. In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, August.

    Google Scholar 

  3. N. Chomsky. 1981. Lectures on Government and Binding. Foris, Dordrecht.

    Google Scholar 

  4. Special issue of Computational Intelligence, November 1994, 10(4). Devoted to Tree-Adjoining Grammars.

    Google Scholar 

  5. Jay C. Earley. 1968. An Efficient Context-Free Parsing Algorithm. Ph.D. thesis, Carnegie-Mellon University, Pittsburgh, PA.

    Google Scholar 

  6. G. Gazdar, E. Klein, G. K. Pullum, and I. A. Sag. 1985. Generalized Phrase Structure Grammars. Blackwell Publishing, Oxford. Also published by Harvard University Press, Cambridge, MA.

    Google Scholar 

  7. Maurice Gross. 1984. Lexicon-grammar and the syntactic analysis of french. In Proceedings of the 10th International Conference on Computational Linguistics (COLING’84), Stanford, 2–6 July.

    Google Scholar 

  8. Aravind K. Joshi and Yves Schabes. 1992. Tree-adjoining grammars and lexicalized grammars. In Maurice Nivat and Andreas Podelski (editors), Tree Automata and Languages. Elsevier Science.

    Google Scholar 

  9. Aravind K. Joshi and B. Srinivas. 1994. Disambiguation of super parts of speech (Supertags): almost parsing. In Proceedings of the 17th International Conference on Computational Linguistics (COLING’94), Kyoto, Japan, August.

    Google Scholar 

  10. Aravind K. Joshi, L. S. Levy, and M. Takahashi. 1975. Tree adjunct grammars. Journal of Computer and System Sciences,10(1).

    MathSciNet  Google Scholar 

  11. Aravind K. Joshi, K. Vijay-Shanker, and David Weir. 1991. The convergence of mildly context-sensitive grammatical formalisms. In Peter Sells, Stuart Shieber, and Tom Wasow (editors), Foundational Issues in Natural Language Processing. MIT Press, Cambridge MA.

    Google Scholar 

  12. Aravind K. Joshi. 1985. How much context-sensitivity is necessary for characterizing structural descriptions - Tree Adjoining Grammars. In D. Dowty, L. Karttunen, and A. Zwicky (editors), Natural Language Processing - Theoretical, Computational and Psychological Perspectives. Cambridge University Press, New York. Originally presented in a Workshop on Natural Language Parsing at Ohio State University, Columbus, Ohio, May 1983.

    Google Scholar 

  13. Aravind K. Joshi. 1987. An Introduction to Tree Adjoining Grammars. In A. Manaster-Ramer (editor), Mathematics of Language. John Benjamins, Amsterdam.

    Google Scholar 

  14. R. Kaplan and J. Bresnan. 1983. Lexical-functional grammar: A formal system for grammatical representation. In J. Bresnan (editor), The Mental Representation of Grammatical Relations. MIT Press, Cambridge MA.

    Google Scholar 

  15. Lauri Karttunen. 1986. Radical lexicalism. Technical Report CSLI-86–68, CSLI, Stanford University. Also in Alternative Conceptions of Phrase Structure, University of Chicago Press, Baltin, M. and Kroch A., Chicago, 1989.

    Google Scholar 

  16. T. Kasami. 1965. An efficient recognition and syntax algorithm for context-free languages. Technical Report AF-CRL-65–758, Air Force Cambridge Research Laboratory, Bedford, MA.

    Google Scholar 

  17. Anthony Kroch and Aravind K. Joshi. 1985. Linguistic relevance of tree adjoining grammars. Technical Report MS-CIS-85–18, Department of Computer and Information Science, University of Pennsylvania, April.

    Google Scholar 

  18. Anthony Kroch. 1987. Unbounded dependencies and subjacency in a tree adjoining grammar In A. Manaster-Ramer (editor), Mathematics of Language. John Benjamins, Amsterdam.

    Google Scholar 

  19. Joachim Lambek. 1958. The mathematics of sentence structure. American Mathematical Monthly, 65:154–170.

    Article  MathSciNet  MATH  Google Scholar 

  20. Bernard Lang. 1988. The systematic constructions of Earley parsers: Application to the production of O(n 6) Earley parsers for Tree Adjoining Grammars. Unpublished manuscript, December 30.

    Google Scholar 

  21. ]Alberto Lavelli and Giorgio Satta. 1991. Bidirectional parsing of lexicalized tree adjoining grammars InFifth Conference of the European Chapter of the Association for Computational Linguistics (EACL ‘81), Berlin.

    Google Scholar 

  22. Carl Pollard and Ivan A. Sag. 1987. Information-Based Syntax and Semantics. Vol 1: Fundamentals. CSLI.

    Google Scholar 

  23. Owen Rambow, K. Vijay-Shanker, and David Weir. 1995. D-tree grammars In Proceedings of the 33rd Annual Meeting of the Association for Computational Linguistics (ACL), Cambridge, MA, June, pp 151–158.

    Google Scholar 

  24. Owen Rambow. 1994. Formal and Computational Aspects of Natural Language Syntax. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.

    Google Scholar 

  25. P. Resnick. 1992. Probabilistic tree-adjoining grammars as framework for statistical natural language processing. In Proceedings of the 15th International Conference on Computational Linguistics (COLING’92), Nantes, France, August.

    Google Scholar 

  26. Giorgio Satta. 1994. Tree adjoining grammar parsing and boolean matrix multiplication. Computational Linguistics, 20(2), 173–192.

    MathSciNet  Google Scholar 

  27. Yves Schabes and Aravind K. Joshi. 1988. An Earley-type parsing algorithm for Tree Adjoining Grammars. In 26th Meeting of the Association for Computational Linguistics (ACL’88), Buffalo, June.

    Google Scholar 

  28. Yves Schabes and Aravind K. Joshi. 1989. The relevance of lexicalization to parsing In Proceedings of the International Workshop on Parsing Technologies, Pittsburgh, August. Also appeared under the title Parsing with Lexicalized Tree adjoining Grammar in Current Issues in Parsing Technologies, MIT Press.

    Google Scholar 

  29. Yves Schabes and Stuart Shieber. 1994. An alternative conception of tree-adjoining derivation. Computational Linguistics,20(1), 91–124.

    Google Scholar 

  30. Yves Schabes and K. Vijay-Shanker. 1990. De-terministic left to right parsing of Tree Adjoining Languages. In 28th Meeting of the Association for Computational Linguistics (ACL’90), Pittsburgh.

    Google Scholar 

  31. Yves Schabes and Richard C. Waters. 1995. Tree-Insertion Grammars: A cubic time, parsable formalism that lexicalizes context-free grammars without changing the trees produced. Computational Linguistics, 21(4), pp 479–514.

    MathSciNet  Google Scholar 

  32. Yves Schabes, Anne Abeillé, and Aravind K. Joshi. 1988. Parsing strategies with `lexicalized’ grammars: Application to tree adjoining grammars. In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, Hungary, August.

    Google Scholar 

  33. Yves Schabes. 1990. Mathematical and Computational Aspects of Lexicalized Grammars. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA, August. Available as technical report (MS-CIS-90–48, LINC LAB179) from the Department of Computer Science.

    Google Scholar 

  34. Yves Schabes. 1991. Left to right parsing of tree-adjoining grammars. Computational Intelligence, 10(4), 506–524.

    Article  Google Scholar 

  35. Yves Schabes. 1992. Stochastic tree-adjoining grammars. In Proceedings of the 15th International Conference on Computational Linguistics (COLING’92), Nantes, France, August.

    Google Scholar 

  36. K. M. Schimpf and J. H. Gallier. 1985. Tree pushdown automata. Journal of Computer and System Sciences,30:25–39.

    Article  MathSciNet  MATH  Google Scholar 

  37. Stuart Shieber and Yves Schabes. 1990. Synchronous Tree-Adjoining Grammars. In Proceedings of the 13th International Conference on Computational Linguistics (COLING’90), Helsinki, Finland, August.

    Google Scholar 

  38. Mark Steedman. 1987. Combinatory grammars and parasitic gaps. Natural Language and Linguistic Theory,5:403–439.

    Article  Google Scholar 

  39. J. W. Thatcher. 1971. Characterizing derivations trees of context free grammars through a generalization of finite automata theory. Journal of Computer and System Sciences, 5:365–396.

    Article  MathSciNet  Google Scholar 

  40. K. Vijay-Shanker and Aravind K. Joshi. 1985. Some computational properties of Tree Adjoining Grammars. In 23rd Meeting of the Association for Computational Linguistics, pages 82–93, Chicago, Illinois, July.

    Google Scholar 

  41. K. Vijay-Shanker and Aravind K. Joshi. 1988. Feature structure based tree adjoining grammars In Proceedings of the 12th International Conference on Computational Linguistics (COLING’88), Budapest, August.

    Google Scholar 

  42. K. Vijay-Shanker and David J. Weir. 1990. Parsing constrained grammar formalisms. Computational Linguistics, 19(4), 591–636.

    Google Scholar 

  43. K. Vijay-Shanker. 1987. A Study of Tree Adjoining Grammars. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania.

    Google Scholar 

  44. K. Vijay-Shanker. 1992. Using description of trees in a tree- adjoining grammar. Computational Linguistics, 18(4), pp 481–517.

    Google Scholar 

  45. David J. Weir. 1988. Characterizing Mildly Context-Sensitive Grammar Formalisms. Ph.D. thesis, Department of Computer and Information Science, University of Pennsylvania

    Google Scholar 

  46. XTAG-Group. 1995. A lexicalized tree-adjoining grammar of English. Technical Report, Institute for Research in Cognitive Science (IRCS), University of Pennsylvania, 95–03.

    Google Scholar 

  47. D. H. Younger. 1967. Recognition and parsing of context-free languages in time n 3. Information and Control, 10(2):189–208.

    Article  Google Scholar 

Download references

Authors
  1. Aravind K. Joshi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Schabes
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Leiden University, P.O. Box 9512, NL-2300 RA, Leiden, The Netherlands

    Grzegorz Rozenberg

  2. Turku Centre for Computer Science Data City, FIN-20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Joshi, A.K., Schabes, Y. (1997). Tree-Adjoining Grammars. In: Rozenberg, G., Salomaa, A. (eds) Handbook of Formal Languages. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59126-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-59126-6_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-63859-6

  • Online ISBN: 978-3-642-59126-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation