The testing algorithm is similar to that described in Section 3.2, except that the probability of a word being assigned a POS tag t is estimated by the product of the probability of its individual characters being assigned the same POS tag t. For example, when estimating the probability of "新华社" being tagged NR, we find the product of the probability of "新" being tagged NR, "华" being tagged NR, and "社" being tagged NR.
we enforce the constraint that all characters within a segmented word in the presegmented input sentence must have the same POS tag.