ABSTRACT
Modern search engines usually provide a query language with a set of advanced syntactic operators (e.g., plus sign to require a term's appearance, or quotation marks to require a phrase's appearance) which if used appropriately, can significantly improve the effectiveness of a plain keyword query. However, they are rarely used by ordinary users due to the intrinsic difficulties and users' lack of corpora statistics. In this paper, we propose to automatically reformulate queries that do not work well by selectively adding syntactic operators. Particularly, we propose to perform syntactic operator-based query reformulation when a retrieval system detects users encounter difficulty in search as indicated by users' behaviors such as scanning over top k documents without click-through. We frame the problem of automatic reformulation with syntactic operators as a supervised learning problem, and propose a set of effective features to represent queries with syntactic operators. Experiment results verify the effectiveness of the proposed method and its applicability as a query suggestion mechanism for search engines. As a negative feedback strategy, syntactic operator-based query reformulation also shows promising results in improving search results for difficult queries as compared with existing methods.
- http://www.google.com/support/websearch/bin/answer.py?hl=en&answer=136861Google Scholar
- http://msdn.microsoft.com/en-us/library/ff795620.aspxGoogle Scholar
- http://en.wikipedia.org/wiki/Okapi_BM25Google Scholar
- Steve Cronen-Townsend, Yun Zhou, and W. Bruce Croft. Predicting query performance. In SIGIR '02, 2002. Google ScholarDigital Library
- Jiafeng Guo, Gu Xu, Hang Li, and Xueqi Cheng. A unified and discriminative model for query refinement. In SIGIR '08, 2008. Google ScholarDigital Library
- Claudia Hauff, Djoerd Hiemstra, and Franciska de Jong. A survey of pre-retrieval query performance predictors. In CIKM '08, 2008. Google ScholarDigital Library
- Thorsten Joachims. Optimizing search engines using clickthrough data. In KDD '02, 2002. Google ScholarDigital Library
- Yves Rasolofo and Jacques Savoy. 2003. Term proximity scoring for keyword-based retrieval systems. In ECIR'03, 2003. Google ScholarDigital Library
- Tao Tao and ChengXiang Zhai. An exploration of proximity measures in information retrieval. In SIGIR '07, 2007. Google ScholarDigital Library
- Ellen M. Voorhees. Overview of the trec 2004 robust retrieval track. In TREC '04, 2004.Google Scholar
- Xuanhui Wang, Hui Fang, and ChengXiang Zhai. A study of methods for negative relevance feedback. In SIGIR '08, 2008. Google ScholarDigital Library
- Xuanhui Wang, Hui Fang, and ChengXiang Zhai. Improve retrieval accuracy for difficult queries using negative feedback. In CIKM '07, 2007. Google ScholarDigital Library
- Le Zhao and Jamie Callan. Term necessity prediction. In CIKM '10, 2010. Google ScholarDigital Library
Index Terms
- Automatic query reformulation with syntactic operators to alleviate search difficulty
Recommendations
Location-aware query reformulation for search engines
Query reformulation, including query recommendation and query auto-completion, is a popular add-on feature of search engines, which provide related and helpful reformulations of a keyword query. Due to the dropping prices of smartphones and the ...
Analyzing and evaluating query reformulation strategies in web search logs
CIKM '09: Proceedings of the 18th ACM conference on Information and knowledge managementUsers frequently modify a previous search query in hope of retrieving better results. These modifications are called query reformulations or query refinements. Existing research has studied how web search engines can propose reformulations, but has ...
Investigating Query Reformulation Behavior of Search Users
Information RetrievalAbstractSearch engine users usually strive to reformulate their queries in the search process to gain useful information. It is hard for search engines to understand users’ search intents and return appropriate results if they submit improper or ambiguous ...
Comments