Hello, I wanted to understand grow-diag() algorithm described here: http://www.statmt.org/moses/?n=FactoredTraining.AlignWords , in order to check where the script generates non-distinct alignment pairs ( I mean: 1-2 1-3 2-3 is non-distinct; 1-2 2-2 1-3 2-3 ( and no more with these words) is a distinct pairing)
in this description there is a line: if ( e-new not aligned and f-new not aligned ) It would mean that we can add new aligns only if both of new words weren't covered before by the alignment (and so, only distinct pairs would have been generated). But in the source code (symal.cpp) these are the corresponding lines: //check if it connects at least one uncovered word if (!(ea[point.first] && fa[point.second])) So i think the description of this algorithm is not fully proper. I'm not absolutely sure, but its worth a review. Btw, any comments to my original intentions regarding to distinct pairing are appreciated. Thank you! Br, Attila _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
