Thanks, Phil. I had forgotten about the "distinct" option, so this was very helpful, even if it's a bit slow. It's alright for us.
On Wed, Mar 11, 2015 at 6:56 PM, Philip Williams <[email protected]> wrote: > Hi Chris, > > if you add the argument "distinct" to the -n-best-list option then that > should have the same effect, albeit far less efficiently (internally, > Moses simply generates a longer list and then filters it). > > I'm guessing you already knew about that option though. If that's too > slow for what you're doing then give me a day or two and I'll find some > time to implement the Huang et al. trick. Clearly, that's what we > should be doing anyway. > > Oh wait, are you talking about phrase-based or syntax-based? For > phrase-based we don't -- but obviously could -- use Huang and Chiang's > (2005) algorithm for k-best extraction. As things stand, doing the > Huang et al. unique trick in Moses would involve more effort to > implement for phrase-based than for syntax-based. > > Phil > > On 11 Mar 2015, at 20:03, Chris Dyer <[email protected]> wrote: > >> Hi all, can anyone tell me if moses can be configured to generate >> "unique" k-best lists using the Huang et al. (2006) dynamic >> programming algorithm (Section 5.2 of >> http://www.cis.upenn.edu/~lhuang3/amta06-sdtedl.pdf)? >> Thanks-- >> Chris >> _______________________________________________ >> 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 _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
