Applying a logical interpretation of semantic nets and graph grammars to natural language parsing and understanding

Synthese 66 (1):177 - 190 (1986)
  Copy   BIBTEX

Abstract

In this paper a logical interpretation of semantic nets and graph grammars is proposed for modelling natural language understanding and creating language understanding computer systems. An example of parsing a Finnish question by graph grammars and inferring the answer to it by a semantic net representation is provided.

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

Analytics

Added to PP
2009-01-28

Downloads
55 (#284,906)

6 months
6 (#512,819)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

The case for case, dins.Charles J. Fillmore - 1968 - In Emmon Bach & R. Harms (eds.), Universals in Linguistic Theory. Holt, Rinehart, and Winston.
Semantic networks.M. Ross Quillian - 1968 - In Marvin L. Minsky (ed.), Semantic Information Processing. MIT Press.
Extending the expressive power of semantic networks.L. K. Schubert - 1976 - Artificial Intelligence 7 (2):163-198.
Case systems for natural language.Bertram Bruce - 1975 - Artificial Intelligence 6 (4):327-360.

Add more references