summaryrefslogtreecommitdiff
path: root/utils/exp_semiring.h
blob: 26a2207198ce3b1cad998728953bced670513d27 (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
61
62
63
64
#ifndef _EXP_SEMIRING_H_
#define _EXP_SEMIRING_H_

#include <iostream>
#include "star.h"

// this file implements the first-order expectation semiring described
// in Li & Eisner (EMNLP 2009)

// requirements:
//   RType * RType ==> RType
//   PType * PType ==> PType
//   RType * PType ==> RType
// good examples:
//   PType scalar, RType vector
// BAD examples:
//   PType vector, RType scalar
template <class PType, class RType>
struct PRPair {
  PRPair() : p(), r() {}
  // Inside algorithm requires that T(0) and T(1)
  // return the 0 and 1 values of the semiring
  explicit PRPair(double x) : p(x), r() {}
  PRPair(const PType& p, const RType& r) : p(p), r(r) {}
  PRPair& operator+=(const PRPair& o) {
    p += o.p;
    r += o.r;
    return *this;
  }
  PRPair& operator*=(const PRPair& o) {
    r = (o.r * p) + (o.p * r);
    p *= o.p;
    return *this;
  }
  PType p;
  RType r;
};

template <class P, class R>
std::ostream& operator<<(std::ostream& o, const PRPair<P,R>& x) {
  return o << '<' << x.p << ", " << x.r << '>';
}

template <class P, class R>
const PRPair<P,R> operator+(const PRPair<P,R>& a, const PRPair<P,R>& b) {
  PRPair<P,R> result = a;
  result += b;
  return result;
}

template <class P, class R>
const PRPair<P,R> operator*(const PRPair<P,R>& a, const PRPair<P,R>& b) {
  PRPair<P,R> result = a;
  result *= b;
  return result;
}

template <class P, class R>
inline const PRPair<P,R> star(const PRPair<P,R>& x) {
  const P pstar = star(x.p);
  return PRPair<P,R>(pstar, pstar * x.r * pstar);
}

#endif