Hi, I'm looking for a tool to rerank n-best lists in Moses' current format, including sparse features. The CSLM toolkit has quite a nice re-ranker implementation, but apparently it doesn't know sparse features yet.
If anyone already has an extended version of the existing re-ranker from the CSLM toolkit, or alternatively any other code that does the same and can also deal with sparse features, please let me know. I'd prefer to not spend any time at all on implementing this myself, as I'll probably need to run it only a few times for testing purposes. Cheers, Matthias > On 29 Apr 20:46 2013, Holger Schwenk wrote: > > Hello, > > you can do n-best list rescoring with the nbest tool which is part of > the CSLM toolkit (http://www-lium.univ-lemans.fr/~cslm/) > It is designed to rescore with back-off or continuous space LMs, but is > shouldn't be difficult to add your won feature functions. > > don't ask to contact me if you need help. > > best, > > Holger -- The University of Edinburgh is a charitable body, registered in Scotland, with registration number SC005336. _______________________________________________ Moses-support mailing list [email protected] http://mailman.mit.edu/mailman/listinfo/moses-support
