Hello,
I have a question about the p(e|f) probabilities in a string-to-tree system:
In the example below, the source-side strings "according to your [X][nn]"
and
"according to your [X][cnp]" are counted as different source-side phrases.
(The probabilities for the source-side string "according to your [X][nn]"
sum up to
1, and the source-side string "according to your [X][cnp]" has a
translation probability
of 1)
according to your [X][cnp] [X] ||| entsprechend ihrem [X][cnp]
[pp_entsprechend] ||| 1 0.000385979 1 0.00100755
according to your [X][nn] [X] ||| entsprechend ihren [X][nn]
[pp_entsprechend] ||| 0.05 0.000257047 0.166667 0.00130635
according to your [X][nn] [X] ||| laut auskunft ihrer [X][nn] [pp_laut] |||
1 0.00240725 0.166667 7.00232e-06
according to your [X][nn] [X] ||| nach ihrem [X][nn] [pp_nach] |||
0.0416667 0.000267865 0.5 0.008985
according to your [X][nn] [X] ||| nach ihren [X][nn] [pp_nach] |||
0.0217391 0.000178388 0.166667 0.0116496
To my understanding, the target-side non-terminals are copied to the
source-side string for technical reasons only in a string-to-tree system:
shouldn't then source-side strings as in the example
above be counted as one string ("according to your [X]") instead of
differentiating between
"according to your [X][cnp]" and "according to your [X][nn]" ?
Thank you in advance for helping with this,
Marion
_______________________________________________
Moses-support mailing list
[email protected]
http://mailman.mit.edu/mailman/listinfo/moses-support
