In the case of unsupervised HMM taggers, the lexicon provides constraints on the probability tables p(w i |t i ) and p(t i |t i−1 , t i−2 ).
the lexical probability table is initialized such that p(w i |t i ) = 0 if and only if tag t i is not included in the POS-set of word w i .