Staged Linguistic Seeding: Grounded Query Expansion for Verified-Unit QA in AI Contact Centers

• URL: http://arxiv.org/abs/2609.00844v2
• Date: Mon, 07 Sep 2026 07:50:13 GMT
• Title: Staged Linguistic Seeding: Grounded Query Expansion for Verified-Unit QA in AI Contact Centers
• Abstract summary: We deploy a system that answers only from a closed set of verified QA units.<n>One methodology is reused across both domains, so inference stays a single retrieval pass with no query-time generation.<n>We report this as an application study, including negative results.
• Score: 1.1983198417783958
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Customer-service QA in an AI contact center (AICC) runs under deployment constraints that benchmark QA misses: tight voice-hotline latency and a high cost for unsupported or wrong automatic answers. We deploy a system that answers only from a closed set of verified QA units: it returns a retrieved unit verbatim, or routes to clarify, abstain, or handoff. The index is enriched offline by staged linguistic seeding (SLS): a human authors a per-unit world-grounded slot recipe, gpt-4.1-mini renders it into variants, and a light human gate filters them. One methodology is reused across both domains, so inference stays a single retrieval pass with no query-time generation. On held-out query variants from two industrial domains, SLS lifts hybrid R@1 to 0.881/0.930 (+0.27/+0.34), with gains across all five retrievers tested. At the same gpt-4.1-mini generation budget, SLS beats doc2query by +0.20/+0.32, while cross-provenance evaluation provides additional evidence of transfer across generated-query distributions. Verified-unit answering also removes free-form generation's unsupported-content surface (7-13% versus approximately 0%). We report this as an application study, including negative results.

Related papers

• ArguLens: An Open-Source System for Automated Essay Scoring and Label-Aware Feedback Generation [9.677955445684686]
  ArguLens is an opensource system that decomposes automated essay scoring (AES) into three decoupled components.<n>A label-aware feedback generator serves through vLLM with a Qwen2.5-14BInstruct backbone.<n>A Gradio web UI exposes pluggable inference backends and supports single-essay and batch scoring.
  arXiv  Detail & Related papers  (2026-08-18T04:23:50Z)
• Never the Number: Structural Abstention for AI Systems Whose Answers Are Consumed as Fact [0.0]
  Large language models have made natural language interfaces to databases newly credible, but calibrated text-to-aggregated systems fail in a way that matters for deployment.<n>We propose an architectural pattern for such systems, a trusted kernel with a generative shell, resting on one invariant.<n>A generative shell interprets under input and phrases replies; a deterministic kernel matches fully specified questions against a bounded set of answerable question shapes.<n>The two meet at a confirmation the user reads before any value is computed, and requests the kernel cannot express are declined rather than approximated.
  arXiv  Detail & Related papers  (2026-08-14T03:53:21Z)
• MergeSE: Post-Hoc Model Merging for Software Engineering Tasks Without Retraining [9.757638656919832]
  We present textbfMergeSE, an open-source CLI and web tool for training-free model merging of HFace encoder checkpoints.<n> MergeSE supports SE classification more broadly through a built-in registry of nine task types.<n>It supports five merging algorithms, including TIES, DARE-TIES, Wudi, PCB, and averaging.
  arXiv  Detail & Related papers  (2026-08-04T19:39:02Z)
• FineVerify: Scaling Test-Time Compute with Fine-Grained Self-Verification for Agentic Search [88.16262636915975]
  FineVerify is a fine-grained self-verification framework for agentic search.<n>It decomposes each question into checkable sub-questions, verifies sampled candidates, and selects the candidate with the highest aggregated score.<n>FineVerify consistently outperforms standard scaling baselines.
  arXiv  Detail & Related papers  (2026-05-30T10:21:20Z)
• DiscoUQ: Structured Disagreement Analysis for Uncertainty Quantification in LLM Agent Ensembles [5.647839536820347]
  We introduce DiscoUQ, a framework that extracts and leverages the structure of inter-agent disagreement to produce well-calibrated confidence estimates.<n>DiscoUQ-LLM achieves an average AUROC of 0.802, outperforming the best baseline.<n>The learned features generalize across benchmarks with near-zero performance degradation.
  arXiv  Detail & Related papers  (2026-03-21T23:24:12Z)
• Test-Time Strategies for More Efficient and Accurate Agentic RAG [58.44913384057518]
  Retrieval-Augmented Generation (RAG) systems face challenges with complex, multihop questions.<n>Such approaches can introduce inefficiencies, including repetitive retrieval of previously processed information.<n>We investigate test-time modifications to the Search-R1 pipeline to mitigate these identified shortcomings.
  arXiv  Detail & Related papers  (2026-03-12T19:18:59Z)
• Eigen-1: Adaptive Multi-Agent Refinement with Monitor-Based RAG for Scientific Reasoning [53.45095336430027]
  We develop a unified framework that combines implicit retrieval and structured collaboration.<n>On Humanity's Last Exam (HLE) Bio/Chem Gold, our framework achieves 48.3% accuracy.<n>Results on SuperGPQA and TRQA confirm robustness across domains.
  arXiv  Detail & Related papers  (2025-09-25T14:05:55Z)
• Open-domain Question Answering via Chain of Reasoning over Heterogeneous Knowledge [82.5582220249183]
  We propose a novel open-domain question answering (ODQA) framework for answering single/multi-hop questions across heterogeneous knowledge sources. Unlike previous methods that solely rely on the retriever for gathering all evidence in isolation, our intermediary performs a chain of reasoning over the retrieved set. Our system achieves competitive performance on two ODQA datasets, OTT-QA and NQ, against tables and passages from Wikipedia.
  arXiv  Detail & Related papers  (2022-10-22T03:21:32Z)
• Zero-Shot Dialogue State Tracking via Cross-Task Transfer [69.70718906395182]
  We propose to transfer the textitcross-task knowledge from general question answering (QA) corpora for the zero-shot dialogue state tracking task. Specifically, we propose TransferQA, a transferable generative QA model that seamlessly combines extractive QA and multi-choice QA. In addition, we introduce two effective ways to construct unanswerable questions, namely, negative question sampling and context truncation.
  arXiv  Detail & Related papers  (2021-09-10T03:57:56Z)
• Generating Diverse and Consistent QA pairs from Contexts with Information-Maximizing Hierarchical Conditional VAEs [62.71505254770827]
  We propose a conditional variational autoencoder (HCVAE) for generating QA pairs given unstructured texts as contexts. Our model obtains impressive performance gains over all baselines on both tasks, using only a fraction of data for training.
  arXiv  Detail & Related papers  (2020-05-28T08:26:06Z)
• Fluent Response Generation for Conversational Question Answering [15.826109118064716]
  We propose a method for situating responses within a SEQ2SEQ NLG approach to generate fluent grammatical answer responses. We use data augmentation to generate training data for an end-to-end system.
  arXiv  Detail & Related papers  (2020-05-21T04:57:01Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.