Cross-Document Topic-Aligned Chunking for Retrieval-Augmented Generation
Mile Stankovic
TL;DR
This paper addresses the knowledge fragmentation problem in retrieval-augmented generation by introducing Cross-Document Topic-Aligned (CDTA) chunking, which reconstructs corpus-wide knowledge around global topics. CDTA identifies topics across documents, maps segments to topics, and synthesizes them into unified, topic-centered chunks using a six-stage pipeline (segmentation, topic extraction, deduplication, relevance mapping, aggregation, synthesis) with indexing and embedding. Empirical results on HotpotQA and UAE Legal show CDTA achieving higher faithfulness ($0.93$ on HotpotQA and $0.94$ on UAE Legal) and robust retrieval efficiency, particularly at low $k$ (e.g., $k=3$ with $0.91$ faithfulness), at the cost of substantially higher indexing time and API usage. The findings demonstrate meaningful improvements in multi-document reasoning and high-query-volume applications, with trade-offs discussed for deployment, including cost, latency, and the potential for hybrid approaches with existing intra-document methods.
Abstract
Chunking quality determines RAG system performance. Current methods partition documents individually, but complex queries need information scattered across multiple sources: the knowledge fragmentation problem. We introduce Cross-Document Topic-Aligned (CDTA) chunking, which reconstructs knowledge at the corpus level. It first identifies topics across documents, maps segments to each topic, and synthesizes them into unified chunks. On HotpotQA multi-hop reasoning, our method reached 0.93 faithfulness versus 0.83 for contextual retrieval and 0.78 for semantic chunking, a 12% improvement over current industry best practice (p < 0.05). On UAE Legal texts, it reached 0.94 faithfulness with 0.93 citation accuracy. At k = 3, it maintains 0.91 faithfulness while semantic methods drop to 0.68, with a single CDTA chunk containing information requiring multiple traditional fragments. Indexing costs are higher, but synthesis produces information-dense chunks that reduce query-time retrieval needs. For high-query-volume applications with distributed knowledge, cross-document synthesis improves measurably over within-document optimization.
