Advertisement

Modular Natural Language Processing Using Declarative Attribute Grammars

  • Rahmatullah Hafiz
  • Richard A. Frost
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7094)

Abstract

A system based on a general top-down parsing algorithm has been developed which allows language processors to be created as executable specifications of arbitrary attribute grammars. Declarative notation of attribute grammars allows modular construction of executable language definitions. Syntax is defined through general context-free grammar rules, and meaning is defined by associated semantic rules with arbitrary dependencies. An innovative technique allows parses to be pruned by arbitrary semantic constraints. This new technique is useful in modelling natural-language phenomena by imposing unification-like restrictions, and accommodating long-distance and cross-serial dependencies, which cannot be handled by context-free rules alone.

Keywords

Top-down parsing Attribute grammars Lazy evaluation Constraint-based Formalism Compositional Semantics 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Hudak, P., Peterson, J., Fasel, J.: A gentle introduction to haskell 98. Technical report (1999)Google Scholar
  2. 2.
    Pereira, F.C.N., Warren, D.: Definite clause grammars for language analysis. Artificial Intelligence 13 (1980)Google Scholar
  3. 3.
    Koster, C.H.A.: Affix grammars for natural languages. In: Attribute Grammars, Applications, and Systems, pp. 469–484 (1991)Google Scholar
  4. 4.
    Billot, S., Lang, B.: The structure of shared forests in ambiguous parsing. In: 27th ACL, BC, Canada, pp. 143–151 (1989)Google Scholar
  5. 5.
    Norvig, P.: Techniques for automatic memoization with applications to context-free parsing. Computational Linguistics, 91–98 (1991)Google Scholar
  6. 6.
    Wadler, P.: Monads for functional programming. In: Jeuring, J., Meijer, E. (eds.) AFP 1995. LNCS, vol. 925, Springer, Heidelberg (1995)CrossRefGoogle Scholar
  7. 7.
    Frost, R., Hafiz, R., Callaghan, P.: Parser combinators for ambiguous left-recursive grammars. In: ACM-PADL, pp. 167–181 (2008)Google Scholar
  8. 8.
    Tomita, M.: Efficient Parsing for Natural Language: A Fast Algorithm for Practical Systems. Kluwer Academic Publishers (1986)Google Scholar
  9. 9.
    Lang, B.: Deterministic techniques for efficient non-deterministic parsers. In: 2nd Colloquium on Automata, Languages and Programming, pp. 255–269 (1974)Google Scholar
  10. 10.
    Frost, R.A., Fortier, R.J.: An Efficient Denotational Semantics for Natural Language Database Queries. In: Kedad, Z., Lammari, N., Métais, E., Meziane, F., Rezgui, Y. (eds.) NLDB 2007. LNCS, vol. 4592, pp. 12–24. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  11. 11.
    Knuth, D.: Semantics of context-free languages. In: Theory of Computing Systems, vol. 2, pp. 127–145. Springer, New York (1968)Google Scholar
  12. 12.
    Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation, and Compiling. Parsing. Prentice Hall (1972)Google Scholar
  13. 13.
    De Moor, O., Backhouse, K., Swierstra, D.: First-class attribute grammars. In: 3rd Workshop on AGs and their Applications (2000)Google Scholar
  14. 14.
    Tienari, M.: On the definition of attribute grammar. In: Jones, N.D. (ed.) Semantics-Directed Compiler Generation. LNCS, vol. 94, Springer, Heidelberg (1980)CrossRefGoogle Scholar
  15. 15.
    Vogt, H.H., Swierstra, S.D., Kuiper, M.F.: Higher order attribute grammars. In: PLDI, pp. 131–145. ACM (1989)Google Scholar
  16. 16.
    Wadler, P.: How to replace failure by a list of successes. In: FP Languages and Computer Architecture, vol. 201, pp. 113–128 (1985)Google Scholar
  17. 17.
    Frost, R., Launchbury, J.: Constructing natural language interpreters in a lazy functional language. The Computer Journal 32(2) (1989)Google Scholar
  18. 18.
    Hafiz, R., Frost, R.A.: Lazy combinators for executable specifications of general attribute grammars. In: ACM-PADL, pp. 167–182 (2010)Google Scholar
  19. 19.
    Shieber, S.: An introduction to unification-based theories of grammar. CSLI Lecture Notes Series. University of Chicago Press (1986)Google Scholar
  20. 20.
    Correa, N.: Attribute and unification grammar: A review and analysis of formalisms. Annals of Mathematics and AI 8, 73–105 (1993)MathSciNetzbMATHGoogle Scholar
  21. 21.
    Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? NL Parsing, Cambridge Uni. (1985)Google Scholar
  22. 22.
    Vijay-Shanker, K., Weir, D.J.: The equivalence of four extensions of context-free grammars. Theory of Computing Systems 27(6), 511–546 (1994)MathSciNetzbMATHGoogle Scholar
  23. 23.
    Kudlek, M., Mart’in-Vide, C., Mateescu, A., MitranaSource, V.: Contexts and the concept of mild context-sensitivity. Linguistics and Philosophy 26(6), 703–725 (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rahmatullah Hafiz
    • 1
  • Richard A. Frost
    • 1
  1. 1.School of Computer ScienceUniversity of WindsorCanada

Personalised recommendations