πŸ“ž +91-7667918914 | βœ‰οΈ ijarcce@gmail.com
International Journal of Advanced Research in Computer and Communication Engineering
International Journal of Advanced Research in Computer and Communication Engineering A monthly Peer-reviewed & Refereed journal
ISSN Online 2278-1021ISSN Print 2319-5940Since 2012
IJARCCE adheres to the suggestive parameters outlined by the University Grants Commission (UGC) for peer-reviewed journals, upholding high standards of research quality, ethical publishing, and academic excellence.
← Back to VOLUME 15, ISSUE 10, OCTOBER 2026

Grouping-Aware Numerical Verification for Offline Retrieval-Augmented Question Answering over Institutional Documents

Sudheer Katuri, G. Sharmila Sujatha

πŸ‘ 4 viewsπŸ“₯ 3 downloads
Share: 𝕏 f in ✈ βœ‰
Abstract: Institutions hold large volumes of policy documents, reports and spreadsheets that are still searched manually. Retrieval-augmented generation (RAG) offers a natural interface to such collections, but mainstream deployments route confidential material through hosted language-model APIs and provide no guarantee that figures quoted in an answer actually occur in the source text. This paper presents an offline RAG system for institutional document question answering in which ingestion, embedding, retrieval and generation all execute on commodity hardware with no external network dependency, and in which every numeral in a generated answer is verified against the retrieved context before the answer is shown. The central observation is that naive numeric extraction β€” the digit-matching regular expression used in comparable pipelines β€” fragments digit-grouped quantities such as 45,23,000 into unrelated components, causing a verifier built on it to reject faithful answers. We describe a grouping-aware extraction and verification procedure that handles Indian and Western grouping conventions, decimal and percentage forms, and enumeration markers. On a 15case extraction benchmark the proposed extractor is exact on 15/15 cases against 5/15 for the baseline, and substituting the baseline extractor into the verifier introduces false rejections of faithful answers. Measured retrieval latency over an exhaustive 384dimensional index remains below one millisecond to roughly 5,000 chunks and grows linearly to about 10.5 ms at 50,000 chunks, which bounds the corpus size at which exact search remains appropriate.

Keywords: retrieval-augmented generation, hallucination detection, offline inference, vector search, document question answering, privacy-preserving systems.

How to Cite:

[1] Sudheer Katuri, G. Sharmila Sujatha, β€œGrouping-Aware Numerical Verification for Offline Retrieval-Augmented Question Answering over Institutional Documents,” International Journal of Advanced Research in Computer and Communication Engineering (IJARCCE), DOI: 10.17148/IJARCCE.2026.151028

Creative Commons License This work is licensed under a Creative Commons Attribution 4.0 International License.