Crossref DOIMemberCiteFactoropen accessissn
SJIF Impact Factor 8.659 | ISSN: 2582-3930
IJSREM Logo

International Journal of Scientific Research in Engineering and Management

(Gateway to Global Scholars - An International, Scholarly, Multi-Disciplinary, Open Access Journal)

Peer-Reviewed Journal Designed to Meet UGC's Quality Parameters

HomeCurrent IssuePast IssuesPay OnlineConferencesEditorial BoardAbout UsContact Us
IJSREM

Loading article...

Follow Us

  • Google Scholar
  • ResearchGate
  • Academia.edu
  • Mendeley
  • LinkedIn
  • Facebook
  • Instagram

Journal Policies

  • Peer Review Policy
  • Publication Ethics
  • Copyright Infringement
  • Refund & Cancellation Policy
  • Terms and Conditions
  • Privacy Policy

Journal Identifiers & Licenses

  • ISSN Verified: 2582-3930ISSN Verified: 2582-3930
  • Crossref DOI: 10.55041Crossref DOI: 10.55041
  • SJIF Ranking: 08.659SJIF Ranking: 08.659
  • Licensed under CC BY 4.0Licensed under CC BY 4.0
  • ISO Certification: 9001:2015ISO Certification: 9001:2015
  • Indexed & Cited In: Google ScholarIndexed & Cited In: Google Scholar

Contact Us

International Journal of Scientific Research in Engineering and Management (IJSREM)

#62/1, New No 7, 1st Cross, 2nd Main, Ganganagar, R T Nagar, Bangalore North, Bangalore, Karnataka, India – 560032
[email protected]+91 93911 67991
logos
logos
Working Hours

Mon – Sat: 9:00 AM – 6:00 PM

Sunday: 10:00 AM – 4:00 PM

+91 93911 67991

© 2026 IJSREM – International Journal of Scientific Research in Engineering and Management. This is an open-access journal. Articles are published under the Creative Commons Attribution (CC BY 4.0) License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

DisclaimerPrivacy PolicyTerms and Conditions
ArticlePeer ReviewedOpen AccessPlagiarism Passed
Paper ID:IJSREM68365

Adaptive Chunking and Hybrid Retrieval for Enhanced Retrieval-Augmented Generation

Stream/Area:

-

Subject:

-

Paper ID:

IJSREM68365

Volume:

10 |

10 |

Oct 2026

Pages:

1-5

Publication Frequency:

Monthly (12 issues per year)

DOI
Digital Object Identifier
Not assigned

License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.

Share this article:

Authors

Yash Nilesh Patil

Yash Nilesh Patil

Information Technology

Vidyalankar Institute of Technology

Download Author Certificate
Om Nikam

Om Nikam

Information Technology

Vidyalankar Institute of Technology

Download Co-Author Certificate
Punit Jadhav

Punit Jadhav

Information Technology

Vidyalankar Institute of Technology

Download Co-Author Certificate
Deepali Shrikhande

Deepali Shrikhande

Information Technology

Vidyalankar Institute of Technology

Download Co-Author Certificate

Author Services & Downloads

Full ArticlesAcceptance Certificate

Abstract

RAG uses external knowledge through large lan-guage models, but how reliable this technique is depends on two key design aspects that are higher up in the system: chunking (or segmentation) and choosing the right chunks (retrieval).Using a fixed chunk size doesn’t take the structure of the document into account and can lose the meaning of the text.Also, dense-vector retrieval can’t match specific terms like identifiers, codes, and rare words accurately.In this paper, we introduce a new method that uses adaptive chunking—a technique that finds the boundaries between segments by measuring sentence similarity using a changing chunk size—and hybrid retrieval that uses Reciprocal Rank Fusion (RRF) and/or BM25-cross-encoder re-trieval.We also explain the math behind the algorithm, discuss where this research fits in existing work, and describe how to test the model on question-answering benchmarks and RAG-related metrics like faithfulness, answer relevance, context recall, and precision.Studies have shown that using adaptive chunking and hybrid retrieval separately improves retrieval recall by 15–30% and answer precision by 20%.

KEYWORDS

Retrieval-Augmented Generation Adaptive Chunking Hybrid Retrieval BM25 Dense Retrieval Reciprocal Rank Fusion Vector Databases Large Language Models

Cite This Article

Yash Nilesh Patil, Om Nikam, Punit Jadhav, Deepali Shrikhande, "Adaptive Chunking and Hybrid Retrieval for Enhanced Retrieval-Augmented Generation," International Journal of Scientific Research in Engineering and Management, vol. 10, no. 10, pp. 1-5, Oct 2026.

Full Article/Conclusion

In this part, we will look at two important techniques that may help improve the performance of RAG systems: one is adaptive chunking, which involves replacing simple chunking with a method that uses similarity to decide how to split text and adjust chunk size, as well as generating micro-headers. The other technique is the hybrid retrieval approach, which combines both sparse and dense models using RRF, and may also use neural re-ranking.The literature has plenty of examples of both techniques, and their limitations are often complementary.So, combining these might be one way to improve RAG systems in the future.

References

[1]     G. Kamradt, 5 levels of text splitting,” 2024. [Online]. Available: https://github.com/FullStackRetrieval-com/RetrievalTutorials [2]     T. Chen, H. Wu, S. Zhao, W. Zhang, Y. Duan, M. Wang, Y. Tian, and Z. Hao, “Dense X retrieval: What retrieval granularity should we use?” in Findings of EMNLP, 2023. [3]     P. Sarthi, S. Abdullah, A. Tuli, S. Khanna, A. Goldie, and C. D. Man-ning, “RAPTOR: Recursive abstractive processing for tree-organized retrieval,” in International Conference on Learning Representations (ICLR), 2024. [4]     Anthropic, “Introducing contextual retrieval,” 2024. [Online].Available: https://www.anthropic.com/news/contextual-retrieval [5]     “Optimizing chunking-method selection for RAG,” in Proceedings of LREC 2026, 2026. [6]        “Comparative evaluation of advanced chunking for retrieval-augmented generation in large language models for clinical decision support,” PMC, 2025. [7]        V. Karpukhin, B. Og˘uz, S. Min, P. Lewis, L. Wu, S. Edunov, D. Chen, and W. Yih, “Dense passage retrieval for open-domain question answer-ing,” in Proceedings of EMNLP, 2020. [8]        S. Robertson and H. Zaragoza, “The probabilistic relevance framework: BM25 and beyond,” Foundations and Trends in Information Retrieval, vol. 3, no. 4, 2009. [9]        G. V. Cormack, C. L. A. Clarke, and S. Bu¨ttcher, “Reciprocal rank fusion outperforms Condorcet and individual rank learning methods,” in Proceedings of SIGIR, 2009. [10]    B. Strich et al., “From BM25 to corrective RAG: Benchmark-ing retrieval strategies for text-and-table documents,” arXiv preprint arXiv:2604.01733, 2026. [11]    T. Formal, C. Lassance, B. Piwowarski, and S. Clinchant, “SPLADE: Sparse lexical and expansion model for first stage ranking,” in Proceed-ings of SIGIR, 2021. [12]    O. Khattab and M. Zah

Editorial & Review Transparency

Publication Date

10/26/2026

Peer Review Type

Double-Blind Peer Review

Review Rounds: 2

Documents

Review Report (Confidential)
Copyright Form (Office)

Article Metrics & Impact

Article Views

1

Total views since publication

PDF Downloads

5

Total downloads since publication

Geographic Reach

5

Indexing, Archiving & Preservation

Google Scholar
Academia
ResearchGate
Crossref
SSRN
Semantic Scholar
Thomson Reuters
WorldCat
Mendeley
OpenAlex
EBSCO
Zenodo

Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.

Ethics, Compliance & Transparency

Plagiarism Screening

This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.

Conflict of Interest

The authors declare no conflict of interest related to this research work.

Funding Information

No funding information available for this research.

Similar & Recommended Articles

Similar Articles by Topic

Related research in the same subject area

Loading similar articles...