To relax this restriction, we will allow A(c|f ) ∈ [0, 1] and encourage A to correspond to a mapping by adding an entropy regularization term: This term receives its minimal value when the conditional probability of the universal tags given a language-specific tag is 1 for one universal tag and zero for the others.
we measure mapping quality based on the target language parsing accuracy.