From d36c0c2ccc831d8fcdbe3629303323178ba75d3f Mon Sep 17 00:00:00 2001 From: graehl Date: Thu, 1 Jul 2010 19:22:10 +0000 Subject: docs git-svn-id: https://ws10smt.googlecode.com/svn/trunk@92 ec762483-ff6d-05da-a07a-a48fb63a330f --- training/grammar_convert.cc | 8 ++++++-- training/plftools.cc | 6 +++++- 2 files changed, 11 insertions(+), 3 deletions(-) (limited to 'training') diff --git a/training/grammar_convert.cc b/training/grammar_convert.cc index 461ff8e4..8d292f8a 100644 --- a/training/grammar_convert.cc +++ b/training/grammar_convert.cc @@ -1,3 +1,7 @@ +/* + this program modifies cfg hypergraphs (forests) and extracts kbests? + what are: json, split ? + */ #include #include #include @@ -120,7 +124,7 @@ bool CheckPermutationMask(const vector& mask, const vector& pi) { req_min = cur_max - 1; } if (pi[i] > req_min) { - if (pi[i] > cur_max) cur_max = pi[i]; + if (pi[i] > cur_max) cur_max = pi[i]; } else { return false; } @@ -142,7 +146,7 @@ void PermuteYKRecursive(int nodeid, const WordID& parent, const int max_reorder, const TRule& rule = *hg->edges_[oe_index].rule_; const Hypergraph::TailNodeVector orig_tail = hg->edges_[oe_index].tail_nodes_; const int tail_size = orig_tail.size(); - for (int i = 0; i < tail_size; ++i) { + for (int i = 0; i < tail_size; ++i) { PermuteYKRecursive(hg->edges_[oe_index].tail_nodes_[i], node->cat_, max_reorder, hg); } const vector& of = rule.f_; diff --git a/training/plftools.cc b/training/plftools.cc index 903ec54f..d58e0b43 100644 --- a/training/plftools.cc +++ b/training/plftools.cc @@ -1,3 +1,7 @@ +char const* NOTES = + "Process (PLF format) lattice: sharpen distribution, nbest, graphviz, push weights\n" + ; + #include #include #include @@ -33,7 +37,7 @@ void InitCommandLine(int argc, char** argv, po::variables_map* conf) { po::notify(*conf); if (conf->count("help") || conf->count("input") == 0) { - cerr << dcmdline_options << endl; + cerr << dcmdline_options << endl << NOTES << endl; exit(1); } } -- cgit v1.2.3