A machine learning approach to coreference resolution of noun phrases

被引:421
作者
Soon, WM
Ng, HT
Lim, DCY
机构
[1] DSO Natl Labs, Singapore, Singapore
[2] Natl Univ Singapore, Dept Comp Sci, Sch Comp, Singapore 117548, Singapore
关键词
D O I
10.1162/089120101753342653
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we present a learning approach to coreference resolution of noun phrases in unrestricted text. The approach learns from a small, annotated corpus and the task includes resolving not just a certain type of noun phrase (e. g., pronouns) but rather general noun phrases. It also does not restrict the entity types of the noun phrases; that is, coreference is assigned whether they are of "organization," "person," or other types. We evaluate our approach on common data sets (namely, the MUC-6 and MUC-7 coreference corpora) and obtain encouraging results, indicating that on the general noun phrase coreference task, the learning approach holds promise and achieves accuracy comparable to that of nonlearning approaches. Our system is the first learning-based system that offers performance comparable to that of state-of-the-art nonlearning systems on these data sets.
引用
收藏
页码:521 / 544
页数:24
相关论文
共 21 条
[1]  
Aone Chinatsu, 1995, P 33 ANN M ASS COMP, P122, DOI DOI 10.3115/981658.981675
[2]  
Baldwin B, 1997, P OFTHEACL WORKSHOP, P38
[3]   An algorithm that learns what's in a name [J].
Bikel, DM ;
Schwartz, R ;
Weischedel, RM .
MACHINE LEARNING, 1999, 34 (1-3) :211-231
[4]  
Cardie Claire, 1999, P 1999 JOINT SIGDAT, P82
[5]  
CHINCHOR NA, 1998, P 7 MESS UND C MUC
[6]  
CHURCH K, 1988, P 2 C APPL NAT LANG, P136
[7]  
David Fisher., 1995, P 6 C MESSAGE UNDERS, P127
[8]   Approximate statistical tests for comparing supervised classification learning algorithms [J].
Dietterich, TG .
NEURAL COMPUTATION, 1998, 10 (07) :1895-1923
[9]  
Ge N., 1998, Proceedings of Sixth workshop on very large corpora, P161
[10]  
Kameyama M, 1997, P ACLWORKSHOP OPERAT, P46