Learning dense models of query similarity from user click logs

  • Authors:
  • Fabio De Bona;Stefan Riezler;Keith Hall;Massimiliano Ciaramita;Amaç Herdaǧdelen;Maria Holmqvist

  • Affiliations:
  • Friedrich Miescher Laboratory of the Max Planck Society, Tübingen, Germany;Google Research, Zürich, Switzerland;Google Research, Zürich, Switzerland;Google Research, Zürich, Switzerland;University of Trento, Rovereto, Italy;Linkopings University, Linkopings, Sweden

  • Venue:
  • HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

The goal of this work is to integrate query similarity metrics as features into a dense model that can be trained on large amounts of query log data, in order to rank query rewrites. We propose features that incorporate various notions of syntactic and semantic similarity in a generalized edit distance framework. We use the implicit feedback of user clicks on search results as weak labels in training linear ranking models on large data sets. We optimize different ranking objectives in a stochastic gradient descent framework. Our experiments show that a pairwise SVM ranker trained on multipartite rank levels outperforms other pairwise and listwise ranking methods under a variety of evaluation metrics.