5D Library › Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs · 中文
Chapter 6. The Barnum Effect: a Coverage Model and Selective Recall
Forer’s classroom demonstration
In 1948 Forer gave his students a “personality test” and then handed each of them a “personal” sketch; in fact everyone received the same text, assembled from a book of horoscopes, and the students generally rated it as highly accurate (Forer 1949). Many later studies confirmed that vague, positive descriptions that seem personal are widely accepted, which is called the Barnum effect or the fallacy of personal validation (Dickson and Kelly 1985). This chapter uses two simple models to show why it must appear in any reading.
A coverage model
Let a statement fit a fraction of all situations. A listener checks it against independent episodes of their own life and accepts it if any one matches, with probability .
Calculation
# Chapter 6. p13: Why vague statements "fit" - a coverage model.
# A statement fits a fraction f of situations. A listener checks it
# against M independent episodes of their own life and accepts it if
# any one matches: P(accept) = 1 - (1 - f)^M. Vagueness and a rich
# memory together push acceptance towards 1. A statement that fits
# everyone equally cannot tell one person's reading from another's:
# in a choice among k readings the chance of picking one's own stays 1/k.
if __name__ == "__main__":
fs = (0.02, 0.05, 0.10, 0.20, 0.50)
Ms = (1, 5, 10, 30)
print(" f \\ M " + "".join("{:>8d}".format(m) for m in Ms))
for f in fs:
print(" {:5.2f} ".format(f) + "".join(
"{:8.3f}".format(1 - (1 - f) ** m) for m in Ms))
f, M, k = 0.10, 10, 10
p = 1 - (1 - f) ** M
print("\n a reading of {} statements with f = {:.2f}, M = {}:".format(
k, f, M))
print(" expected statements accepted: {:.2f} of {}".format(k * p, k))
print(" the same reading given to anyone else: {:.2f} of {}".format(
k * p, k))
for choices in (2, 3, 4):
print(" own reading picked out of {}: {:.4f} (chance)".format(
choices, 1 / choices))
for fs_ in ((0.10, 0.02), (0.30, 0.02)):
own = 1 - (1 - fs_[0]) ** M
other = 1 - (1 - fs_[1]) ** M
print(" specific statement, fits owner {:.2f} / others {:.2f}:"
" accept {:.3f} vs {:.3f}".format(fs_[0], fs_[1], own, other))
# f \ M 1 5 10 30
# 0.02 0.020 0.096 0.183 0.455
# 0.05 0.050 0.226 0.401 0.785
# 0.10 0.100 0.410 0.651 0.958
# 0.20 0.200 0.672 0.893 0.999
# 0.50 0.500 0.969 0.999 1.000
#
# a reading of 10 statements with f = 0.10, M = 10:
# expected statements accepted: 6.51 of 10
# the same reading given to anyone else: 6.51 of 10
# own reading picked out of 2: 0.5000 (chance)
# own reading picked out of 3: 0.3333 (chance)
# own reading picked out of 4: 0.2500 (chance)
# specific statement, fits owner 0.10 / others 0.02: accept 0.651 vs 0.183
# specific statement, fits owner 0.30 / others 0.02: accept 0.972 vs 0.183A statement with is accepted with probability 0.100 when checked against one episode, 0.651 against 10 and 0.958 against 30; with , ten episodes already give 0.893. A person’s memory holds far more than 30 episodes to check against. A reading of 10 statements with has 6.51 statements accepted on average at , and exactly the same number when the reading is given to anyone else. So if people are asked to pick out their own reading from several, vague statements can only produce chance: 0.5000 out of two, 0.3333 out of three, 0.2500 out of four.
Only specific statements can discriminate: if a statement fits the person concerned with probability 0.10 and others with probability 0.02, acceptance is 0.651 against 0.183, and that is a difference that can be tested.
Selective recall and retrofitting
The second mechanism works after the reading. Let each statement be true by chance with probability ; a hit is remembered with probability , a miss with probability ; and a miss may be reinterpreted afterwards as having “come true in another way” with probability . Remembered accuracy is
Calculation
# Chapter 6. p14: Remembered accuracy - selective recall and retrofitting.
# Each of 10 statements in a reading is true by chance with probability h.
# Afterwards a hit is remembered with probability a, a miss with
# probability b < a, and a miss may be reinterpreted as a hit ("it came
# true in another way") with probability q. Remembered accuracy:
# (h a + (1 - h) b q) / (h a + (1 - h) b).
# A simulation with a fixed seed checks the formula.
import random
def remembered(h, a, b, q):
hit = h * a + (1 - h) * b * q
return hit / (h * a + (1 - h) * b)
if __name__ == "__main__":
a, b = 0.9, 0.4
print(" chance hit rate h q = 0.0 q = 0.2 q = 0.4")
for h in (0.2, 0.3, 0.5):
print(" {:17.2f} {:7.3f} {:7.3f} {:7.3f}".format(
h, *(remembered(h, a, b, q) for q in (0.0, 0.2, 0.4))))
rng = random.Random(71014)
h, q, T = 0.3, 0.2, 100000
num = den = 0
for _ in range(T):
for _ in range(10):
true = rng.random() < h
if rng.random() < (a if true else b):
den += 1
num += true or rng.random() < q
print(" simulation, h = 0.30, q = 0.20: {:.3f} (formula {:.3f})".format(
num / den, remembered(h, a, b, q)))
print(" readings with 5+ chance hits of 10 at h = 0.30: {:.4f}".format(
sum(__import__("math").comb(10, k) * h ** k * (1 - h) ** (10 - k)
for k in range(5, 11))))
# chance hit rate h q = 0.0 q = 0.2 q = 0.4
# 0.20 0.360 0.488 0.616
# 0.30 0.491 0.593 0.695
# 0.50 0.692 0.754 0.815
# simulation, h = 0.30, q = 0.20: 0.592 (formula 0.593)
# readings with 5+ chance hits of 10 at h = 0.30: 0.1503With a chance hit rate of 0.30, selective recall alone lifts remembered accuracy to 0.491; adding a reinterpretation probability of 0.2 lifts it to 0.593 (simulation 0.592). With a chance hit rate of 0.50 the two values are 0.692 and 0.754. Moreover, even when each statement has only a 0.30 chance of being true, readings in which five or more of ten statements “hit” make up 0.1503 of all readings, and these are the readings most easily remembered and retold.
Hypothesis · not established
The author’s hypothesis (not yet tested): a person’s rating of the accuracy of a reading after the event is decided mainly by the vagueness of its statements and by selective recall, not by the cards. What would show it wrong: if, in the blind matching test of Chapter 8, people pick out their own reading significantly more often than chance, and still do so in a version that keeps only specific statements, the hypothesis fails.
Summary
Vague statements are almost bound to be accepted against a rich memory, and accepted equally by anyone, so they cannot tell whom a reading is about; selective recall and retrofitting then raise remembered accuracy further. The right way to test readings is not to ask “was it accurate?” but blind matching.
References
Fan, Y. (2026). Tarot Hypergeometric Sampling, Lenormand Grid Topology and Kabbalistic Tree Graphs: Reversal Binomial Mixtures, Grand-Tableau Manhattan Distances and Twenty-Two-Edge Spectral Centrality [塔罗超几何抽样、雷诺曼网格拓扑与卡巴拉生命树图论] (Version 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090191 · Licensed under Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0).