Hi, I'm not sure if there is an easy way to do this. On the other hand, a word alignment model that does not have reorderings should be much simpler, it should be possible to implement a polynomial algorithm to do exhaustive EM.
-phi On Tue, Jun 24, 2008 at 7:44 PM, J. Scott Olsson <[EMAIL PROTECTED]> wrote: > My language pair is constrained to never have reorderings (alignments > never cross). Anyone have suggestions > for what I should muck with to impose such a constraint in GIZA++? > I've been familiarizing myself with the code, but haven't yet > found the surely easy way to do this. > > pax, > Scott > _______________________________________________ > Moses-support mailing list > [email protected] > http://mailman.mit.edu/mailman/listinfo/moses-support > > _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
