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
|
// $Id$
// vim:tabstop=2
/***********************************************************************
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
***********************************************************************/
#ifndef moses_Hypergraph_Output_h
#define moses_Hypergraph_Output_h
#include <ostream>
#include "moses/parameters/AllOptions.h"
/**
* Manage the output of hypergraphs.
**/
namespace Moses
{
class ChartHypothesisCollection;
template<class M>
class HypergraphOutput
{
public:
/** Initialise output directory and create weights file */
HypergraphOutput(size_t precision);
/** Write this hypergraph to file */
void Write(const M& manager) const;
private:
size_t m_precision;
std::string m_hypergraphDir;
std::string m_compression;
bool m_appendSuffix;
};
/**
* ABC for different types of search graph output for chart Moses.
**/
class ChartSearchGraphWriter
{
protected:
AllOptions::ptr m_options;
ChartSearchGraphWriter(AllOptions::ptr const& opts) : m_options(opts) { }
public:
virtual void WriteHeader(size_t winners, size_t losers) const = 0;
virtual void WriteHypos(const ChartHypothesisCollection& hypos,
const std::map<unsigned, bool> &reachable) const = 0;
};
/** "Moses" format (osg style) */
class ChartSearchGraphWriterMoses : public virtual ChartSearchGraphWriter
{
public:
ChartSearchGraphWriterMoses(AllOptions::ptr const& opts,
std::ostream* out, size_t lineNumber)
: ChartSearchGraphWriter(opts), m_out(out), m_lineNumber(lineNumber) {}
virtual void WriteHeader(size_t, size_t) const {
/* do nothing */
}
virtual void WriteHypos(const ChartHypothesisCollection& hypos,
const std::map<unsigned, bool> &reachable) const;
private:
std::ostream* m_out;
size_t m_lineNumber;
};
/** Modified version of Kenneth's lazy hypergraph format */
class ChartSearchGraphWriterHypergraph : public virtual ChartSearchGraphWriter
{
public:
ChartSearchGraphWriterHypergraph(AllOptions::ptr const& opts, std::ostream* out)
: ChartSearchGraphWriter(opts), m_out(out), m_nodeId(0) { }
virtual void WriteHeader(size_t winners, size_t losers) const;
virtual void WriteHypos(const ChartHypothesisCollection& hypos,
const std::map<unsigned, bool> &reachable) const;
private:
std::ostream* m_out;
mutable size_t m_nodeId;
mutable std::map<size_t,size_t> m_hypoIdToNodeId;
};
}
#endif
|
