A new method for selecting English field association terms of compound words and its knowledge representation

被引:31
作者
Atlam, E [1 ]
Morita, K [1 ]
Fuketa, M [1 ]
Aoe, J [1 ]
机构
[1] Univ Tokushima, Dept Informat Sci & Intelligent Syst, Tokushima 7708506, Japan
关键词
compound terms; field association term; semantic classification; redundant candidates;
D O I
10.1016/S0306-4573(01)00062-0
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a strategy for building a morphological machine dictionary of English that infers meaning of derivations by considering morphological affixes and their semantic classification. Derivations are grouped into a frame that is accessible to semantic stem and knowledge base. This paper also proposes an efficient method for selecting compound Field Association (FA) terms from a large pool of single FA terms for some specialized fields. For single FA terms, five levels of association are defined and two ranks are defined, based on stability and inheritance. About 85% of redundant compound FA terms can be removed effectively by using levels and ranks proposed in this paper. Recall averages of 60-80% are achieved, depending on the type of text. The proposed methods are applied to 22,000 relationships between verbs and nouns extracted from the large tagged corpus. (C) 2002 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:807 / 821
页数:15
相关论文
共 27 条
[1]  
[Anonymous], COMPUTER INTERPRETAT
[2]  
Aoe J., 1989, T IPSJ, V39, P2563
[3]  
AOE J, 1987, P 2 INT C SUP SANT C, P361
[4]  
AOE J, 1989, P INT JOINT C ART IN, P1
[5]  
AOE J, 1988, P IEEE 12 COMP SOFTW, P463
[6]  
*BARTL COMP, 1996, AM HER BOOK ENGL US
[7]  
Breiman L., 1984, BIOMETRICS, DOI DOI 10.2307/2530946
[8]  
CARBONELL JG, 1981, IEEE T PAMI 3, V4, P376
[9]  
Cohen R., 1987, Computational Linguistics, V13, P11
[10]  
DOZAWA T, 1999, INNOVATIVE MULTIINFO