Compiling Declarative Specifications of Parsing Algorithms

  • Carlos Gómez-Rodríguez
  • Jesús Vilares
  • Miguel A. Alonso
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4653)

Abstract

The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamental semantics while abstracting low-level detail. In this work, we present a compilation technique allowing the automatic transformation of parsing schemata to efficient executable implementations of their corresponding algorithms. Our technique is general enough to be able to handle all kinds of schemata for context-free grammars, tree adjoining grammars and other grammatical formalisms, providing an extensibility mechanism which allows the user to define custom notational elements.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Billot, S., Lang, B.: The structure of shared forest in ambiguous parsing. In: Proc. of the 27th Annual Meeting of the Association for Computational Linguistics, Vancouver, British Columbia, Canada, pp. 143–151. ACL (June 1989)Google Scholar
  2. 2.
    Carroll, J.A.: Practical unification-based parsing of natural language. Technical Report no. 314, University of Cambridge, Computer Laboratory, England. PhD Thesis (1993)Google Scholar
  3. 3.
    Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 13(2), 94–102 (1970)MATHCrossRefGoogle Scholar
  4. 4.
    Eisner, J., Goldlust, E., Smith, N.A.: Dyna: A declarative language for implementing dynamic programs. In: Proceedings of ACL 2004 (Companion Volume), Barcelona, pp. 218–221 (July 2004)Google Scholar
  5. 5.
    Gómez-Rodríguez, C., Alonso, M.A., Vilares, M.: On theoretical and practical complexity of TAG parsers. In: Monachesi, P. Penn, G., Satta, G., Wintner, S. (eds.) FG 2006: The 11th conference on Formal Grammar. Malaga, Spain, July 29-30, 2006, ch. 5, pp. 61–75, Center for the Study of Language and Information, Stanford (2006)Google Scholar
  6. 6.
    Gómez-Rodríguez, C., Alonso, M.A., Vilares, M.: Generating XTAG parsers from algebraic specifications. In: Proceedings of the 8th International Workshop on Tree Adjoining Grammar and Related Formalisms. Sydney, July 2006, pp. 103–108, Association for Computational Linguistics, East Stroudsburg (2006)Google Scholar
  7. 7.
    Gómez-Rodríguez, C., Alonso, M.A., Vilares, M.: Generation of indexes for compiling efficient parsers from formal specifications. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) Computer Aided Systems Theory. LNCS, Springer, Heidelberg (2007)Google Scholar
  8. 8.
    Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Beyond Words. ch. 2, vol. 3, pp. 69–123. Springer, Heidelberg (1997)Google Scholar
  9. 9.
    Kasami, T.: An efficient recognition and syntax algorithm for context-free languages. Scientific Report AFCRL-65-758, Air Force Cambridge Research Lab., Bedford, Massachussetts (1965)Google Scholar
  10. 10.
    Rosenkrantz, D.J., Lewis II, P.M.: Deterministic Left Corner parsing. In: Conference Record of 1970 Eleventh Annual Meeting on Switching and Automata Theory, Santa Monica, pp. 139–152. IEEE Computer Society Press, Los Alamitos (1970)CrossRefGoogle Scholar
  11. 11.
    Sampson, G.: The Susanne corpus, Release 3 (1994)Google Scholar
  12. 12.
    Schoorl, J.J., Belder, S.: Computational linguistics at Delft: A status report, Report WTM/TT 90–09 (1990)Google Scholar
  13. 13.
    Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. Journal of Logic Programming 24(1-2), 3–36 (1995)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Sikkel, K.: Parsing Schemata — A Framework for Specification and Analysis of Parsing Algorithms. Springer, Heidelberg (1997)Google Scholar
  15. 15.
    Younger, D.H.: Recognition and parsing of context-free languages in time n3. Information and Control 10(2), 189–208 (1967)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Carlos Gómez-Rodríguez
    • 1
  • Jesús Vilares
    • 1
  • Miguel A. Alonso
    • 1
  1. 1.Departamento de Computación, Universidade da Coruña (Spain), Campus de Elviña, s/n - 15071 A CoruñaSpain)

Personalised recommendations