Skip to content
SEO Madmanby Adam Hafez

How you chunk a page changes whether AI retrieves it at all

A 36-method academic benchmark found paragraph-based chunking nearly doubles retrieval accuracy over naive fixed-size splitting across six domains.

Published · 3 min read

Written byAdam Hafez
Share
Markdown
Rows of books sorted and organized on library shelves

Key takeaways

  • Researchers benchmarked 36 distinct chunking strategies against each other across six knowledge domains and five embedding models, rather than testing one method in isolation.
  • Paragraph Group Chunking reached a mean nDCG@5 near 0.459 and a top-5 hit rate near 59%, while naive fixed-size chunking scored below 0.244 with a 2-3% top-1 hit rate.
  • No single method won everywhere: dynamic token sizing led in biology, physics and health, while paragraph grouping led in legal and mathematics content.
  • Bigger embedding models scored higher overall but were still measurably hurt by bad chunking, showing splitting and model size are separate, additive levers.
  • The study used an LLM grader instead of human annotators to judge relevance, and it drew from a fixed six-domain dataset, so its exact numbers may not generalize past that setup.

Every AI search engine and every retrieval-augmented chatbot has to do the same thing before it can answer a question from a web page: cut that page into pieces small enough to embed and compare against the query. How those pieces get cut is rarely discussed outside RAG engineering circles, but a March 2026 academic benchmark measured it directly, and the gap between doing it well and doing it the default way is large.

What the study actually tested

Muhammad Arslan Shaukat, Muntasir Adnan and Carlos C. N. Kuhn built what they describe as the first large-scale, cross-domain evaluation of document chunking strategies for dense retrieval. Instead of proposing one new method and comparing it to a couple of baselines, they benchmarked 36 chunking strategies against each other, grouped into fixed-size, semantic, structure-aware, hierarchical, adaptive and LLM-assisted families. Every strategy ran against the same UltraDomain dataset, spanning biology, physics, health, legal, maths and agriculture content, and every resulting set of chunks was embedded with five different embedding models so that chunking quality could be separated from embedding-model quality. Retrieval accuracy was scored with Normalised DCG at 5, the primary metric, backed by Hit@5 and MRR, and relevance was judged by a large language model grader rather than exact keyword overlap.

The gap between good and naive chunking

The headline number is stark. Paragraph Group Chunking, which groups whole paragraphs into retrieval units rather than cutting at a fixed character count, reached a mean nDCG@5 of about 0.459 and a Hit@5 near 59%, meaning the correct chunk showed up somewhere in the top five results close to six times out of ten. Naive fixed-size character chunking, the default behavior of many scraping and indexing tools that simply cut text every N characters with no regard for sentence or paragraph boundaries, scored below 0.244 on the same metric, and its Precision@1, the chance the single best chunk was ranked first, sat at only 2 to 3%. That is not a marginal difference; it is close to an order of magnitude on the metric that matters most for a system that only surfaces one or two citations.

The study also found that no single method wins everywhere. Dynamic token sizing, which adjusts chunk length based on content density, performed best in biology, physics and health content, while paragraph grouping performed best in legal and mathematics content. The authors attribute this to how differently those domains are written: technical scientific prose and dense legal argument break into coherent units at different natural lengths.

Bigger models do not fix bad chunking

One finding worth sitting with: larger embedding models produced higher absolute retrieval scores across every chunking strategy tested, but they remained sensitive to poor chunking. A better embedding model did not close the gap between a good chunking strategy and a bad one; it moved both up in parallel. The authors describe chunking quality and embedding size as complementary rather than substitutable levers, which means a site relying on a state-of-the-art embedding model downstream still loses retrieval accuracy if its own content is split badly upstream, whether that splitting happens in a scraper’s pipeline or in how the page itself is structured into sections.

Why we care

This study measures a retrieval pipeline the researchers built, not Google’s, OpenAI’s or Perplexity’s live indexing systems, and its numbers should not be read as “add paragraph breaks, get cited twice as often.” What it does establish, with a controlled 36-method comparison rather than a single case study, is that chunking is a real and measurable variable in whether the right passage gets surfaced for a query at all, not a cosmetic detail. For a page meant to be read by a retrieval system as much as by a person, that argues for content organized into self-contained paragraphs and sections that make sense pulled out on their own, since every chunking method the paper tested that respected natural content boundaries beat the ones that ignored them.

What is not yet known

The paper does not test HTML heading tags, <article> or <section> elements, or any other markup-level signal directly; its structure-aware and hierarchical methods work on paragraph and sentence boundaries in the underlying text, not on document markup. Whether marking up a page with proper h2 and h3 hierarchy produces the same retrieval gains this study measured for well-formed paragraphs remains an open question that would need its own study, and nothing here should be read as an answer to it.

The evidence

Sample
36 chunking methods across 6 domains, 5 embedding models

Hypothesis: The specific strategy used to split a document into chunks for a dense retrieval system is an underexplored variable that meaningfully changes whether the correct passage gets retrieved for a given query, independent of which embedding model does the matching.

Method: Shaukat, Adnan and Kuhn benchmarked 36 chunking strategies, spanning fixed-size, semantic, structure-aware, hierarchical, adaptive and LLM-assisted approaches, against each other on the UltraDomain dataset, which spans six knowledge domains: biology, physics, health, legal, maths and agriculture. Each strategy's output chunks were embedded with five different embedding models and scored on retrieval quality using Normalised DCG at 5 as the primary metric, supported by Hit@5 and MRR, with relevance judged by a large language model grader rather than fixed keyword matching.

Findings

  • Paragraph Group Chunking was the top-performing strategy overall, reaching a mean nDCG@5 of approximately 0.459, a Precision@1 near 24%, and a Hit@5 near 59% across the combined test set.
  • Naive fixed-size character chunking, the simplest baseline and the default in many scraping and indexing pipelines, scored below 0.244 on nDCG@5 with a top-1 precision of only 2 to 3%, roughly an order of magnitude worse at getting the single best chunk retrieved first.
  • Which chunking method won varied by subject: dynamic token sizing performed strongest in biology, physics and health content, while paragraph grouping performed strongest in legal and mathematics content, so no single strategy dominated every domain.
  • Larger embedding models raised absolute scores across the board but remained sensitive to poor chunking, meaning a bigger model does not compensate for badly split content, and the two levers, chunking quality and embedding size, act independently.

Limitations: The paper's own stated limitation is that relevance judgments came from an LLM grader rather than human annotators, and results are reported on a fixed subset of domains drawn from the UltraDomain dataset, so the authors caution that findings may not generalize to all retrieval settings. The study also measures retrieval within a controlled RAG pipeline built by the researchers, not how any specific commercial AI search engine chunks or ranks live web pages, so its numbers describe retrieval accuracy in that experimental setup, not a guaranteed citation lift for any particular site.

About the author

Adam Hafez
Adam Hafez

Founder, UpgradIQ FZC LLC

Adam Hafez works on technical SEO and search measurement: how pages get crawled, indexed, ranked and now quoted by answer engines. He founded UpgradIQ, which reads Google Search Console and GA4 to tie ranking movement back to the changes that caused it. He publishes what the data supports and states the limits of it.

  • Technical SEO
  • Search Console and GA4 measurement
  • Answer engine optimization
  • Structured data

The briefing

Only what actually changed in search, delivered in full by RSS, Atom or JSON feed.

Follow