Read, James C <jcread@...> writes: > > Actually the approximation I expect to be: > > p(e|f)=p(f|e) > > Why would you expect this to give poor results if the TM is well trained? Surely the results of my filtering > experiments provve otherwise. > > James
I recommend you read the following: https://en.wikipedia.org/wiki/Confusion_of_the_inverse you don't explain which score you use for filtering (do you take one of the scores, their sum, their product, or something else?), but I expect you (mostly) keep the phrase pairs with a high p(e|f), which is the best thing to do when you don't have a language model. _______________________________________________ Moses-support mailing list Moses-support@mit.edu http://mailman.mit.edu/mailman/listinfo/moses-support
