01 / PLAIN LANGUAGE
- 01
- 02
- 03
- 04
- ×
- ×
- ×
- ✓
02 / MATHEMATICAL FORM
Definition 1
N(j) = Σi∈C n(i,j)
G(i,j) = 1 ⇔ n(i,j) > N(j)2, j ∉ Jspecial
Definition 2
w(i,j) = 1 + n(i,j)
P(i|j) = w(i,j)Σk∈A(j) w(k,j)
Algorithm 1
Xa ← Expand(R, context, a)W ← Σi wiL ← B − (B mod W)repeat until Xa < Lq ← Xa mod Wselect min k : q < Σi≤k wi
Algorithm 2
KOB RULES→OPTIONAL SPECIAL→G(i,j)→P₁→P₂→P₃→REMAINDER