Hi Hieu, Thank you very much for your answer.
>> Or could labels overlap in a way which is not compatible with a single >> tree structures? For instance: >> >> <tree label="NP" span="0-2"/> >> <tree label="DET" span="0-0"/> >> <tree label="N1" span="1-2"/> >> <tree label="N2" span="0-1"/> >> <tree label="ADJ" span="2-2"/> >> la bruja verde > yep. During decoding, it will either of the incompatible labels, but not > both labels. I understand that during decoding all of the rules learned from the incompatible spans will be considered, and of course only one finally used when producing a translation. > Note: the tree-to-* doesn't build trees on the source side, it just uses > the source labels as conditions when apply the translation rules. Ok, but the application of the translation rules ends up producing kind of a tree or a set of trees (thanks to the glue rules) when a complete tree cannot be build. Am I right? > Exact definition of the 'tree'-to-* decoding algorithm is in my big > writeup, section 4.2.8 > http://www.statmt.org/~s0565741/ddd.pdf Thanks for the pointer. Cheers -- Felipe > > > _______________________________________________ > Moses-support mailing list > [email protected] > http://mailman.mit.edu/mailman/listinfo/moses-support > -- Felipe Sánchez Martínez Dep. de Llenguatges i Sistemes Informàtics Universitat d'Alacant, E-03071 Alacant (Spain) Tel.: +34 965 903 400, ext: 2966 Fax: +34 965 909 326 http://www.dlsi.ua.es/~fsanchez _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
