Query Focused Variable Centroid Vectors for Passage Re-ranking in Semantic Search

In this paper, we propose a new approach for passage re-ranking. We show that variable (i.e. non-static) centroid vectors for passages, created based on the given query, significantly improves passage re-ranking results compared to that obtained using static centroid vectors. We also show that the results are comparable to RWMD-Q, an existing (non-centroid based unsupervised) state of the art. The experiments reported are conducted on two different datasets in both neural and co-occurrence based distributional semantics settings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2021

CEQE: Contextualized Embeddings for Query Expansion

In this work we leverage recent advances in context-sensitive language m...
research
02/15/2021

Leveraging User Behavior History for Personalized Email Search

An effective email search engine can facilitate users' search tasks and ...
research
04/22/2018

A Study on Passage Re-ranking in Embedding based Unsupervised Semantic Search

State of the art approaches for (embedding based) unsupervised semantic ...
research
05/20/2021

A comprehensive comparative evaluation and analysis of Distributional Semantic Models

Distributional semantics has deeply changed in the last decades. First, ...
research
04/04/2016

Entity Type Recognition using an Ensemble of Distributional Semantic Models to Enhance Query Understanding

We present an ensemble approach for categorizing search query entities i...
research
03/27/2022

piRank: A Probabilistic Intent Based Ranking Framework for Facebook Search

While numerous studies have been conducted in the literature exploring d...
research
06/23/2021

Leveraging semantically similar queries for ranking via combining representations

In modern ranking problems, different and disparate representations of t...

Please sign up or login with your details

Forgot password? Click here to reset