summaryrefslogtreecommitdiff
path: root/training/grammar_convert.cc
diff options
context:
space:
mode:
authorgraehl <graehl@ec762483-ff6d-05da-a07a-a48fb63a330f>2010-07-01 19:22:10 +0000
committergraehl <graehl@ec762483-ff6d-05da-a07a-a48fb63a330f>2010-07-01 19:22:10 +0000
commitd36c0c2ccc831d8fcdbe3629303323178ba75d3f (patch)
treef1550aeb0e45fd15f5a90ce6127a5c787315b18b /training/grammar_convert.cc
parent75153dfed4623ac3e5da76675bb2475dd631d22b (diff)
docs
git-svn-id: https://ws10smt.googlecode.com/svn/trunk@92 ec762483-ff6d-05da-a07a-a48fb63a330f
Diffstat (limited to 'training/grammar_convert.cc')
-rw-r--r--training/grammar_convert.cc8
1 files changed, 6 insertions, 2 deletions
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 <iostream>
#include <algorithm>
#include <sstream>
@@ -120,7 +124,7 @@ bool CheckPermutationMask(const vector<int>& mask, const vector<int>& 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<WordID>& of = rule.f_;