【24h】

Investigation of Partial Query Proximity in Web Search

机译:Web搜索中部分查询接近度的调查

获取原文

摘要

Proximity of query terms in a document is an important criterion in IR. However, no investigation has been made to determine the most useful term sequences for which proximity should be considered. In this study, we test the effectiveness of using proximity of partial term sequences (n-grams) for Web search. We observe that the proximity of sequences of 3 to 5 terms is most effective for long queries, while shorter or longer sequences appear less useful. This suggests that combinations of 3 to 5 terms can best capture the intention in user queries. In addition, we also experiment with weighing the importance of query sub-sequences using query log frequencies. Our preliminary tests show promising empirical results.
机译:文档中查询词的接近度是IR中的重要标准。但是,尚未进行调查来确定应考虑邻近性的最有用的术语序列。在这项研究中,我们测试了使用部分术语序列(n-gram)的邻近度进行Web搜索的有效性。我们观察到3到5个字词的序列接近度对于长查询最有效,而较短或较长的序列似乎不太有用。这表明3到5个字词的组合可以最好地捕获用户查询中的意图。此外,我们还尝试使用查询日志频率权衡查询子序列的重要性。我们的初步测试显示出令人鼓舞的经验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号