Signals 4 · free daily AI digest

Tracing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion

Paper recorded by Signals 4 on 2026-10-09 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-10-09 on arXiv · recorded by Signals 4 on 2026-10-12

Category: cs.CL · 自然语言处理 · first seen 2026-10-12

Abstract

Large language models (LLMs) are now a standard source of query expansion terms but they hallucinate. They inject non existent entities and off-topic terms that add ranking noise and can hurt strong retrievers. Existing remedies such as corpus grounding, mutual verification and preference alignment treat hallucinated terms as an undifferentiated nuisance to be filtered by agreement heuristics, wit

Read on arXiv →

#271 most recent of 660 cs.CL papers we have recorded · ↑ newer: QTestBench: A Test Framework for Evaluating LLM-Generated Quantum Code · ↓ older: Error Rate is Not Enough: Costs of Augmentation in Low-Resource ASR
Cite this page: Tracing and Taming Hallucinated Terms via Subsequence-Association Filtering and Breadth-Aware Selection for LLM Query Expansion: the #271 most recent of 660 cs.CL papers we have recorded (as of 2026-10-09). Source: Signals 4 (Signals API) — https://data.jiangzhang.ca/signals4/t/papers/tracing-and-taming-hallucinated-terms-via-subsequence-association-filtering-and-.html
Free to quote with attribution to “Signals 4 (Signals API)”. Machine-readable: papers.json
Related: More cs.CL papers · arXiv signals · All papers · Today in AI
Get 4 AI signals a day by email — free.
Subscribe free → See all plans →
Get 4 AI signals a day by email — free
All models · All repos · By company · Daily editions