Umoren.ai
Free · Vector search readiness

AI Search Content AuditWhich facets of the question does your page answer?

Google's latest research shows AI search turning a question straight into and retrieving the . Enter a query and a page URL to see how well the page answers each of the question's 4 to 12 and which directions are thin.

We check whether the page below would be cited as the answer to this question.

How it works

Step 01

Enter the question and the answer page

Type the question you want to be mentioned for, and the URL of the one page that should be cited. Use the page that answers it, not your homepage.

Step 02

Build the fanout vectors

The query is split into 4 to 12 distinct facets, depending on how broad it is, and an ideal chunk for each is embedded to form the fanout vectors.

Step 03

Match chunks by meaning

The page's text is split into chunks and embedded, and the closest chunk to each direction is found. You get coverage, a map and the directions where the score can grow.

Why this check exists

Most AI search today splits one question into several text queries, then searches those strings. Whether your page contains those words still affects what comes back.

Google's latest research shows a path that skips writing that text. The question is encoded once, and a small model emits several fanout vectors directly. Search then retrieves the content closest in meaning to each vector. No readable sub-query is left behind.

In the paper, building fan-outs for a batch of 8 queries drops from 1.46 seconds with an LLM to 0.07 seconds with the diffusion model. The tests were fashion outfits and music playlists. The paper does not say this runs in Google Search or AI Overviews.

If retrieval moves from keywords to closeness in meaning, a page changes what it needs. Sprinkling the query's words is not enough to land near the vector. What matters is a passage that answers each facet head-on.

This check shows that state before you rewrite. It splits your query into 4 to 12 facets, depending on how broad it is, and scores how close the nearest passage on the page is. It is an approximation of the idea, not Google's model, and it is not a ranking.

From text fanouts to vector fanouts

The left is how fan-out works in wide use today. The right is what the paper tested. On the right, nobody writes a search query.

Text fanouts (today)

  1. 1An LLM reads the question
  2. 2It writes several search queries as text
  3. 3Each string is encoded and searched
  4. 4Nearby content is merged into an answer

Vector fanouts (research)

  1. 1The question is encoded once
  2. 2A small model emits several vectors directly
  3. 3No search-query text is produced
  4. 4Content near each vector is retrieved by meaning
What comes out
Readable queries → vectors of numbers only
Time for 8 queries
1.46 s → 0.07 s
What was tested
Fashion and music recommendations, not web search

This tool is not the paper's diffusion model. It splits the question into 4 to 12 facets, embeds an ideal passage for each, and measures how close your page's passages sit.

Source: Jiang et al., arXiv:2603.06397 (Google Research and the University of Illinois, March 2026)

What to do with the result

The map and the passages are there to decide what to add.

STEP 01

Hover a point

Each point is one facet of the question. Hovering shows the similarity and the closest passage on the page. Points further out mean the page already has text close in meaning.

STEP 02

Pick directions short of the green band

Points that stay toward the center are facets the page doesn't answer yet. If the passage shown is about something else, nothing on the page sits near that facet.

STEP 03

Add a paragraph from the ideal chunk

Under "Where the score can grow" you'll see an example of the passage that would sit near that vector. Add a paragraph for that facet, with figures, conditions and names.

STEP 04

Edit, then run the check again

Click "Rerun with the same directions" above the result and see whether the point moves outward. The directions stay the same, so the before and after coverage compare directly. If a facet would feel forced on this page, create a related page and link to it.

What the results mean

≥ 0.6Covered
A chunk sits right next to the fanout vector, so the page is likely to be retrieved for that direction.
≥ 0.45Partly covered
A related chunk exists but doesn't answer the intent head-on. Specific figures and conditions pull it closer.
< 0.45Gap
Nothing on the page sits near that direction. Use the ideal chunk as a brief to add content or create a related page.

FAQ

Q

What are vector fanouts?

A

Classic query fan-out is when an AI expands one question into several text search queries. A March 2026 paper from Google Research and the University of Illinois (Jiang et al., arXiv:2603.06397) skips that text step: a small diffusion model turns the question's embedding straight into several fanout vectors and retrieves content that sits near them in meaning. No readable sub-query is produced. The paper tested fashion outfits and music playlists, and it does not say this runs in Google Search or AI Overviews.

Q

What does the AI Search Content Audit show?

A

Enter a query and the URL of the page you want to check. We split the query into 4 to 12 fanout directions, depending on how broad it is, and show which facets the page answers and which are thin. Each direction comes with an ideal chunk, so you can see what to add to raise the score.

Q

Does this tool use Google's actual model?

A

No. The paper's model is a small diffusion model, and it was not tested on web search. This tool splits a question into 4 to 12 distinct facets, writes an ideal chunk for each, embeds those chunks, and uses the vectors as stand-ins for fanout vectors. Treat the result as a guide to how retrievable the page is by vector search, not as a live ranking.

Q

How is vector coverage calculated?

A

We split the page's text into chunks of about 700 characters and embed each one. For each fanout vector we take the cosine similarity of the closest chunk, map it onto 0-100, and average across all directions. A similarity of 0.6 or more counts as covered, 0.45 or more as partly covered, and anything lower as a gap.

Q

How is this different from the query fan-out tools?

A

The Gemini and ChatGPT query fan-out tools extract the text queries the AI actually ran. This tool skips queries entirely: it shows which chunks of your page sit closest to each fanout vector when matching happens directly between meanings, and which directions are left empty. It scores semantic closeness, not keyword overlap.

Q

What is fanout orthogonality?

A

It shows how far apart the fanout vectors point from each other (1 minus their average cosine similarity). Higher means the query breaks down into more distinct facets, which also makes it harder for one page to cover every direction.

Q

Why does the number of fanout directions change between questions?

A

Real AI search scales its fan-out to the question, so this check does too. A narrow question like "How tall is Tokyo Tower?" gets 4 or 5 directions, a comparison or buying question gets 6 to 8, and a broad question that mixes budget, region and timing gets up to 12. Coverage is the average across all directions, so scores for questions with different numbers of directions don't compare one to one. To compare before and after an edit, use "Rerun with the same directions" above the result, which measures the page against the same directions as last time.

Q

How do I read the coverage map?

A

Each axis is a numbered fanout direction. There are 4 to 12 of them, depending on how broad the question is. Each point is the page's closest passage for that direction. Hover a point to see the similarity and that passage. Further out means closer in meaning. Reaching the green band means covered, the amber band means partly covered, and inside that is a gap. Directions that dip toward the center are where new content can raise the score.

Q

Why does it say my page couldn't be read?

A

The tool reads the first HTML your server returns and doesn't run JavaScript. It can't read pages that block bots, pages that draw their text with JavaScript, or files that aren't HTML. Many AI crawlers don't run JavaScript either, so if the tool can't read your page, AI search may not see its content.

Q

Can I compare my page with competitors?

A

This tool checks the one page you enter. If you want to know where competitor pages beat yours for the same query, or how to raise your score far enough to get cited by AI search, contact us from the result screen and an umoren.ai consultant will put together a comparison and a plan.

Q

How do I use the result for my content?

A

Use the ideal chunks under "Where the score can grow" as a brief and add paragraphs to your page that answer the same need. Specific figures, names and conditions pull the vector closer. If covering every direction on one page would feel forced, create a related page and link to it.

Q

Do you store the URLs and queries I enter?

A

If you're logged in, the result is saved to your account history so you can come back to it. We also log the query, the URL and a summary of the result to improve the service and prevent abuse. We fetch the page once for the check and don't store its full text.

AI Search Content Audit: Which Facets of the Question Does Your Page Answer? | umoren.ai