Skip to content
Preprint

CeQe: Grounding Lexical Retrieval in Semantic Evidence

Aug 2026 · 0 citations · 14 references
Computer Science

TL;DR

This work presents Cross-Encoder Query Expansion (CE-QE), which reads the per-token relevance attributions of a cross-encoder applied to top semantic search results, selects the terms the cross-encoder treats as decisive, and appends them to the BM25 query.

Abstract

Lexical retrieval (BM25) captures exact keyword matches and weights terms by corpus-wide significance, but it is blind to the semantic vocabulary gap: when a relevant document phrases an answer differently from the query, BM25 never retrieves it, and no amount of downstream reranking or fusion can recover a document that was never in the candidate set. We present Cross-Encoder Query Expansion (CE-QE), which reads the per-token relevance attributions of a cross-encoder applied to top semantic search results, selects the terms the cross-encoder treats as decisive, and appends them to the BM25 query. Unlike classical pseudo-relevance feedback, which reuses BM25's own (possibly wrong) top results, CE-QE seeds expansion from the semantic retriever's results, avoiding self-reinforcing query drift. Unlike recent generative query expansion (HyDE, Query2doc), which prompts a large language model to hallucinate text from its parametric knowledge, every CE-QE expansion term is copied verbatim from a retrieved passage, so it cannot introduce vocabulary the corpus does not contain, and its only added cost is attribution extraction on a cross-encoder a hybrid pipeline already runs for reranking. On seven BEIR datasets, CE-QE improves lexical recall substantially where query and answer vocabulary diverge (e.g., NQ Recall@100 from 0.32 to 0.47), and its score-fusion variant (SESF) beats cross-encoder score fusion by 2.5% on Recall@100 and beats SPLADEv2 and ColBERTv2 by 5.3% and 4.6% on nDCG@10, while leaving the underlying BM25 index completely unmodified.

View source

Similar papers

Conference Jul 2026

Conversational Query Reformulation Using Fine-Grained Retrieval and Keyword Augmentation

Conversational Query Reformulation (CQR) is an important component in Conversational Question Answering (ConvQA), where user queries are often incomplete, ambiguous, and dependent on previous dialogue turns. Recent CQR approaches have shown the effectiveness of large language models (LLMs) in generating standalone quer...

Andhika Putra Bagaskara, Arie Ardiyanti Suryani · 0 citations
Open access Jul 2026

Optimized Hybrid Retrieval-Augmented Generation Framework using Semantic Search and Re-ranking for Reliable LLM Responses

Evaluation on a multi-page technical PDF document shows that the hybrid retrieval and re-ranking stages together raise retrieval precision and reduce irrelevant or unsupported answers compared with retrieval limited to a single method, supporting the use of this approach for reliable, document-grounded question answeri...

Vishwa K Dave, K. Pallavi · 0 citations
Preprint Aug 2026

Difficulty-Gated Fusion of Reasoning Views for Temporal Retrieval

This work proposes query-difficulty-gated fusion of reasoning views, a fused ranking that uses no relevance labels at inference, no re-ranking, and no fine-tuning of the retriever; the gate is trained leave-one-task-out.

J. Holdcroft, Abdelrahman Abdallah, Adam Jatowt · 0 citations
Preprint Aug 2026

Factorized Hypothesis Search for Evidence-to-Taxonomy Retrieval

This work proposes Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations over named semantic dimensions that support structured query rendering, multi-hypothesis retrieval, and dimension-level candidate verification.

Lin-Hai Ma, Ethan F. Wei, Xue-Qing Peng et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.