It is analogous to the step in other translation model induction algorithms that sets all probabilities below a certain threshold to negligible values ( Brown et al. , 1990 ; Dagan et al. , 1993 ; Chen , 1996 ) .
robust word alignment for machine aided translationquot
I Dagan K Church SZ W Gale
This step significantly reduces the computational burden of the algorithm . It is analogous to the step in other translation model induction algorithms that sets all probabilities below a certain threshold to negligible values ( Brown et al. , 1990 ; Dagan et al. , 1993 ; Chen , 1996 ) . To retain word type pairs that are at least twice as likely to be mutual translations than not , the threshold can be raised to 2 .
It is analogous to the step in other translation model induction algorithms that sets all probabilities below a certain threshold to negligible values ( Brown et al. , 1990 ; @@CITATION ; Chen , 1996 ) .