Programmer.ieTechnical library for the AI era
  • Home
  • Books
  • Examples
  • Solutions
  • Learn
  • Prompts
  • Articles
  • Search
  • About
English简体中文

Retrieval

  • The Information Selection Problem
  • What Remembering Means
  • Documents, Identity, and Provenance
  • Building an Inverted Index
  • BM25: Ranking with Terms
  • The First Search Baseline
  • Parsing, Chunking, and Retrieval Units
  • Dense Retrieval without Re-teaching Embeddings
  • Exact Search, ANN, and Index Choice
  • Filters, Scope, and Freshness
  • From Similarity to Search
  • Semantic Failure Analysis and Hard Negatives
  • Candidate Generation as a Pipeline
  • Hybrid Search and Reciprocal Rank Fusion
  • Retrieval From First Principles
  • Learned Sparse and Multi-Vector Retrieval
  • Rerankers and Cross-Encoders
  • Bring Back Only What You Need
  • Context Is a Bottleneck
  • Diversity, Coverage, and Evidence Budgets
  • Understanding Queries and Routing
  • Search, Memory and Long Context
  • Query Rewriting and Expansion
  • Decomposition and Multi-Hop Retrieval
  • Hierarchical and Parent-Child Retrieval
  • Graph and Structured Retrieval
  • Decisions Cannot Read Everything
  • Bounded Adaptive Retrieval: When to Stop
  • Embeddings as Candidate Generation
  • Relevance Judgments and Test Collections
  • Retrieval Is Not Geometry
  • Metrics that Answer Different Questions
  • Controlled Experiments and Regression Gates
  • Latency, Cost, and Operational Reliability
  • Does Better Retrieval Improve the Task?
  • The Reference Retrieval Contract
  • Defending the Retrieval Boundary
  • Improve and Writer: A Real Retrieval Workflow
  • What We Can Now Prove
  • RELATE: Searching Embeddings by Relation, Not Just Similarity
Programmer.ie

Technical library for the AI era

Understand what is changing. Learn how it works. Use it.

© 2026 Ernan Hughes
  • Home
  • Books
  • Examples
  • Solutions
  • Learn
  • Prompts
  • Articles
  • Search
  • About