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

Synthese 66 (1):177 - 190 (1986)
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.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1007/BF00413586
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,974
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Charles J. Fillmore (1968). The Case for Case, Dins. In Emmon Bach & R. Harms (eds.), Universals in Linguistic Theory. Holt, Rinehart, and Winston

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

17 ( #157,328 of 1,725,806 )

Recent downloads (6 months)

8 ( #81,086 of 1,725,806 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.