首页> 外文会议>Text Analysis Conference >THU QUANTA at TAC 2009 KBP and RTE Track
【24h】

THU QUANTA at TAC 2009 KBP and RTE Track

机译:THU Quanta在TAC 2009 KBP和RTE轨道

获取原文

摘要

This paper describes the systems of THU QUANTA in Text Analysis Conference (TAC) 2009. We participated in the Knowledge Base Population (KBP) track, and the Recognizing Textual Entailment (RTE) track. For the KBP track, we investigate two ranking strategies for Entity Linking task. We employ a Listwise "Learning to Rank" model and Augmenting Naive Bayes model to rank the candidate. We try to use learned patterns to solve the Slot Filling task. For the RTE track, we propose an interesting method, SEGraph (Semantic Elements based Graph). This method divides the Hypothesis and Text into two types of semantic elements: Entity Semantic Element and Relation Semantic Element. The SEGraph is then constructed, with Entity Elements as nodes, and Relation Elements as edges for both Text and Hypothesis. Finally we recognize the textual entailment based on the SEGraph of Text and SEGraph of Hypothesis. The evaluation results show that our proposed two frameworks are very effective for KBP and RTE tasks, respectively.
机译:本文介绍了文本分析大会(TAC)2009中的THU Quanta系统。我们参与了知识库人口(KBP)轨道,识别文本征集(RTE)轨道。对于KBP曲目,我们调查了实体链接任务的两个排名策略。我们聘请了一个乐于“学习”的模型,并增强天真贝叶斯模型来对候选人进行排名。我们尝试使用学习的模式来解决插槽填充任务。对于RTE轨道,我们提出了一种有趣的方法,Segraph(基于语义元素的图形)。此方法将假设和文本划分为两种类型的语义元素:实体语义元素和关系语义元素。然后将Segraph与实体元素作为节点构造,以及作为文本和假设的边缘的关系元素。最后,我们认识到基于文本的文本和假设的Segraph的文本意见。评估结果表明,我们提出的两个框架分别对KBP和RTE任务非常有效。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号