diff options
| author | Hieu Hoang <hieuhoang@gmail.com> | 2014-12-10 23:04:16 +0300 |
|---|---|---|
| committer | Hieu Hoang <hieuhoang@gmail.com> | 2014-12-10 23:04:16 +0300 |
| commit | 1a0e329791bf8f9d8815a1353027be16fb2b15c3 (patch) | |
| tree | d0885e50d37d3b871ffd88c35d714caa79ecb7ae /moses/LatticeMBR.h | |
| parent | 81640945d09b22ff297673c9c685cab9f344b266 (diff) | |
const some args. Ready to internalize n-best creation into Managers
Diffstat (limited to 'moses/LatticeMBR.h')
| -rw-r--r-- | moses/LatticeMBR.h | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/moses/LatticeMBR.h b/moses/LatticeMBR.h index 47d6da3c4..5fa47949d 100644 --- a/moses/LatticeMBR.h +++ b/moses/LatticeMBR.h @@ -137,15 +137,15 @@ void pruneLatticeFB(Lattice & connectedHyp, std::map < const Moses::Hypothesis*, const std::vector< float> & estimatedScores, const Moses::Hypothesis*, size_t edgeDensity,float scale); //Use the ngram scores to rerank the nbest list, return at most n solutions -void getLatticeMBRNBest(Moses::Manager& manager, Moses::TrellisPathList& nBestList, std::vector<LatticeMBRSolution>& solutions, size_t n); +void getLatticeMBRNBest(const Moses::Manager& manager, const Moses::TrellisPathList& nBestList, std::vector<LatticeMBRSolution>& solutions, size_t n); //calculate expectated ngram counts, clipping at 1 (ie calculating posteriors) if posteriors==true. void calcNgramExpectations(Lattice & connectedHyp, std::map<const Moses::Hypothesis*, std::vector<Edge> >& incomingEdges, std::map<Moses::Phrase, float>& finalNgramScores, bool posteriors); void GetOutputFactors(const Moses::TrellisPath &path, std::vector <Moses::Word> &translation); void extract_ngrams(const std::vector<Moses::Word >& sentence, std::map < Moses::Phrase, int > & allngrams); bool ascendingCoverageCmp(const Moses::Hypothesis* a, const Moses::Hypothesis* b); -std::vector<Moses::Word> doLatticeMBR(Moses::Manager& manager, Moses::TrellisPathList& nBestList); -const Moses::TrellisPath doConsensusDecoding(Moses::Manager& manager, Moses::TrellisPathList& nBestList); +std::vector<Moses::Word> doLatticeMBR(const Moses::Manager& manager, const Moses::TrellisPathList& nBestList); +const Moses::TrellisPath doConsensusDecoding(const Moses::Manager& manager, const Moses::TrellisPathList& nBestList); //std::vector<Moses::Word> doConsensusDecoding(Moses::Manager& manager, Moses::TrellisPathList& nBestList); } |