From 786b689a486413b4ea31841eb352ed728621e4b1 Mon Sep 17 00:00:00 2001 From: graehl Date: Sun, 25 Jul 2010 02:52:58 +0000 Subject: cleaned up kbest, new USE_INFO_EDGE 1 logs per edge, --show_derivation (needs work; handle kbest deriv, viterbi deriv, sort hg exposing viterbi?) git-svn-id: https://ws10smt.googlecode.com/svn/trunk@405 ec762483-ff6d-05da-a07a-a48fb63a330f --- decoder/viterbi.h | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'decoder/viterbi.h') diff --git a/decoder/viterbi.h b/decoder/viterbi.h index 388bff3c..ea2bc6c2 100644 --- a/decoder/viterbi.h +++ b/decoder/viterbi.h @@ -6,7 +6,7 @@ #include "hg.h" #include "tdict.h" -std::string viterbi_stats(Hypergraph const& hg, std::string const& name="forest", bool estring=true, bool etree=false); +std::string viterbi_stats(Hypergraph const& hg, std::string const& name="forest", bool estring=true, bool etree=false, bool derivation_tree=false); /// computes for each hg node the best (according to WeightType/WeightFunction) derivation, and some homomorphism (bottom up expression tree applied through Traversal) of it. T is the "return type" of Traversal, which is called only once for the best edge for a node's result (i.e. result will start default constructed) //TODO: make T a typename inside Traversal and WeightType a typename inside WeightFunction? -- cgit v1.2.3