Affiliation:
1. Microsoft
2. Microsoft Research
3. Carnegie Mellon University
Abstract
Web search engines can perform poorly for long queries (i.e., those containing four or more terms), in part because of their high level of query specificity. The automatic assignment of labels to long queries can capture aspects of a user’s search intent that may not be apparent from the terms in the query. This affords search result matching or reranking based on queries and labels rather than the query text alone. Query labels can be derived from interaction logs generated from many users’ search result clicks or from
query trails
comprising the chain of URLs visited following query submission. However, since long queries are typically rare, they are difficult to label in this way because little or no historic log data exists for them. A subset of these queries may be amenable to labeling by detecting similarities between parts of a long and rare query and the queries which appear in logs. In this article, we present the comparison of four similarity algorithms for the automatic assignment of Open Directory Project category labels to long and rare queries, based solely on matching against similar satisfied query trails extracted from log data. Our findings show that although the similarity-matching algorithms we investigated have tradeoffs in terms of coverage and accuracy, one algorithm that bases similarity on a popular search result ranking function (effectively regarding potentially-similar queries as “documents”) outperforms the others. We find that it is possible to correctly predict the top label better than one in five times, even when no past query trail exactly matches the long and rare query. We show that these labels can be used to reorder top-ranked search results leading to a significant improvement in retrieval performance over baselines that do not utilize query labeling, but instead rank results using content-matching or click-through logs. The outcomes of our research have implications for search providers attempting to provide users with highly-relevant search results for long queries.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Starting Conversations with Search Engines - Interfaces that Elicit Natural Language Queries;Proceedings of the 2021 Conference on Human Information Interaction and Retrieval;2021-03-14
2. Search Support Tools;Human–Computer Interaction Series;2020
3. Characterizing Searches for Mathematical Concepts;2019 ACM/IEEE Joint Conference on Digital Libraries (JCDL);2019-06
4. Assessing the Quality of Search Process Models;Lecture Notes in Computer Science;2018
5. Characterizing, predicting, and handling web search queries that match very few or no results;Journal of the Association for Information Science and Technology;2017-09-22