Natural language processing using a propositional semantic network with structured variables

Minds and Machines 3 (4):421-451 (1993)
  Copy   BIBTEX

Abstract

  We describe a knowledge representation and inference formalism, based on an intensional propositional semantic network, in which variables are structures terms consisting of quantifier, type, and other information. This has three important consequences for natural language processing. First, this leads to an extended, more natural formalism whose use and representations are consistent with the use of variables in natural language in two ways: the structure of representations mirrors the structure of the language and allows re-use phenomena such as pronouns and ellipsis. Second, the formalism allows the specification of description subsumption as a partial ordering on related concepts (variable nodes in a semantic network) that relates more general concepts to more specific instances of that concept, as is done in language. Finally, this structured variable representation simplifies the resolution of some representational difficulties with certain classes of natural language sentences, namely, donkey sentences and sentences involving branching quantifiers. The implementation of this formalism is called ANALOG (A NAtural LOGIC) and its utility for natural language processing tasks is illustrated

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Representation and inference for natural language: a first course in computational semantics.Patrick Blackburn - 2005 - Stanford, Calif.: Center for the Study of Language and Information. Edited by Johannes Bos.
Semantic processing for finite domains.Martha Stone Palmer - 1990 - New York: Cambridge University Press.
Foundations of intensional semantics.Chris Fox - 2005 - Malden MA: Blackwell. Edited by Shalom Lappin.
Computational semantics.Patrick Blackburn & Johan Bos - 2003 - Theoria 18 (1):27-45.
Computational semantics in discourse: Underspecification, resolution, and inference.Johan Bos - 2004 - Journal of Logic, Language and Information 13 (2):139-157.

Analytics

Added to PP
2009-01-28

Downloads
95 (#177,613)

6 months
8 (#342,364)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

Ontological relativity and other essays.Willard Van Orman Quine (ed.) - 1969 - New York: Columbia University Press.
Philosophy of logic.Willard Van Orman Quine - 1970 - Cambridge, Mass.: Harvard University Press. Edited by Simon Blackburn & Keith Simmons.
Reference and generality.P. T. Geach - 1962 - Ithaca, N.Y.,: Cornell University Press. Edited by Michael C. Rea.
Generalized quantifiers and natural language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
The proper treatment of quantification in ordinary English.Richard Montague - 1973 - In Patrick Suppes, Julius Moravcsik & Jaakko Hintikka (eds.), Approaches to Natural Language. Dordrecht. pp. 221--242.

View all 26 references / Add more references