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
|
#ifndef HYPERGRAPH_HH
#define HYPERGRAPH_HH
#include "grammar.hh"
#include "semiring.hh"
#include <iostream>
#include <string>
#include <sstream>
#include <vector>
#include <map>
#include <functional>
#include <algorithm>
#include <msgpack.hpp>
using namespace std;
typedef double score_t;
typedef double weight_t;
namespace Hg {
class Node;
class Hyperedge {
public:
Node* head;
vector<Node*> tails;
score_t score;
vector<weight_t> f;
unsigned int mark;
//Grammar::Rule rule; FIXME
unsigned int arity_;
unsigned int arity();
bool is_marked();
string s();
MSGPACK_DEFINE(head, tails, score, f, mark, arity_);
};
class Node {
public:
unsigned int id;
string symbol;
unsigned int left;
unsigned int right;
score_t score;
vector<Hyperedge*> outgoing;
vector<Hyperedge*> incoming;
string s();
MSGPACK_DEFINE(id, symbol, left, right, score, outgoing, incoming);
};
class Hypergraph {
public:
vector<Node*> nodes;
vector<Hyperedge*> edges;
unsigned int arity_;
map<unsigned int, Node*> nodes_by_id;
unsigned int arity();
void reset();
string s();
string json_s();
MSGPACK_DEFINE(nodes, edges, arity_, nodes_by_id);
};
vector<Node*> topological_sort(vector<Node*>& nodes);
void viterbi(vector<Node*>& nodes, map<unsigned int, Hg::Node*> nodes_by_id, Node* root);
} // namespace
#endif
|
