Matching is deterministic code, not more AI
- Decision
- The vision model only reads spines. Matching against Google Books is a pure, unit-tested function that scores candidates by edit distance and word overlap, with explicit thresholds for matched (0.8) and needs review (0.45).
- Why
- Ranking rules that live in code can be tested, explained and tuned. Google’s own result order is not trusted: a test pins that behaviour.
- Trade-off
- Fixed thresholds will misjudge some edge cases that a model might have handled. Fallback queries and the review step absorb those.
- Outcome
- The same matcher serves the scan and Search again, so a manual retry behaves exactly like the original read.