Premium
Subsymbolic Case‐Role Analysis of Sentences with Embedded Clauses
Author(s) -
Miikkulainen Risto
Publication year - 1996
Publication title -
cognitive science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.498
H-Index - 114
eISSN - 1551-6709
pISSN - 0364-0213
DOI - 10.1207/s15516709cog2001_2
Subject(s) - computer science , spec# , sentence , parsing , process (computing) , word (group theory) , contrast (vision) , artificial intelligence , relative clause , sentence processing , natural language processing , artificial neural network , fragment (logic) , programming language , linguistics , philosophy
A distributed neural network model called SPEC for processing sentences with recursive relative clauses is described. The model is based on separating the tasks of segmenting the input word sequence into clauses, forming the case‐role representations, and keeping track of the recursive embeddings into different modules. The system needs to be trained only with the basic sentence constructs, and it generalizes not only to new instances of familiar relative clause structures but to novel structures as well. SPEC exhibits plausible memory degradation as the depth of the center embeddings increases, its memory is primed by earlier constituents, and its performance is aided by semantic constraints between the constituents. The ability to process structure is largely due to a central executive network that monitors and controls the execution of the entire system. This way, in contrast to earlier subsymbolic systems, parsing is modeled as a controlled high‐level process rather than one based on automatic reflex responses.