Hybrid thematic role processor - Symbolic linguistic relations revised by connectionist learning

被引:0
作者
Rosa, JLG [1 ]
Francozo, E [1 ]
机构
[1] PUC Campinas, Inst Informat, BR-13020904 Campinas, SP, Brazil
来源
IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2 | 1999年
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In linguistics, the semantic relations between words in a sentence are accounted for, inter alia, as the assignment of thematic roles, e.g. AGENT, INSTRUMENT, etc. As in predicate logic, simple linguistic expressions are decomposed into one predicate (often the verb) and its arguments. The predicate assigns thematic roles to the arguments, so that each sentence has a thematic grid, a structure with all thematic roles assigned by the predicate. In order to reveal the thematic grid of a sentence, a system called HTRP (Hybrid Thematic Role Processor) is proposed, in which the connectionist architecture has, as input, a featural representation of the words of a sentence, and, as output, its thematic grid. Both a random initial weight version (RIW) and a biased initial weight version (BIW) are proposed to account for systems without and with initial knowledge, respectively. In BIW, initial connection weights reflect symbolic rules for thematic roles. For both versions, after supervised training, a set of final symbolic rules is extracted, which is consistently correlated to linguistic symbolic - knowledge. In the case of BIW, this amounts to a revision of the initial rules. In RIW, symbolic rules seem to be induced from the connectionist architecture and training.
引用
收藏
页码:852 / 857
页数:6
相关论文
共 21 条
[1]   Symbolic connectionism in natural language disambiguation [J].
Chan, SWK ;
Franklin, J .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1998, 9 (05) :739-755
[2]  
DOWTY D, 1989, PROPERTIES TYPES MEA
[3]   CONNECTIONISM AND COGNITIVE ARCHITECTURE - A CRITICAL ANALYSIS [J].
FODOR, JA ;
PYLYSHYN, ZW .
COGNITION, 1988, 28 (1-2) :3-71
[4]  
FRANCHI C, 1998, THEMATIC HIERARCHY
[5]   KNOWLEDGE-BASED CONNECTIONISM FOR REVISING DOMAIN THEORIES [J].
FU, LM .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1993, 23 (01) :173-182
[6]  
Haegeman Liliane, 1991, INTRO GOVT BINDING T
[7]   Parsing Complex Sentences with Structured Connectionist Networks [J].
Jain, Ajay N. .
NEURAL COMPUTATION, 1991, 3 (01) :110-120
[8]  
LAWRENCE S, 1999, IN PRESS IEEE T KNOW
[9]  
McClelland J.L., 1986, PARALLEL DISTRIBUTED
[10]  
MCCLELLAND JL, 1989, LANG COGNITIVE PROC, V4, P287