blob: 9f8f73ef5810c85bb363fa0e077bdb4802859ce6 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
|
#ifndef moses_SearchCubePruning_h
#define moses_SearchCubePruning_h
#include <vector>
#include "Search.h"
#include "HypothesisStackCubePruning.h"
namespace Moses
{
class InputType;
class TranslationOptionCollection;
class SearchCubePruning: public Search
{
protected:
const InputType &m_source;
std::vector < HypothesisStack* > m_hypoStackColl; /**< stacks to store hypotheses (partial translations) */
// no of elements = no of words in source + 1
TargetPhrase m_initialTargetPhrase; /**< used to seed 1st hypo */
clock_t m_start; /**< used to track time spend on translation */
const TranslationOptionCollection &m_transOptColl; /**< pre-computed list of translation options for the phrases in this sentence */
//! go thru all bitmaps in 1 stack & create backpointers to bitmaps in the stack
void CreateForwardTodos(HypothesisStackCubePruning &stack);
//! create a back pointer to this bitmap, with edge that has this words range translation
void CreateForwardTodos(const WordsBitmap &bitmap, const WordsRange &range, BitmapContainer &bitmapContainer);
bool CheckDistortion(const WordsBitmap &bitmap, const WordsRange &range) const;
void PrintBitmapContainerGraph();
public:
SearchCubePruning(Manager& manager, const InputType &source, const TranslationOptionCollection &transOptColl);
~SearchCubePruning();
void ProcessSentence();
void OutputHypoStackSize();
void OutputHypoStack(int stack);
virtual const std::vector < HypothesisStack* >& GetHypothesisStacks() const;
virtual const Hypothesis *GetBestHypothesis() const;
};
}
#endif
|
