What does Readable Monographs, Weighed conclude, in numbers, about “The Structure Mapping of Metaphor: Relational Consistency, Systematicity and a Permutation Test for Lucky Fit”?

Answer: Chapter 3 scores metaphors by structure mapping: a highway convoy reaches a consistency of 1.000 with the noisy-channel theorem, the telephone game only 0.143.

Scope of the numbers: Its parameters are illustrative; all calculations are generated by its programs; it is not legal advice and not personalised business or financial advice. Marked boxes separate published evidence, runnable Python calculations (21 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.143, 1.000

metaphorbasematchedconsistencyleakreadings
highway convoy871.0000.1251
water pipe640.5710.3331
noisy party530.4290.4001
telephone game310.1430.6671
target relations: 7
Show the full program
# 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)))

Single source and citation

Fan, Y. (2026). Information-Theoretic Rhetoric of Bestselling Monographs, Concrete Metaphor Mapping of Hard Formulas and the Chapter-End Suspense Engine (Version 1.0.0), Chapter 3: The Structure Mapping of Metaphor: Relational Consistency, Systematicity and a Permutation Test for Lucky Fit. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 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}
}

Other chapter answers in this book