What does Three-Way Brand Collision Pre-Screening conclude, in numbers, about “A Pre-Screening Loop for New Brand Names, and a Plan to Refute the Book”?
Answer: Chapter 8 gives a seven-step pre-screening procedure for new brand names, the distilled Brand Name Collision Pre-Screener and a pre-registered test whose primary comparison needs about 1820 name pairs, stating which results would overturn the central claim. Marked boxes separate published evidence, runnable Python calculations (18 programs), classical sources and the author's hypotheses.
Scope of the numbers: In an illustrative model, with the sound channel at eight tenths, the AUC of the sound code is 0.851 against 0.817 for letter edit distance. Parameters are illustrative; all calculations are generated by the book's programs; the book is general analysis, not individualised legal advice, and judgements of trademark similarity rest with official searches in each jurisdiction and professional agents.
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: 1820
| planning AUC sound 0.776 | shape 0.709 | confusion share 0.171 | |
| power | pairs | confused | simulated power (400 runs) |
| 0.80 | 1820 | 311 | 0.825 |
| 0.90 | 2440 | 417 | 0.938 |
Show the full program
# Chapter 8. p82: how many rated name pairs the pre-registered test needs.
# Model: the test asks whether the AUC of sound similarity exceeds the
# AUC of shape similarity in a mixed-channel panel. Planning values
# are the p61 results (0.776 and 0.709) and its confusion share
# (684 of 4000). Standard error of each AUC by Hanley and McNeil
# (1982); the two AUCs are treated as independent, which ignores
# their positive correlation and so overstates the n needed. A
# binormal simulation (fixed seed, 400 runs) checks the power.
import math
import random
from statistics import NormalDist
A1, A2 = 0.776, 0.709
PREV = 684 / 4000
Z = NormalDist()
def se(a, n1, n0):
q1, q2 = a / (2 - a), 2 * a * a / (1 + a)
v = math.fsum([a * (1 - a), (n1 - 1) * (q1 - a * a),
(n0 - 1) * (q2 - a * a)]) / (n1 * n0)
return math.sqrt(v)
def need(power, alpha=0.05):
za, zb = Z.inv_cdf(1 - alpha / 2), Z.inv_cdf(power)
n = 50
while True:
n1 = round(n * PREV)
n0 = n - n1
s = math.hypot(se(A1, n1, n0), se(A2, n1, n0))
if (A1 - A2) / s >= za + zb:
return n, n1
n += 10
def auc(pos, neg):
allv = sorted([(v, 1) for v in pos] + [(v, 0) for v in neg])
ranks = [i + 1.0 for i, (v, y) in enumerate(allv) if y]
n1, n0 = len(pos), len(neg)
return (math.fsum(ranks) - n1 * (n1 + 1) / 2.0) / (n1 * n0)
def sim_power(n, n1, runs, rng):
m1 = math.sqrt(2) * Z.inv_cdf(A1)
m2 = math.sqrt(2) * Z.inv_cdf(A2)
za, hits = Z.inv_cdf(0.975), 0
for _ in range(runs):
n0 = n - n1
a = auc([rng.gauss(m1, 1) for _ in range(n1)],
[rng.gauss(0, 1) for _ in range(n0)])
b = auc([rng.gauss(m2, 1) for _ in range(n1)],
[rng.gauss(0, 1) for _ in range(n0)])
s = math.hypot(se(a, n1, n0), se(b, n1, n0))
if (a - b) / s >= za:
hits += 1
return hits / runs
if __name__ == "__main__":
print("planning AUC sound {} shape {} confusion share {:.3f}"
.format(A1, A2, PREV))
rng = random.Random(20261113)
print("power pairs confused simulated power (400 runs)")
for pw in (0.80, 0.90):
n, n1 = need(pw)
print("{:.2f} {:7d} {:9d} {:12.3f}".format(
pw, n, n1, sim_power(n, n1, 400, rng)))Single source and citation
Fan, Y. (2026). Phonetic, Graphic and Semantic Distance between Trademarks: Pre-Screening Brand-Name Collisions from Fanqie Spellings to Sound Codes (Version 1.0.0), Chapter 8: A Pre-Screening Loop for New Brand Names, and a Plan to Refute the Book. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-317 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026317,
author = {Fan, Yafu},
title = {Phonetic, Graphic and Semantic Distance between Trademarks: Pre-Screening Brand-Name Collisions from Fanqie Spellings to Sound Codes},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Far in Spelling, Near in Sound: Edit Distance, Sound Skeletons and the Channels of Confusion
- Chapter 2 · Soundex: a Century-Old Sound Code, Too Wide and Too Narrow
- Chapter 3 · Initial, Final and Tone: a Distance for Chinese Syllables and Homophones across Languages
- Chapter 4 · Component Distance: a Table of Look-Alike Characters and Unicode Normalisation
- Chapter 5 · Meaning and a Three-Way Score: How a Weighted Mean Dilutes a One-Dimension Collision
- Chapter 6 · ROC Curves and Thresholds: Making the Pre-Screen a Calibrated Classifier
- Chapter 7 · East and West in the Sources: the Preface to the Qieyun and Russell's Patent of 1918