arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.08772cs.IR
收藏

克服复杂答案检索的低效用方面

Overcoming low-utility facets for complex answer retrieval

Sean MacAvaney, Andrew Yates, Arman Cohan, Luca Soldaini, Kai Hui, Nazli Goharian, Ophir Frieder

摘要:

许多问题不能简单地回答;他们的答案必须包括许多微妙的细节和额外的背景。复杂答案检索(CAR)是对这些问题的答案的检索。在它们最简单的形式中,这些问题是从主题实体(例如,“奶酪”)和小平面(例如,“健康影响”)。虽然主题匹配已被彻底探讨,我们观察到,一些方面使用一般的语言,不太可能出现在答案逐字。我们称之为低效用面。在这项工作中,我们提出了一种识别和解决低效用方面的CAR方法。我们提出了两个方面的效用估计。这些包括利用CAR查询的层次结构和使用来自训练数据的面频率信息。为了提高低效用标题的检索性能,我们还包括实体相似性分数使用知识图谱嵌入。我们将我们的方法应用于领先的神经排名技术,并使用TREC CAR数据集进行评估。我们发现,我们的方法比未修改的神经排名器和其他领先的CAR技术表现得更好。我们还提供了我们的结果的详细分析,并验证低效用方面确实更难以匹配,我们的方法提高了这些困难的查询的性能。

英文摘要:

Many questions cannot be answered simply; their answers must include numerous nuanced details and additional context. Complex Answer Retrieval (CAR) is the retrieval of answers to such questions. In their simplest form, these questions are constructed from a topic entity (e.g., `cheese') and a facet (e.g., `health effects'). While topic matching has been thoroughly explored, we observe that some facets use general language that is unlikely to appear verbatim in answers. We call these low-utility facets. In this work, we present an approach to CAR that identifies and addresses low-utility facets. We propose two estimators of facet utility. These include exploiting the hierarchical structure of CAR queries and using facet frequency information from training data. To improve the retrieval performance on low-utility headings, we also include entity similarity scores using knowledge graph embeddings. We apply our approaches to a leading neural ranking technique, and evaluate using the TREC CAR dataset. We find that our approach perform significantly better than the unmodified neural ranker and other leading CAR techniques. We also provide a detailed analysis of our results, and verify that low-utility facets are indeed more difficult to match, and that our approach improves the performance for these difficult queries.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑