KFUPM ePrints

Connectionism and Determinism in a Syntactic Parser

Faisal, Kanaan A (1990) Connectionism and Determinism in a Syntactic Parser. Connection Science: Journal of Neural Computing, Artificial Intelligence, and Cognitive Research: Special Issue on Connectionist Research on Natural Language,, 2 (1 & 2). pp. 63-82.

Full text not available from this repository.

Abstract

The processing of natural language is, at the same time, naturally symbolic and naturally subsymbolic. It is symbolic because ultimately symbols play a critical role. Writing systems, for example, owe their existence to the symbolic nature of language. It is also subsymbolic because of the nature of speech, the fuzziness of concepts, and the high degree of parallelism that is difficult to explain as a purely symbolic phenomenon. Building a processor of natural language, therefore, requires a hybrid approach. This report details a set of experiments which support the claim that natural language can be syntactically processed in a robust manner using a connectionist deterministic parser. The model is trained from patterns derived from a deterministic grammar and tested with grammatical, ungrammatical and lexically ambiguous sentences.



Item Type:Article
Date:1990
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Information and Computer Science Dept
Creators:Faisal, Kanaan A
Email:kanaan@kfupm.edu.sa
ID Code:10658
Deposited By:KANAAN ABED FAISAL
Deposited On:25 Jun 2008 14:59
Last Modified:12 Apr 2011 13:15

Repository Staff Only: item control page