期刊文献+

Learning Noun Phrase Anaphoricity in Coreference Resolution via Label Propagation

Learning Noun Phrase Anaphoricity in Coreference Resolution via Label Propagation
原文传递
导出
摘要 Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreferenee resolution systems have been far from expectation. This paper proposes a global learning method in determining the anaphoricity of noun phrases via a label propagation algorithm to improve learning-based coreference resolution. In order to eliminate the huge computational burden in the label propagation algorithm, we employ the weighted support vectors as the critical instances in the training texts. In addition, two kinds of kernels, i.e instances to represent all the anaphoricity-labeled NP , the feature-based RBF (Radial Basis Function) kernel and the convolution tree kernel with approximate matching, are explored to compute the anaphoricity similarity between two noun phrases. Experiments on the ACE2003 corpus demonstrate the great effectiveness of our method in anaphoricity determination of noun phrases and its application in learning-based coreference resolution. Knowledge of noun phrase anaphoricity might be profitably exploited in coreference resolution to bypass the resolution of non-anaphoric noun phrases. However, it is surprising to notice that recent attempts to incorporate automatically acquired anaphoricity information into coreferenee resolution systems have been far from expectation. This paper proposes a global learning method in determining the anaphoricity of noun phrases via a label propagation algorithm to improve learning-based coreference resolution. In order to eliminate the huge computational burden in the label propagation algorithm, we employ the weighted support vectors as the critical instances in the training texts. In addition, two kinds of kernels, i.e instances to represent all the anaphoricity-labeled NP , the feature-based RBF (Radial Basis Function) kernel and the convolution tree kernel with approximate matching, are explored to compute the anaphoricity similarity between two noun phrases. Experiments on the ACE2003 corpus demonstrate the great effectiveness of our method in anaphoricity determination of noun phrases and its application in learning-based coreference resolution.
作者 周国栋 孔芳
机构地区 NLP Lab
出处 《Journal of Computer Science & Technology》 SCIE EI CSCD 2011年第1期34-44,共11页 计算机科学技术学报(英文版)
基金 Supported by the National Natural Science Foundation of China under Grant Nos.60873150,90920004 and 61003153
关键词 coreference resolution anaphoricity determination label propagation RBF kernel convolution tree kernel coreference resolution, anaphoricity determination, label propagation, RBF kernel, convolution tree kernel
  • 相关文献

参考文献31

  • 1Soon W M, Ng H T, Lim D. A machine learning approach to coreference resolution of noun phrase. Computational Linguistics, 2001, 27(4): 521-544.
  • 2Ng V. Cardie C. Improving machine learning approaches to coreference resolution. In Proc. A CL 2002, Philadelphia, USA, Jul. 6-12, 2002, pp.104-111.
  • 3Strube M, Muller C. A machine learning approach to pronoun resolution in spoken dialogue. In Proc. ACL 2003, Sapporo, Japan, Jul. 7-12, 2003, pp.68-175.
  • 4Yang X F, Zhou G D, Su J, Chew C L. Corefcrence resolution using competition learning approach. In Proc. ACL 2003, Sapporo, Japan, Jul. 7-12, 2003, pp.177-184.
  • 5Yang X F, Su J, Lang J, Tan C L, Liu T, Li S. An entitymention model for coreference resolution with inductive logic programming. In Proc. ACL 2008, Columbus, USA, Jun. 15- 20, 2008, pp.843-851.
  • 6Paice C D, Husk G D. Towards the automatic recognition of anaphoric features i,1 English text: The impersonal pronoun it. Computer Speech and Language, 1987, 2(2): 109-132.
  • 7Lappin S, Leass H J. An algorithm for pronominal anaphora resolution. Computational Linguistics, 1994, 2(](4): 535-561.
  • 8Kennedy C, Boguraev B. Anaphora for everyone: Pronominal anaphora resolution without a parser. In Proc. COL- ING1996, Copenhagen, Denmark, Aug. 5-9, 1996, pp.113- 118.
  • 9Denber M. Automatic resolution of anaphora in English. Technical Report, Eastman Kodak Co. 1998.
  • 10Vieira R, Poesio M. An empirically based system for processing definite descriptions. Computational Linguistics, 2000, 27(4): 539-592.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部