Build a mini RAG
Frame the five-document café FAQ retriever experiment
Page 1 advances one concrete five-document café FAQ retriever: explain the decision, run the code, inspect failure, measure evidence, and keep only what is ready to ship.
1Try it yourself
Code Lab
Build a mini RAG
Retrieve a doc chunk, then print it as the grounded answer.
Before you start
Why this matters
Without running code, predict the output of this page's example and name the intermediate value that would prove your prediction. Then write one sentence answering: “What could look successful while actually being wrong?” For this stage, focus on retrieval miss or ungrounded answer. Keep the prediction nearby; comparing it with the real output is the first debugging exercise, not a quiz about syntax.
2Learn the idea
Read
Build focus
A lab needs a falsifiable claim before code. The claim here is that answer a café question only when a relevant local note is retrieved and cite the note identifier used. Record the tiny dataset, expected behavior, and one reason the result could be misleading. The first artifact is an experiment brief, not a model screenshot. It names the user, the decision the output supports, and the baseline you must beat. For this chapter, the baseline is deliberately transparent so later complexity has something honest to compare against.
The artifact's user-facing goal is specific: answer a café question only when a relevant local note is retrieved and cite the note identifier used. Its accepted input is five short documents with stable IDs plus one normalized user question. Those statements are intentionally narrower than “build an AI system.” Narrow scope lets us inspect every input and expected result, and it prevents a toy result from being presented as a production claim. Run the inventory below before implementing anything. Its output proves that the fixture is present and small enough to inspect by hand.
Read
Run the example
Save this as lesson.py and run python3 lesson.py. It uses only the language standard library, so the example is reproducible offline.
docs={'hours':'Cafe open 8am to 6pm weekdays.','wifi':'Ask staff for the Wi-Fi card.','pets':'Service animals are welcome.'}
print(sorted(docs),len(docs))
Expected output: three sorted IDs and count 3. Exact floating-point formatting may vary slightly, but the asserted behavior must not. Read the output as evidence about this stage, not merely proof that the interpreter started.
Read
Debug the stage
Print normalized question tokens, each document's overlap score, the winning ID, and the exact cited text. A fluent wrong answer often starts as a retrieval miss, so inspect retrieval before prompt wording. Zero overlap must abstain. For ties, choose and document a deterministic rule. Treat instructions embedded in a document as untrusted text, not commands for the application.
At the experiment brief stage, save the smallest failing fixture beside the expected result. Change one cause at a time and rerun the exact command printed above; that makes the repair reviewable and keeps this chapter's progressive artifact reproducible.
Read
Evaluate before continuing
Create labeled questions for each of the five documents plus unsupported questions. Measure retrieval hit rate, citation correctness, supported-answer rate, and correct abstention. Read every answer beside its cited note; lexical overlap can retrieve a document for the wrong reason. Version the notes so a score can be reproduced after content changes.
For this experiment brief page, preserve the fixture and result as evidence for the next page. Label observations separately from conclusions: a passing assertion establishes the behavior it names, while broader usefulness requires the chapter's full evaluation set and stated operating limits.
Continue learning · glossary & guides
- [ ] What exact claim can this tiny fixture disprove?
- [ ] Which baseline prevents a decorative success claim?
- [ ] What result would make me stop before implementation?
- [ ] Can every answer be traced to one retrieved note or an abstention?