summaryrefslogtreecommitdiff
path: root/klm/search/rule.hh
blob: 79192d40ffdfcd7fc7e76a6eb9c6618c3c725d07 (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
48
49
50
51
52
53
54
55
56
57
58
59
60
#ifndef SEARCH_RULE__
#define SEARCH_RULE__

#include "lm/left.hh"
#include "search/arity.hh"
#include "search/types.hh"
#include "search/word.hh"

#include <boost/array.hpp>

#include <iosfwd>
#include <vector>

namespace search {

template <class Model> class Context;

class Rule {
  public:
    Rule() : arity_(0) {}

    void AppendTerminal(Word w) { items_.push_back(w); }

    void AppendNonTerminal() {
      items_.resize(items_.size() + 1);
      ++arity_;
    }

    template <class Model> void FinishedAdding(const Context<Model> &context, Score additive, bool prepend_bos);

    Score Bound() const { return bound_; }

    Score Additive() const { return additive_; }

    unsigned int Arity() const { return arity_; }

    const lm::ngram::ChartState &Lexical(unsigned int index) const {
      return lexical_[index];
    }

    // For printing.  
    typedef const std::vector<Word> ItemsRet;
    ItemsRet &Items() const { return items_; }

  private:
    Score bound_, additive_;

    unsigned int arity_;

    // TODO: pool?
    std::vector<Word> items_;

    std::vector<lm::ngram::ChartState> lexical_;
};

std::ostream &operator<<(std::ostream &o, const Rule &rule);

} // namespace search

#endif // SEARCH_RULE__