mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-11-10 10:59:21 +03:00
22ce1d2f19
- Fix case where "foo bar baz" appears but "bar baz" does not. Previously probing silently returned the wrong answer and trie silently broke. - More aggressive recombination: if "baz quux" is never followed by any word, then do not include "bar" in the state. - kenlm assumes that "foo bar" is present if "foo bar baz" is. This is now checked. - Binary format version number bump because the format has changed to support the above. - Lower memory consumption trie building. But it will take longer for to ensure correct handling of blanks and aggressive recombination. - Fix progress bar newlines on trie building. Agrees with SRI's 1-best outputs on the WMT 10 evaluation set. git-svn-id: https://mosesdecoder.svn.sourceforge.net/svnroot/mosesdecoder/trunk@3847 1f5c12ca-751b-0410-a591-d2e778427230
15 lines
405 B
C++
15 lines
405 B
C++
#ifndef LM_MAX_ORDER__
|
|
#define LM_MAX_ORDER__
|
|
namespace lm {
|
|
namespace ngram {
|
|
// If you need higher order, change this and recompile.
|
|
// Having this limit means that State can be
|
|
// (kMaxOrder - 1) * sizeof(float) bytes instead of
|
|
// sizeof(float*) + (kMaxOrder - 1) * sizeof(float) + malloc overhead
|
|
const unsigned char kMaxOrder = 6;
|
|
|
|
} // namespace ngram
|
|
} // namespace lm
|
|
|
|
#endif // LM_MAX_ORDER__
|