In other words, the set of hidden states F was chosen to be the fine set of treebank tags.
for seven out of eight languages a threshold of 0.2 gave the best results for our final model, which indicates that for languages without any validation set, τ = 0.2 can be used.