Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Robust Query Rewriting using Anchor Data

Nick Craswell, Bodo Billerbeck, Dennis Fetterly, and Marc Najork

Abstract

Query rewriting algorithms can be used as a form of query expansion, by combining the user's original query with automatically generated rewrites. Rewriting algorithms bring linguistic datasets to bear without the need for iterative relevance feedback, but most studies of rewriting have used proprietary datasets such as large-scale search logs. By contrast this paper uses readily available data, particularly ClueWeb09 link text with over 1.2 billion anchor phrases, to generate rewrites. To avoid overfitting, our initial analysis is performed using Million Query Track queries, leading us to identify three algorithms which perform well. We then test the algorithms on Web and newswire data. Results show good properties in terms of robustness and early precision.

Details

Publication typeInproceedings
Published in6th ACM International Conference on Web Search and Data Mining (WSDM)
PublisherACM
> Publications > Robust Query Rewriting using Anchor Data