关于「东西方原典考辨:马尔可夫的《奥涅金》字母链与《鬼谷子·揣篇》」,《隐马尔可夫与客户决策阶段》给出的定量结论是什么?
结论:第七章考辨马尔可夫 1913 年的《奥涅金》字母链(平稳元音比例 0.4319)与《鬼谷子·揣篇》(一次点击只携带 0.2680 比特)。
数据口径:书中阶段、页面类型与全部概率均为示意;全部计算由书中程序生成;本书是非个人化经营建议,只使用站内匿名化与客户同意的数据,不跨站追踪,不推断敏感属性,阶段解码不用于施压、差别定价或主动联系客户,紧迫感只来自真实库存与真实截止。 第一章在示意参数下量出:前向滤波的四分类准确率比最后一次点击高 0.0410,就绪判别从 0.6990 提高到 0.7630;增益随阶段黏性与页面区分力在 0.0307 到 0.1187 之间变化,维特比最后一格在页面模糊时反而低 0.1007。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.4319
| pairs: VV 1104 VC 7534 CV 7535 CC 3827 (total 20000) | |
| P(vowel) | 0.4319 |
| P(vowel | vowel) | 0.1278 P(vowel | consonant) = 0.6632 |
| stationary vowel share of the chain | 0.4319 |
| expected VV if letters were independent | 3730.8 |
| chi-square (1 df) | 5732.4, phi = -0.5354 |
| mean vowel run 1.147 letters, consonant run 1.508 letters | |
| next-letter class guessed right: share alone 0.5681, chain 0.7534 | |
| entropy per letter class | 0.9866 bits alone, 0.7618 given previous |
| information carried by the previous letter | 0.2248 bits |
查看完整验算程序
# Chapter 7. p71: Markov's 1913 count of vowels and consonants.
# Data: the counts Markov reported for the first 20,000 letters of
# Pushkin's Eugene Onegin, as given in the 2006 English translation and
# in Hayes (2013): 8,638 vowels, 11,362 consonants; 1,104 vowel-vowel
# pairs and 3,827 consonant-consonant pairs. The two mixed pair counts
# follow from the totals (the text treated as one closed ring of
# 20,000 pairs). Computed: the two-state chain, its stationary vowel
# share, a chi-square test of independence, mean run lengths, and how
# well each model predicts the next letter's class.
import math
N, V, C = 20000, 8638, 11362
VV, CC = 1104, 3827
VC = V - VV
CV = C - CC
p_v = V / N
p_vv = VV / V
p_cv = CV / C
print("pairs: VV %d VC %d CV %d CC %d (total %d)"
% (VV, VC, CV, CC, VV + VC + CV + CC))
print("P(vowel) = %.4f" % p_v)
print("P(vowel | vowel) = %.4f P(vowel | consonant) = %.4f"
% (p_vv, p_cv))
stat = p_cv / (p_cv + (1 - p_vv))
print("stationary vowel share of the chain: %.4f" % stat)
obs = [[VV, VC], [CV, CC]]
rows, cols = [V, C], [V, C]
chi = math.fsum((obs[i][j] - rows[i] * cols[j] / N) ** 2
/ (rows[i] * cols[j] / N) for i in range(2) for j in range(2))
phi = (VV * CC - VC * CV) / math.sqrt(V * C * V * C)
print("expected VV if letters were independent: %.1f" % (V * V / N))
print("chi-square (1 df) = %.1f, phi = %.4f" % (chi, phi))
print("mean vowel run %.3f letters, consonant run %.3f letters"
% (1 / (1 - p_vv), 1 / (1 - (1 - p_cv))))
acc_marg = max(V, C) / N
acc_chain = (VC + CV) / N
print("next-letter class guessed right: share alone %.4f, chain %.4f"
% (acc_marg, acc_chain))
def h(ps):
return -math.fsum(p * math.log2(p) for p in ps if p > 0)
h0 = h([p_v, 1 - p_v])
h1 = p_v * h([p_vv, 1 - p_vv]) + (1 - p_v) * h([p_cv, 1 - p_cv])
print("entropy per letter class: %.4f bits alone, %.4f given previous"
% (h0, h1))
print("information carried by the previous letter: %.4f bits" % (h0 - h1))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《隐马尔可夫维特比解码、浏览点击序列反推客户隐藏决策阶段与出手时机母典》第 7 章「东西方原典考辨:马尔可夫的《奥涅金》字母链与《鬼谷子·揣篇》」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-300 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026300,
author = {Fan, Yafu},
title = {Hidden Markov Models and Viterbi Decoding: Inferring a Customer's Hidden Decision Stage from Click Sequences and Timing the Offer},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}