Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (24): 141-145.DOI: 10.3778/j.issn.1002-8331.2010.24.043

• 数据库、信号与信息处理 • Previous Articles     Next Articles

Research on tree kernel for Chinese pronominal coreference resolution

TAN Wei-xuan1,2,KONG Fang1,2,WANG Hai-dong1,2,ZHOU Guo-dong1,2   

  1. 1.School of Computer Science & Technology,Soochow University,Suzhou,Jiangsu 215006,China
    2.Jiangsu Key Laboratory of Information Processing Technology,Suzhou,Jiangsu 215006,China
  • Received:2009-02-16 Revised:2009-04-10 Online:2010-08-21 Published:2010-08-21
  • Contact: TAN Wei-xuan

使用树核函数进行中文代词消解的研究

谭魏璇1,2,孔 芳1,2,王海东1,2,周国栋1,2   

  1. 1.苏州大学 计算机科学与技术学院,江苏 苏州 215006
    2.江苏省计算机信息处理技术重点实验室,江苏 苏州 215006
  • 通讯作者: 谭魏璇

Abstract: Coreference resolution plays an important role in natural language processing.Research on tree kernel function in recent years has put forward new means for coreference resolution.This paper proposes a tree kernel-based approach to anaphora resolution of pronoun in Chinese.Convolve kernel of SVM is used to obtain structured information.Then this paper combines syntax tree as a feature with other base features.Evaluation on the ACE2005 NWIRE shows that tree kernel can much improve the performance,especially achieving F-measure of 75.8%.

Key words: coreference resolution, structured syntax, tree kernel, pruning strategy

摘要: 指代消解是自然语言处理中语篇理解的关键问题之一。近年来对于树核函数的研究为指代消解提出了新的思路。基于树核函数,提出了一种新的中文代词的消解方法。将句法树作为一个特征,使用SVM提供的树核函数自动获取句法信息。在ACE2005 NWIRE基准数据上进行实验的结果表明树核对中文代词的消解能起到显著的作用,其中F值达到了75.8%。

关键词: 指代消解, 句法结构, 树核函数, 修剪策略

CLC Number: