Similarity Heuristic
Updated 2026-08-13
INTRODUCTION
English translation pending.
CORE DEFINITION
A heuristic in which judgments of likelihood or category membership are based on how closely a case resembles a prototype. It is closely related to the representativeness heuristic described by Amos Tversky and Daniel Kahneman, which produces systematic errors because resemblance is not the same as probability. The qualification is that the heuristic is often accurate and fast, and that its errors appear mainly when base rates are extreme or when resemblance and probability diverge. Its main failure mode is neglecting prior probability.
SCAFFOLDING EFFECT
Reduce cognitive load
- Resemblance check: notice when a judgment is being driven by how typical the case looks. - Base-rate retrieval: ask how common the category actually is before judging membership. - Divergence test: check whether resemblance and probability point to different answers here.
Anchor fast decisions
Resemblance is available immediately while base rates must be recalled or estimated, so the faster signal dominates unless it is deliberately overridden. Because prototype resemblance tracks probability in many ordinary situations, the shortcut usually works, and its failures concentrate in cases where the prior probability is extreme, which is exactly where the shortcut is least likely to be questioned.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Similarity_heuristicverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS