From: <lex...@us...> - 2007-02-16 15:56:45
|
Revision: 1217 http://mosesdecoder.svn.sourceforge.net/mosesdecoder/?rev=1217&view=rev Author: lexi_birch Date: 2007-02-16 07:56:44 -0800 (Fri, 16 Feb 2007) Log Message: ----------- Merging from branch. >From now on, can have multiple decoder step lists to accomodate backoff Specify this as an extra parameter in the [mapping] option in the ini file This is backwards compatible. Before (and still accepted): [mapping] T 0 Now you can have: [mapping] 0 T 0 1 T 1 1 G 0 Imagine for instance the translation table 0 is words - words, and the table 1 is stems - stems, and the generation table 0 is stems - words. This will allow us to backoff to stems if words are not found. It is not really backoff because all the options from both decoder step lists get included into the translation option collection, which is then used to create the hypotheses. The different paths must have their weights carefully balanced. MERT might not be enough to discover the best weights for all the combined parameters. Modified Paths: -------------- trunk/moses/src/Manager.cpp trunk/moses/src/StaticData.cpp trunk/moses/src/StaticData.h trunk/moses/src/TranslationOptionCollection.cpp trunk/moses/src/TranslationOptionCollection.h This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site. |