For each word type w ∈ [n], there is a unique hidden state H(w) ∈ [m] such that o(w|H(w)) > 0 and o(w|h) = 0 for all h = H(w).
this model is an HMM in which observation states are partitioned by hidden states.