王海东,胡乃全,孔芳,周国栋. 基于树核函数的英文代词消解研究[J]. 中文信息学报, 2009, 23(5): 33-40.
WANG Haidong, HU Naiquan, KONG Fang, ZHOU Guodong. Tree Kernel-Based English Pronoun Coreference Resolution. , 2009, 23(5): 33-40.
Tree Kernel-Based English Pronoun Coreference Resolution
WANG Haidong, HU Naiquan, KONG Fang, ZHOU Guodong
School of Computer Science & Ttechnology, Soochow University, Suzhou, Jiangsu, 215006, China; Jiangsu Key Laboratory of Information Processing Technology, Suzhou, Jiangsu, 215006, China
Abstract:This paper proposes a tree kernel-based approach to anaphora resolution of English pronoun. In our method, the convolution kernel of SVM is first used to obtain structured information, and then such achieved feature of the syntax is combined with other basic features in the literature. A system analysis of the impact of the filtering of training instances and different pruning strategies on the results is conducted. Further examination on the pronoun resolution performances in regard to the sentence distances is also carried out. Evaluation on the ACE2004 NWIRE benchmark corpus shows that tree kernel can improve the performance significantly, especially for the pronoun resolution within a sentence. Key words computer application; Chinese information processing; coreference resolution; structured syntax; tree kernel; pruning strategy
[1] 王厚峰. 指代消解的基本方法和实现技术[J]. 中文信息学报, 2002,16(6): 9-17. [2] Wee. Meng Soon, Hwee Tou Ng and Daniel Chung Yong lim. A machine learning approach to coreference resolution of noun phrase[J].Computational Linguistics, 2001,27(4):521-544. [3] Vincent Ng and Claire Cardie. Improving machine learning approaches to coreference resolution[C]//Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, 2002. [4] J. Hobbs. Resolving pronoun references[J]. Lingua, 1978. 44:339-352 [5] S. Lappin and H. Leass. An algorithm for pronominal anaphora resolution[J]. Computational Linguistics, 1994. 20(4):525-561. [6] D Zelenko, C Aone, A Richardella. Kernel Methods for Relation Extraction[J]. Journal of MachineLearning Research. 2003(2): 1083-1106. [7] M Zhang, J Zhang, J Su, G Zhou. A Composite Kernel to Extract Relations between Entities with both Flat and Structured Features. Sydney[C]//ACL’2006: 825-832. [8] Yang Xiao.Feng., Su J. and Tan C.L. 2006, Kernel-Based Pronoun Resolution with Structured Syntactic Knowledge[C]//ACL’ 2006:41-48, Sydney,July 2006. [9] M Collins, N Duffy.Convolution Kernels for Natural Language [C]//NIPS ,2002. [10] M Collins, N Duffy. New Ranking Algorithm for Parsing and Tagging: Kernel over Discrete Structure, and the Voted Perceptron [C]//Proceeding of ACL,2002. [11] Charniak. A maximum-entropy-inspired paser[C]//Proceedings of North American Chapter of the Association for Computational Linguistics annual meeting, 2000: 132-139. [12] Grosz, A. JoShi, and S. Weinstein. Providing a unified account of definite noun phrases in discourse[C]//Proceedings of the 21st Annual meeting of the Association for Computational Linguistics, 1983: 44-45. [13] Grosz, A. JoShi and S. Weinstein. 1995. Centering: a framework for modeling the local coherence of discourse[J]. Computational Linguistics, 21(2):203-225. [14] Ng, V. (2007). Shallow semantics for coreference resolution[C]//IJCAI 2007: 1689-1694.