首页> 外文会议>International conference on computational linguistics >The Use of Dependency Relation Graph to Enhance the Term Weighting in Question Retrieval
【24h】

The Use of Dependency Relation Graph to Enhance the Term Weighting in Question Retrieval

机译:使用依赖关系图增强问题检索中的术语权重

获取原文

摘要

With the emergence of community-based question answering (cQA) services, question retrieval has become an integral part of information and knowledge acquisition. Though existing information retrieval (IR) technologies have been found to be successful for document retrieval, they are less effective for question retrieval due to the inherent characteristics of questions, which have shorter texts. One of the major common drawbacks for the term weighting-based question retrieval models is that they overlook the relations between term pairs when computing their weights. To tackle this problem, we propose a novel term weighting scheme by incorporating the dependency relation cues between term pairs. Given a question, we first construct a dependency graph and compute the relation strength between each term pairs. Next, based on the dependency relation scores, we refine the initial term weights estimated by conventional term weighting approaches. We demonstrate that the proposed term weighting scheme can be seamlessly integrated with popular question retrieval models. Comprehensive experiments well validate our proposed scheme and show that it achieves promising performance as compared to the state-of-the-art methods.
机译:随着基于社区的问题解答(cQA)服务的出现,问题检索已成为信息和知识获取的组成部分。尽管已经发现现有的信息检索(IR)技术对于文档检索是成功的,但是由于问题的固有特征(文本较短),它们在问题检索方面的效率较低。基于术语加权的问题检索模型的主要常见缺点之一是,它们在计算权重时会忽略术语对之间的关​​系。为了解决这个问题,我们提出了一种新颖的术语加权方案,它通过合并术语对之间的依赖关系提示来实现。给定一个问题,我们首先构造一个依赖图并计算每个术语对之间的关​​系强度。接下来,基于依存关系评分,我们改进了通过常规术语加权方法估算的初始术语权重。我们证明了提出的术语加权方案可以与流行的问题检索模型无缝集成。全面的实验很好地验证了我们提出的方案,并表明与最先进的方法相比,该方案具有令人满意的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号