File size: 3,382 Bytes
fd49381
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
/***********************************************************************
  Moses - factored phrase-based language decoder
  Copyright (C) 2014 University of Edinburgh

  This library is free software; you can redistribute it and/or
  modify it under the terms of the GNU Lesser General Public
  License as published by the Free Software Foundation; either
  version 2.1 of the License, or (at your option) any later version.

  This library is distributed in the hope that it will be useful,
  but WITHOUT ANY WARRANTY; without even the implied warranty of
  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  Lesser General Public License for more details.

  You should have received a copy of the GNU Lesser General Public
  License along with this library; if not, write to the Free Software
  Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
 ***********************************************************************/

#pragma once
#ifndef moses_CompletedRuleCollectionS_h
#define moses_CompletedRuleCollectionS_h

#include <vector>
#include <numeric>

#include "moses/StackVec.h"
#include "moses/TargetPhraseCollection.h"
#include "moses/ChartTranslationOptions.h"
#include "moses/ChartCellLabel.h"
#include "moses/ChartParserCallback.h"

namespace Moses
{

// temporary storage for a completed rule (because we use lookahead to find rules before ChartManager wants us to)
struct CompletedRule {
public:

  CompletedRule(const TargetPhraseCollection &tpc,
                const StackVec &stackVec,
                const float score)
    : m_stackVec(stackVec)
    , m_tpc(tpc)
    , m_score(score) {}

  const TargetPhraseCollection & GetTPC() const {
    return m_tpc;
  }

  const StackVec & GetStackVector() const {
    return m_stackVec;
  }

  const float GetScoreEstimate() const {
    return m_score;
  }

private:
  const StackVec m_stackVec;
  const TargetPhraseCollection &m_tpc;
  const float m_score;

};

class CompletedRuleOrdered
{
public:
  bool operator()(const CompletedRule* itemA, const CompletedRule* itemB) const {
    return itemA->GetScoreEstimate() > itemB->GetScoreEstimate();
  }
};

struct CompletedRuleCollection {
public:

  CompletedRuleCollection(size_t rule_limit);
  ~CompletedRuleCollection();

  CompletedRuleCollection(const CompletedRuleCollection &old)
    : m_collection(old.m_collection)
    , m_scoreThreshold(old.m_scoreThreshold)
    , m_ruleLimit(old.m_ruleLimit) {}

  CompletedRuleCollection & operator=(const CompletedRuleCollection &old) {

    m_collection = old.m_collection;
    m_scoreThreshold = old.m_scoreThreshold;
    m_ruleLimit = old.m_ruleLimit;
    return *this;
  }

  std::vector<CompletedRule*>::const_iterator begin() const {
    return m_collection.begin();
  }
  std::vector<CompletedRule*>::const_iterator end() const {
    return m_collection.end();
  }

  void Clear() {
    RemoveAllInColl(m_collection);
  }

  void Add(const TargetPhraseCollection &tpc,
           const StackVec &stackVec,
           const ChartParserCallback &outColl);

  void Add(const TargetPhraseCollection &tpc,
           const StackVec &stackVec,
           const std::vector<float> &stackScores,
           const ChartParserCallback &outColl);

private:
  std::vector<CompletedRule*> m_collection;
  float m_scoreThreshold;
  size_t m_ruleLimit;

};

} // namespace Moses

#endif