%0 Conference Paper %1 jones2006generating %A Jones, Rosie %A Rey, Benjamin %A Madani, Omid %A Greiner, Wiley %B WWW '06: Proceedings of the 15th international conference on World Wide Web %C New York, NY, USA %D 2006 %E Carr, Les %E Roure, David De %E Iyengar, Arun %E Goble, Carole A. %E Dahlin, Michael %I ACM %K expansion query refinement substitute %P 387--396 %R 10.1145/1135777.1135835 %T Generating query substitutions %U http://dx.doi.org/10.1145/1135777.1135835 %X We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is strongly related to the original query, containing terms closely related to all of the original terms. This contrasts with query expansion through pseudo-relevance feedback, which is costly and can lead to query drift. This also contrasts with query relaxation through boolean or TFIDF retrieval, which reduces the specificity of the query. We define a scale for evaluating query substitution, and show that our method performs well at generating new queries related to the original queries. We build a model for selecting between candidates, by using a number of features relating the query-candidate pair, and by fitting the model to human judgments of relevance of query suggestions. This further improves the quality of the candidates generated. Experiments show that our techniques significantly increase coverage and effectiveness in the setting of sponsored search. %@ 1-59593-323-9

@inproceedings{jones2006generating, abstract = {We introduce the notion of query substitution, that is, generating a new query to replace a user's original search query. Our technique uses modifications based on typical substitutions web searchers make to their queries. In this way the new query is strongly related to the original query, containing terms closely related to all of the original terms. This contrasts with query expansion through pseudo-relevance feedback, which is costly and can lead to query drift. This also contrasts with query relaxation through boolean or TFIDF retrieval, which reduces the specificity of the query. We define a scale for evaluating query substitution, and show that our method performs well at generating new queries related to the original queries. We build a model for selecting between candidates, by using a number of features relating the query-candidate pair, and by fitting the model to human judgments of relevance of query suggestions. This further improves the quality of the candidates generated. Experiments show that our techniques significantly increase coverage and effectiveness in the setting of sponsored search.}, acmid = {1135835}, added-at = {2017-12-17T14:31:18.000+0100}, address = {New York, NY, USA}, author = {Jones, Rosie and Rey, Benjamin and Madani, Omid and Greiner, Wiley}, biburl = {https://www.bibsonomy.org/bibtex/224499582055652d9283759162f0c2543/thoni}, booktitle = {WWW '06: Proceedings of the 15th international conference on World Wide Web}, description = {Generating query substitutions}, doi = {10.1145/1135777.1135835}, editor = {Carr, Les and Roure, David De and Iyengar, Arun and Goble, Carole A. and Dahlin, Michael}, interhash = {a3a02e51b29c8c571a4060f784c23bdf}, intrahash = {24499582055652d9283759162f0c2543}, isbn = {1-59593-323-9}, keywords = {expansion query refinement substitute}, location = {Edinburgh, Scotland}, numpages = {10}, pages = {387--396}, publisher = {ACM}, series = {WWW '06}, timestamp = {2017-12-17T14:31:18.000+0100}, title = {Generating query substitutions}, url = {http://dx.doi.org/10.1145/1135777.1135835}, year = 2006 }