What does Compliant Rewriting of Absolute Terms conclude, in numbers, about “Eastern and Western Sources: "If Names Are Not Correct" and Orwell's Rules for Writing”?
Answer: Confucius's "if names are not correct, speech does not flow" rightly makes the name the precondition of speech. Program p71 turns it into a name-reality gap: three of eight illustrative lines have one, and an absolute name cannot be closed even by third-party evidence, only rewritten. Where Confucius goes too far is in presenting a probabilistic chain of six links as necessary, without any sense of degree. Xunzi's "settled by agreement and custom" explains why the lexicon must be kept by meaning, and his "direct, easy and not contrary" reminds us that rewrites must still read well. Orwell calls empty words meaningless, and in program p72 the rewrites replace 7 puffery words with 5 facts; but his "cut what can be cut" and "short rather than long" do not hold for compliant rewriting, because facts take more room than empty words. The classics give a direction. The next chapter turns it into a procedure that can be run every week and a test plan that can be refuted.
Scope of the numbers: Its lexicons, copy, facts and parameters are illustrative; all calculations are generated by its programs; it is not individual legal advice and supplies no way of slipping past platform review. Marked boxes separate published evidence, runnable Python calculations (18 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.
| line | claim | ev gap | action | |
| ding ji zhen pi bao | absolute | 2 | 1 | rewrite |
| quan wang zui di jia | absolute | 1 | 2 | rewrite |
| geng nai mo de pi liao | comparative | 0 | 1 | add basis |
| bi shang dai kuan qing 80 ke | comparative | 1 | 0 | keep |
| dao shou jia 1299 yuan | quantified | 1 | 0 | keep |
| jin jiu shi tian fu gou lv 0.18 | quantified | 1 | 0 | keep |
| ping fen 4.8 gong 1236 tiao ping jia quantified | 2 | 0 | keep | |
| niu pi shou ti bao | plain | 0 | 0 | keep |
| lines with a gap: 3 of 8 | ||||
| absolute lines with third-party evidence still have gap 1 |
Show the full program
# Chapter 7. p71: "if names are not correct" as a claim-evidence gap.
# Model: the name a line gives its product (claim strength) must be
# matched by what the shop can show (evidence). Strength: 3 absolute,
# 2 unqualified comparative, 1 quantified fact, 0 plain description.
# Evidence: 0 none, 1 the shop's own records, 2 records held by a third
# party or a published standard. Required evidence: absolute = 3 (more
# than any record can give, so an absolute line can never be squared),
# comparative = 1 plus a named basis, quantified fact = 1,
# description = 0. Gap = max(0, required - evidence). Lines are
# illustrative pinyin, one syllable per Chinese character.
LINES = [("ding ji zhen pi bao", 3, 2),
("quan wang zui di jia", 3, 1),
("geng nai mo de pi liao", 2, 0),
("bi shang dai kuan qing 80 ke", 2, 1),
("dao shou jia 1299 yuan", 1, 1),
("jin jiu shi tian fu gou lv 0.18", 1, 1),
("ping fen 4.8 gong 1236 tiao ping jia", 1, 2),
("niu pi shou ti bao", 0, 0)]
REQ = {3: 3, 2: 1, 1: 1, 0: 0}
NAME = {3: "absolute", 2: "comparative", 1: "quantified", 0: "plain"}
print("line claim ev gap action")
need = 0
for text, st, ev in LINES:
gap = max(0, REQ[st] - ev)
if st == 3:
act = "rewrite"
elif gap:
act = "add basis"
else:
act = "keep"
if gap:
need += 1
print("%-36s %-12s %2d %3d %s" % (text, NAME[st], ev, gap, act))
print("lines with a gap: %d of %d" % (need, len(LINES)))
print("absolute lines with third-party evidence still have gap %d"
% (REQ[3] - 2))Single source and citation
Fan, Y. (2026). Compliant Rewriting for Platform-Sensitive Terms: Absolute-Term Automata under the Advertising Law, Meaning-Preserving Rewrites and Conversion Elasticity (Version 1.0.0), Chapter 7: Eastern and Western Sources: "If Names Are Not Correct" and Orwell's Rules for Writing. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-274 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026274,
author = {Fan, Yafu},
title = {Compliant Rewriting for Platform-Sensitive Terms: Absolute-Term Automata under the Advertising Law, Meaning-Preserving Rewrites and Conversion Elasticity},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · The Risk Ledger of an Absolute Term: How Much Conversion Must One "Best" Buy?
- Chapter 2 · One Pass for Every Term: the Aho-Corasick Multi-Pattern Automaton
- Chapter 3 · False Kills and Misses: Exempt Contexts, Audit Additions and Audit Sample Sizes
- Chapter 4 · Choosing Rewrites under Constraints: Evidence, Re-scanning and Title Length
- Chapter 5 · Keeping the Meaning: Why Surface Similarity Rewards the Violation
- Chapter 6 · Conversion Elasticity: How Much Does a Rewrite Move Conversion, and Can a Test Tell?
- Chapter 8 · Closing the Loop: a Compliant-Rewrite Library for the Persuasive-Copy Checker, and a Non-Inferiority Test