Unsupervised word sense disambiguation using WordNet relatives

被引:29
作者
Seo, HC
Chung, HJ
Rim, HC
Myaeng, SH
Kim, SH
机构
[1] Korea Univ, Dept Comp Sci & Engn, Seoul 136701, South Korea
[2] Informat & Commun Univ, Taejon 305732, South Korea
[3] Sangmyung Univ, Coll Engn, Dept Comp Software Engn, Cheonan, Chungnam, South Korea
关键词
D O I
10.1016/j.csl.2004.05.004
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes a sense disambiguation method for a polysemous target noun using the context words surrounding the target noun and its WordNet relatives, such as synonyms, hypernyms and hyponyms. The result of sense disambiguation is a relative that can substitute for that target noun in a context. The selection is made based on co-occurrence frequency between candidate relatives and each word in the context. Since the co-occurrence frequency is obtainable from a raw corpus, the method is considered to be an unsupervised learning algorithm and therefore does not require a sense-tagged corpus. In a series of experiments using SemCor and the corpus of SENSEVAL-2 lexical sample task, all in English, and using some Korean data, the proposed method was shown to be very promising. In particular, its performance was superior to that of the other approaches evaluated on the same test corpora. (C) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:253 / 273
页数:21
相关论文
共 15 条
[1]  
AGIRRE E, 1996, P 16 INT C COMP LING, P16
[2]  
Edmonds P., 2001, P SENSEVAL 2 2 INT W, P1
[3]  
Fellbaum C, 1998, WORDNET ELECT LEXICA
[4]  
Fernandez-Amoros D., 2001, P SENSEVAL 2 2 INT W, P75
[5]  
FERNANDEZAMOROS D, 2001, P 6 INT WORKSH APPL, P87
[6]  
HAYNES S, 2001, P SENSEVAL 2 2 INT W, P79
[7]  
Karov Y, 1998, COMPUT LINGUIST, V24, P41
[8]  
Kilgarriff A., 2001, P 2 INT WORKSH EV WO, P17
[9]  
Leach S, 1998, LOCAL GOV STUD, V24, P1
[10]  
LITKOWSKI K, 2001, P SENSEVAL 2 2 INT W, P107