关于「隐喻的结构映射:关系一致度、系统性与偶然拟合的置换检验」,《专著可读性的可证伪称量》给出的定量结论是什么?
结论:第三章用结构映射给比喻打分,公路车队对噪声信道定理的一致度是 1.000,传话游戏只有 0.143。
数据口径:书中参数为示意;全部计算由书中程序生成;本书不是法律意见,也不是个人化的商业或财务建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(21 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.143, 1.000
| metaphor | base | matched | consistency | leak | readings |
|---|---|---|---|---|---|
| highway convoy | 8 | 7 | 1.000 | 0.125 | 1 |
| water pipe | 6 | 4 | 0.571 | 0.333 | 1 |
| noisy party | 5 | 3 | 0.429 | 0.400 | 1 |
| telephone game | 3 | 1 | 0.143 | 0.667 | 1 |
| target relations: 7 |
查看完整验算程序
# Chapter 3. p31: structure-mapping scores of four metaphors for the
# noisy-channel theorem.
# Model (after Gentner 1983): a domain is a set of relations
# (predicate, x, y). A metaphor is a one-to-one map from base objects
# to target objects; its score is the number of base relations whose
# image is a target relation. Consistency = matched / target relations;
# leak = unmatched base relations / base relations (projections the
# reader may wrongly carry over). The best map is found by exhaustive
# search over partial one-to-one maps; "readings" counts the distinct
# ways to realise the best score (restricted to the objects that match),
# a gauge of ambiguity. Domains are hand-coded for this book.
import itertools
TARGET = {
("carries", "channel", "message"), ("corrupts", "noise", "message"),
("limits", "channel", "rate"), ("reduces", "redundancy", "error"),
("lowers", "redundancy", "rate"), ("causes", "noise", "error"),
("raises", "rate", "error"),
}
T_OBJ = ["message", "channel", "noise", "redundancy", "error", "rate"]
BASES = {
"highway convoy": {
("carries", "road", "cargo"), ("corrupts", "fog", "cargo"),
("limits", "road", "traffic"), ("reduces", "spare truck", "loss"),
("lowers", "spare truck", "traffic"), ("causes", "fog", "loss"),
("raises", "traffic", "loss"), ("blocks", "fog", "road"),
},
"water pipe": {
("carries", "pipe", "water"), ("limits", "pipe", "flow"),
("causes", "leak", "loss"), ("raises", "flow", "loss"),
("pushes", "pressure", "water"), ("bursts", "pressure", "pipe"),
},
"noisy party": {
("carries", "air", "words"), ("corrupts", "chatter", "words"),
("causes", "chatter", "mishearing"), ("repeats", "you", "words"),
("annoys", "you", "friend"),
},
"telephone game": {
("corrupts", "child", "whisper"), ("laughs", "child", "child"),
("annoys", "whisper", "teacher"),
},
}
def best_map(base):
objs = sorted({o for _, x, y in base for o in (x, y)})
best, ties = -1, set()
for img in itertools.product(T_OBJ + ["-"], repeat=len(objs)):
real = [t for t in img if t != "-"]
if len(set(real)) != len(real):
continue
m = dict(zip(objs, img))
good = [(x, y) for p, x, y in base if (p, m[x], m[y]) in TARGET]
used = sorted({o for pair in good for o in pair})
key = tuple((o, m[o]) for o in used)
if len(good) > best:
best, ties = len(good), {key}
elif len(good) == best:
ties.add(key)
return best, len(ties)
print("metaphor base matched consistency leak readings")
for name, base in BASES.items():
hits, ties = best_map(base)
print("{:<14s} {:4d} {:7d} {:11.3f} {:5.3f} {:8d}".format(
name, len(base), hits, hits / len(TARGET),
(len(base) - hits) / len(base), ties))
print("target relations: {}".format(len(TARGET)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《畅销专著修辞信息论、硬核公式具象隐喻映射与章末悬念母机》第 3 章「隐喻的结构映射:关系一致度、系统性与偶然拟合的置换检验」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-149 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026149,
author = {Fan, Yafu},
title = {Information-Theoretic Rhetoric of Bestselling Monographs, Concrete Metaphor Mapping of Hard Formulas and the Chapter-End Suspense Engine},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}