In other words, the set of hidden states F was chosen to be the fine set of treebank tags.
the number of fine tags varied across languages for our experiments; however, one could as well have fixed the set of HMM states to be a constant across languages, and created one mapping to the universal POS tagset.