Skip to main content
SpringerLink
Log in

A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique

  • Conference paper
  • First Online:
Logical Aspects of Computational Linguistics (LACL 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2099))

  • 501 Accesses

Abstract

The task of designing parsing algorithms for tree adjoining grammars could be simplified by providing a separation between the description of the parsing strategy and the execution of the parser. This can be accomplished through the use of Bottom-up Embedded Push-Down Automata. Towards this aim, we provide a formal and consistent definition of this class of automata and, by removing the finite-state control, we obtain an alternative definition which is adequate to define a tabulation framework for this model of automata and to show the equivalence with respect to other kinds of automata accepting tree adjoining languages.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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.

Similar content being viewed by others

References

  1. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. Automata-based parsing in dynamic programming for Linear Indexed Grammars. In A. S. Narin’yani, editor, Proc. of DIALOGUE’97 Computational Linguistics and its Applications International Workshop, pages 22–27, Moscow, Russia, June 1997.

    Google Scholar 

  2. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. A redefinition of Embedded Push-Down Automata. In Proc. of 5th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+5), pages 19–26, Paris, France, May 2000.

    Google Scholar 

  3. Miguel A. Alonso, Eric de la Clergerie, and Manuel Vilares. A formal definition of Bottom-up Embedded Push-Down Automata and their tabulation technique. In David S. Warren, Manuel Vilares, Leandro Rodríguez Liñares and Miguel A. Alonso (eds.), Proc. of Second International Workshop on Tabulation in Parsing and Deduction (TAPD 2000), pp. 101–112, Vigo, Spain, September 2000.

    Google Scholar 

  4. Miguel A. Alonso, Mark-Jan Nederhof, and Eric de la Clergerie. Tabulation of automata for tree adjoining languages. Grammars 3 (2000) 89–110.

    Article  MATH  MathSciNet  Google Scholar 

  5. Tilman Becker and Dominik Heckmann. Recursive matrix systems (RMS) and TAG. In Proc. of Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), pages 9–12, Philadelphia, PA, USA, August 1998.

    Google Scholar 

  6. Pierre Boullier. A generalization of mildly context-sensitive formalisms. In Proc. of Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4), pages 17–20, Philadelphia, PA, USA, August 1998.

    Google Scholar 

  7. Eric de la Clergerie and Miguel A. Alonso. A tabular interpretation of a class of 2-Stack Automata. In COLING-ACL’98, 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Proceedings of the Conference, volume II, pages 1333–1339, Montreal, Quebec, Canada, August 1998. ACL.

    Google Scholar 

  8. Eric de la Clergerie, Miguel A. Alonso, and David Cabrero. A tabular interpretation of bottom-up automata for TAG. In Proc. of Fourth International Workshop on Tree-Adjoining Grammars and Related Frameworks (TAG+4), pages 42–45, Philadelphia, PA, USA, August 1998.

    Google Scholar 

  9. Eric de la Clergerie and Françcois Barthélemy. Information flow in tabular interpretations for generalized Push-Down Automata. Theoretical Computer Science, 199(1-2):167–198, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  10. Gerald Gazdar. Applicability of indexed grammars to natural languages. In U. Reyle and C. Rohrer, editors, Natural Language Parsing and Linguistic Theories, pages 69–94. D. Reidel Publishing Company, 1987.

    Google Scholar 

  11. John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Series in Computer Science. Addison-Wesley Publishing Company, Reading, Massachussetts, USA, 1979.

    MATH  Google Scholar 

  12. Aravind K. Joshi and Yves Schabes. Tree-adjoining grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages. Vol 3: Beyond Words, chapter 2, pages 69–123. Springer-Verlag, Berlin/Heidelberg/New York, 1997.

    Google Scholar 

  13. Bernard Lang. Towards a uniform formal framework for parsing. In Masaru Tomita, editor, Current Issues in Parsing Technology, pages 153–171. Kluwer Academic Publishers, Norwell, MA, USA, 1991.

    Google Scholar 

  14. Mark-Jan Nederhof. Linear indexed automata and tabulation of TAG parsing. In Proc. of First International Workshop on Tabulation in Parsing and Deduction (TAPD’98), pages 1–9, Paris, France, April 1998.

    Google Scholar 

  15. Mark-Jan Nederhof. Models of tabulation for TAG parsing. In Proc. of the Sixth Meeting on Mathematics of Language (MOL 6), pages 143–158, Orlando, Florida, USA, July 1999.

    Google Scholar 

  16. Gisela Pitsch. LL(k) parsing of coupled-context-free grammars. Computational Intelligence 10 (1994) 563–578.

    Article  Google Scholar 

  17. C. Pollard. Generalized Phrase Structure Grammars, Head Grammars and Natural Language. PhD thesis, Stanford University, 1984.

    Google Scholar 

  18. Owen Rambow. Formal and Computational Aspects of Natural Language Syntax. PhD thesis, University of Pennsylvania, 1994. Available as IRCS Report 94-08 of the Institute of Research in Cognitive Science, University of Pennsylvania.

    Google Scholar 

  19. Yves Schabes and K. Vijay-Shanker. Deterministic left to right parsing of tree adjoining languages. In Proc. of 28th Annual Meeting of the Association for Computational Linguistics, pages 276–283, Pittsburgh, Pennsylvania, USA, June 1990. ACL.

    Chapter  Google Scholar 

  20. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. Principles and implementation of deductive parsing. Journal of Logic Programming 24 (1995) 3–36.

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Steedman. Combinators and grammars. In R. Oehrle, E. Bach, and D Wheeler, editors, Categorial Grammars and Natural Language Structures, pages 417–442. Foris, Dordrecht, 1986.

    Google Scholar 

  22. K. Vijay-Shanker. A Study of Tree Adjoining Grammars. PhD thesis, University of Pennsylvania, January 1988. Available as Technical Report MS-CIS-88-03 LINC LAB 95 of the Department of Computer and Information Science, University of Pennsylvania.

    Google Scholar 

  23. K. Vijay-Shanker and David J. Weir. The equivalence of four extensions of contextfree grammars. Mathematical Systems Theory 27 (1994) 511–545.

    Article  MATH  MathSciNet  Google Scholar 

  24. K. Vijay-Shanker, David J. Weir, and Aravind K. Joshi. On the progression from context-free to tree adjoining languages. In Alexis Manaster-Ramer, editor, Mathematics of Language, pages 389–401. John Benjamins Publishing Company, Amsterdam/Philadelphia, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Computación, Universidad de La Coruña, Campus de Elviña s/n, 15071, La Coruña, Spain

    Miguel A. Alonso

  2. Institut National de Recherche en Informatique et en Automatique, Domaine de Voluceau, Rocquecourt, B.P. 105, 78153, Le Chesnay Cedex, France

    Eric de la Clergerie

Authors
  1. Miguel A. Alonso
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric de la Clergerie
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Manuel Vilares
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. INRIA Lorraine, 615 rue du Jardin Botanique, B.P. 101, 54602, Villers-lès-Nancy Cedex, France

    Philippe de Groote

  2. Universitat Politècnica de Catalunya, Jordi Girona Salgado, 1-3, 08028, Barcelona, Spain

    Glyn Morrill

  3. Faculté des Sciences, Institut de recherche en Informatique de Nantes (IRIN), 2, rue de la Houssinière, B.P. 92208, 44322, Nantes Cedex 03, France

    Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alonso, M.A., de la Clergerie, E., Vilares, M. (2001). A Formal Definition of Bottom-Up Embedded Push-Down Automata and Their Tabulation Technique. In: de Groote, P., Morrill, G., Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 2001. Lecture Notes in Computer Science(), vol 2099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48199-0_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48199-0_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42273-0

  • Online ISBN: 978-3-540-48199-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation