Skip to main content

An Efficient Compositional Semantics for Natural-Language Database Queries with Arbitrarily-Nested Quantification and Negation

  • Conference paper
  • First Online:
Advances in Artificial Intelligence (Canadian AI 2002)

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

Abstract

A novel and efficient implementation of a compositional semantics for a small natural-language query processor has been developed. The approach is based on a set-theoretic version of Montague Semantics in which sets that are constructed as part of denotations of negative constructs are represented by enumerating the members of their complements with respect to the universe of discourse. The semantics accommodates arbitrarily-nested quantifiers and various forms of negation, nouns, transitive and intransitive verbs, conjunction, and disjunction. Queries containing the word “is” and passive verb constructs can be evaluated. However, the approach for these two constructs is ad hoc and inefficient. The approach has been implemented in a syntax-directed evaluator, constructed as an executable specification of an attribute grammar, with a user-independent speech-recognition front-end.

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

Access this chapter

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. Clarke, K. L. (1978) Negation as Failure. In H. Gallaire, and J. Minker, (editors) Logic and Databases. New York: Plenum Press.

    Google Scholar 

  2. Dowty, D. R., Wall, R. E. and Peters, S. (1981) Introduction to Montague Semantics. D. Reidel Publishing Company, Dordrecht, Boston, Lancaster, Tokyo.

    Google Scholar 

  3. Frost, R. A. and Chitte, S. (1999) A new approach for providing natural-language speech access to large knowledge bases. Proceedings of the Pacific Association of Computational Linguistics Conference PACLING’ 99, University of Waterloo, August 1999, 82–89.

    Google Scholar 

  4. Frost, R. A. (1995) W/AGE The Windsor Attribute Grammar Programming Environment, Schloss Dagstuhl International Workshop on Functional Programming in the Real World.

    Google Scholar 

  5. Frost, R. A. and Launchbury, E. J. (1989) Constructing natural language interpreters in a lazy functional language’. The Computer Journal — Special edition on Lazy Functional Programming, 32(2) 108–121.

    Google Scholar 

  6. Iwanska, L. (1992) A General Semantic Model of Negation in Natural Language: Representation and Inference. Doctoral Thesis, Computer Science, University of Illinois at Urbana-Champaign.

    Google Scholar 

  7. Lapalme, G. and Lavier, F. (1990) Using a functional language for parsing and semantic processing. Publication 715a, Departement d’informatique et recherche operationelle, Universite de Montreal.

    Google Scholar 

  8. Montague, R. (1974) in Formal Philosophy: Selected Papers of Richard Montague, edited by R. H. Thomason. Yale University Press, New Haven CT.

    Google Scholar 

  9. Naish, L. (1986) Negation and Control in Prolog. Lecture Notes in Computer Science 238. Springer-Verlag.

    MATH  Google Scholar 

  10. Reiter, R. (1978) Deductive question-answering in relational databases. In H. Gallaire, and J. Minker, (editors) Logic and Databases. New York: Plenum Press.

    Google Scholar 

  11. Stoy, J. E. (1977) Denotational Semantics: The Scott-Strachey Approach to Programming language Theory. MIT Press, Cambridge (Mass.)

    Google Scholar 

  12. Turner, D. (1985) A lazy functional programming language with polymorphic types. Proc. IFIP Int. Conf. on Functional Programming Languages and Computer Architecture, Nancy, France. Springer Lecture Notes 201.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Frost, R., Boulos, P. (2002). An Efficient Compositional Semantics for Natural-Language Database Queries with Arbitrarily-Nested Quantification and Negation. In: Cohen, R., Spencer, B. (eds) Advances in Artificial Intelligence. Canadian AI 2002. Lecture Notes in Computer Science(), vol 2338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47922-8_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-47922-8_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43724-6

  • Online ISBN: 978-3-540-47922-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics