Disjunctive Sets of Phrase Queries for Diverse Query Suggestion

Ziyang Liao, Keishi Tajima
{"title":"Disjunctive Sets of Phrase Queries for Diverse Query Suggestion","authors":"Ziyang Liao, Keishi Tajima","doi":"10.1145/3350546.3352566","DOIUrl":null,"url":null,"abstract":"This paper proposes a method of suggesting expanded queries that disambiguate the original Web query which has multiple interpretations. In order to produce a diverse set of queries including those corresponding to infrequent query intents, our method produces queries by extracting phrases connecting given query terms from a corpus. We use a corpus because infrequent query intents may not appear in query logs. We use phrase queries because we need sufficiently specific queries for retrieving pages corresponding to infrequent query intents out of many pages corresponding to popular query intents. Phrase queries usually have high accuracy but low recall. In order to also achieve high recall, we use a disjunction of many phrase queries as a query. Our method first produces many phrase queries by using term expansion and phrase extraction from a corpus, then group semantically similar phrases into clusters, and use each cluster as a disjunctive set of phrase queries.","PeriodicalId":171168,"journal":{"name":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3350546.3352566","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper proposes a method of suggesting expanded queries that disambiguate the original Web query which has multiple interpretations. In order to produce a diverse set of queries including those corresponding to infrequent query intents, our method produces queries by extracting phrases connecting given query terms from a corpus. We use a corpus because infrequent query intents may not appear in query logs. We use phrase queries because we need sufficiently specific queries for retrieving pages corresponding to infrequent query intents out of many pages corresponding to popular query intents. Phrase queries usually have high accuracy but low recall. In order to also achieve high recall, we use a disjunction of many phrase queries as a query. Our method first produces many phrase queries by using term expansion and phrase extraction from a corpus, then group semantically similar phrases into clusters, and use each cluster as a disjunctive set of phrase queries.
基于不同查询建议的短语查询析取集
本文提出了一种建议扩展查询的方法,该方法消除了具有多种解释的原始Web查询的歧义。为了生成一组不同的查询,包括那些与不常见的查询意图相对应的查询,我们的方法通过从语料库中提取连接给定查询词的短语来生成查询。我们使用语料库是因为不频繁的查询意图可能不会出现在查询日志中。我们使用短语查询是因为我们需要足够具体的查询,以便从与流行查询意图相对应的许多页面中检索与不常见查询意图相对应的页面。短语查询通常准确率高,但召回率低。为了达到高查全率,我们使用许多短语查询的析取作为查询。我们的方法首先通过语料库中的术语展开和短语提取产生许多短语查询,然后将语义相似的短语分组成簇,并使用每个簇作为短语查询的析取集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信