diff options
| author | Chris Dyer <cdyer@cs.cmu.edu> | 2011-01-25 22:30:48 +0200 |
|---|---|---|
| committer | Chris Dyer <cdyer@cs.cmu.edu> | 2011-01-25 22:30:48 +0200 |
| commit | 931a036dc3cf9e1deafc10e78e94a0ebe3c8004f (patch) | |
| tree | 9e1935fc4deafdbd04a8d38835c91b57f359cdee /klm/lm/build_binary.cc | |
| parent | bee6a3c3f6c54cf7449229488c6124dddc7e2f31 (diff) | |
update kenlm
Diffstat (limited to 'klm/lm/build_binary.cc')
| -rw-r--r-- | klm/lm/build_binary.cc | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/klm/lm/build_binary.cc b/klm/lm/build_binary.cc index b340797b..144c57e0 100644 --- a/klm/lm/build_binary.cc +++ b/klm/lm/build_binary.cc @@ -21,7 +21,7 @@ void Usage(const char *name) { "memory and is still faster than SRI or IRST. Building the trie format uses an\n" "on-disk sort to save memory.\n" "-t is the temporary directory prefix. Default is the output file name.\n" -"-m is the amount of memory to use, in MB. Default is 1024MB (1GB).\n\n" +"-m limits memory use for sorting. Measured in MB. Default is 1024MB.\n\n" /*"sorted is like probing but uses a sorted uniform map instead of a hash table.\n" "It uses more memory than trie and is also slower, so there's no real reason to\n" "use it.\n\n"*/ |