Connectionist natural language parsing

被引:12
作者
Palmer-Brown, D
Tepper, JA
Powell, HM
机构
[1] Leeds Metropolitan Univ, Sch Comp, Computat Intelligence Res Grp, Leeds LS6 3QS, W Yorkshire, England
[2] Nottingham Trent Univ, Dept Comp & Math, Nottingham NG1 4BU, England
关键词
D O I
10.1016/S1364-6613(02)01980-0
中图分类号
B84 [心理学]; C [社会科学总论]; Q98 [人类学];
学科分类号
03 ; 0303 ; 030303 ; 04 ; 0402 ;
摘要
The key developments of two decades of connectionist parsing are reviewed. Connectionist parsers are assessed according to their ability to learn to represent syntactic structures from examples automatically, without being presented with symbolic grammar rules. This review also considers the extent to which connectionist parsers offer computational models of human sentence processing and provide plausible accounts of psycholinguistic data. In considering these issues, special attention is paid to the level of realism, the nature of the modularity, and the type of processing that is to be found in a wide range of parsers.
引用
收藏
页码:437 / 442
页数:6
相关论文
共 53 条
[1]  
[Anonymous], FDN ISSUES NATURAL L
[2]  
[Anonymous], P 7 ANN COGN SCI SOC
[3]  
BERG G, 1992, AAAI-92 PROCEEDINGS : TENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE, P32
[4]  
Callan R. E., 1997, Connection Science, V9, P139, DOI 10.1080/095400997116667
[5]  
Chomsky N., 1981, Lectures on Government and Binding: the Pisan Lectures, DOI DOI 10.1515/9783110884166
[6]  
Christiansen MH, 1999, COGNITIVE SCI, V23, P417, DOI 10.1207/s15516709cog2304_2
[7]   Toward a connectionist model of recursion in human linguistic performance [J].
Christiansen, MH ;
Chater, N .
COGNITIVE SCIENCE, 1999, 23 (02) :157-205
[8]   Finite State Automata and Simple Recurrent Networks [J].
Cleeremans, Axel ;
Servan-Schreiber, David ;
McClelland, James L. .
NEURAL COMPUTATION, 1989, 1 (03) :372-381
[9]  
Cottrell G. W, 1985, P 7 ANN C COGN SCI S, P201
[10]  
COTTRELL GW, 1983, COGNITION BRAIN THEO, V6, P89