skip to main content
10.1145/2063576.2063884acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
poster

Automatic query reformulation with syntactic operators to alleviate search difficulty

Authors Info & Claims
Published:24 October 2011Publication History

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.

References

  1. http://www.google.com/support/websearch/bin/answer.py?hl=en&answer=136861Google ScholarGoogle Scholar
  2. http://msdn.microsoft.com/en-us/library/ff795620.aspxGoogle ScholarGoogle Scholar
  3. http://en.wikipedia.org/wiki/Okapi_BM25Google ScholarGoogle Scholar
  4. Steve Cronen-Townsend, Yun Zhou, and W. Bruce Croft. Predicting query performance. In SIGIR '02, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Jiafeng Guo, Gu Xu, Hang Li, and Xueqi Cheng. A unified and discriminative model for query refinement. In SIGIR '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Claudia Hauff, Djoerd Hiemstra, and Franciska de Jong. A survey of pre-retrieval query performance predictors. In CIKM '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Thorsten Joachims. Optimizing search engines using clickthrough data. In KDD '02, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Yves Rasolofo and Jacques Savoy. 2003. Term proximity scoring for keyword-based retrieval systems. In ECIR'03, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Tao Tao and ChengXiang Zhai. An exploration of proximity measures in information retrieval. In SIGIR '07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Ellen M. Voorhees. Overview of the trec 2004 robust retrieval track. In TREC '04, 2004.Google ScholarGoogle Scholar
  11. Xuanhui Wang, Hui Fang, and ChengXiang Zhai. A study of methods for negative relevance feedback. In SIGIR '08, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Xuanhui Wang, Hui Fang, and ChengXiang Zhai. Improve retrieval accuracy for difficult queries using negative feedback. In CIKM '07, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Le Zhao and Jamie Callan. Term necessity prediction. In CIKM '10, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Automatic query reformulation with syntactic operators to alleviate search difficulty

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge management
      October 2011
      2712 pages
      ISBN:9781450307178
      DOI:10.1145/2063576

      Copyright © 2011 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 24 October 2011

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • poster

      Acceptance Rates

      Overall Acceptance Rate1,861of8,427submissions,22%

      Upcoming Conference

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader