首页> 外文会议>Conference of the European Chapter of the Association for Computational Linguistics >Encoding Semantic Resources in Syntactic Structures for Passage Reranking
【24h】

Encoding Semantic Resources in Syntactic Structures for Passage Reranking

机译:在句法结构中编码语义资源进行reranking

获取原文

摘要

In this paper, we propose to use semantic knowledge from Wikipedia and large-scale structured knowledge datasets available as Linked Open Data (LOD) for the answer passage reranking task. We represent question and candidate answer passages with pairs of shallow syntactic/semantic trees, whose constituents are connected using LOD. The trees are processed by SVMs and tree kernels, which can automatically exploit tree fragments. The experiments with our SVM rank algorithm on the TREC Question Answering (QA) corpus show that the added relational information highly improves over the state of the art, e.g., about 15.4% of relative improvement in P@1.
机译:在本文中,我们建议使用维基百科和大规模结构化知识数据集的语义知识,作为答案通道重新登记任务的链接开放数据(LOD)。 我们代表问题和候选答案段落,配对浅句法/语义树,其成分使用LOD连接。 树木由SVM和树内核处理,可以自动利用树片段。 在TREC问题应答(QA)语料库上的SVM等级算法的实验表明,增加的关系信息高度提高了本领域,例如,P @ 1的相对改善的约15.4%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号