Document Type
Technical Report
Publication Date
1989-01-01
Technical Report Number
WUCS-89-31
Abstract
The processing of Natural Language is, at the same time, natural symbolic and naturally symbolic and naturally sub-symbolic. 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 sub-symbolic 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. 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 based on a deterministic grammar and tested with sentences which are grammatically and ones that ill-formed. Tests are also conducted with sentences containing lexically ambiguous items. Some new directions for this work are explored in the final section. The goal of fully connectionistic parsing is discussed and a detail plan for its achievements is present.
Recommended Citation
Kwasny, Stan C. and Faisal, Kanaan A., "Determinism and Connectionism in a Rule-Based Natural Language System" Report Number: WUCS-89-31 (1989). All Computer Science and Engineering Research.
https://openscholarship.wustl.edu/cse_research/744
Comments
Permanent URL: http://dx.doi.org/10.7936/K7V69GXC