Replicating Quantified Noun Phrases in Database Semantics

  • Roland Hausser
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2553)

Abstract

Predicate calculus treats determiner-noun sequences like the man, every man, or several men as ‘quantified noun phrases.’ This analysis in terms of quantifiers, variables, and connectives creates a major structural difference compared to the handling of proper names. The modeling of natural language communication in database semantic (DBS), in contrast, treats the functor-argument structure as primary, regardless of whether an argument is of the sign type symbol (determiner-noun sequence), name, or indexical (pronoun). The meanings carried by different determiners are reanalyzed as controlling the matching between nominal symbols and individuals, or sets of individuals, at the level of context

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bochenski, I. (1961) A History of Formal Logic, University of Notre Dame Press.Google Scholar
  2. Davidson, D. & J. Hintikka (eds.) (1969) Words and Objections, Essays on the Work ofW. V.Quine, Reidel, Dordrecht.Google Scholar
  3. Geach, P. T. (1969) “Quine’s Syntactical Insights,” in Davidson & Hintikka (eds.).Google Scholar
  4. Hausser, R. (1999/2001) Foundations of Computational Linguistics, Human-Computer Communication in Natural Language, Berlin, New York: Springer-Vcrlag.Google Scholar
  5. Hausser, R. (2001) “Database Semantics for Natural Language,” Artificial Intelligence, Vol. 130.1:27–74, Eisevier, Dordrecht.CrossRefGoogle Scholar
  6. Hausser, R. (2002a) “A Hypothesis on the Origin of the Sign Types,” in A. Gelbukh (ed.) Computational Linguistics and Intelligent Text Processing, Lecture Notes in Computer Science, Berlin-New York: Springer-Verlag.Google Scholar
  7. Hausser, R. (2002b) “Reconstructing Propositional Calculus in Database Semantics,” to appear.Google Scholar
  8. Hopcroft, J. E. & Ullman, J. D. (1979) Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass.MATHGoogle Scholar
  9. Kamp, J. A. W. & U. Reyle (1993) From Discourse to Logic, Kluwer, Dordrecht.Google Scholar
  10. Montague, R. (1974) Formal Philosophy, Yale U. Press, New Haven.Google Scholar
  11. Russell, B. (1905) “On Denoting,” Mind 14:479–493.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Roland Hausser
    • 1
  1. 1.Universität Erlangen-Nürnberg Abteilung Computerlinguistik (CLUE)Germany

Personalised recommendations