First, we focus on calculating C known (w, t).
if a word w appears C(w) times in the raw corpus, and is seen with |TD(w)| tags in the tag dictionary, then assume for each t in TD(w): and C known (w, t) = 0 for all other t. we split C(w), the count of w tokens in the corpus, evenly among each of w's possible tags.