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
|
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 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_GenerationDictionary_h
#define moses_GenerationDictionary_h
#include <list>
#include <map>
#include <vector>
#include "ScoreComponentCollection.h"
#include "Phrase.h"
#include "TypeDef.h"
#include "Dictionary.h"
#include "DecodeFeature.h"
namespace Moses
{
class FactorCollection;
typedef std::map < Word , ScoreComponentCollection > OutputWordCollection;
// 1st = output phrase
// 2nd = log probability (score)
/** Implementation of a generation table in a trie.
*/
class GenerationDictionary : public Dictionary, public DecodeFeature
{
typedef std::map<const Word* , OutputWordCollection, WordComparer> Collection;
protected:
Collection m_collection;
// 1st = source
// 2nd = target
std::string m_filePath;
public:
/** constructor.
* \param numFeatures number of score components, as specified in ini file
*/
GenerationDictionary(
size_t numFeatures,
const std::vector<FactorType> &input,
const std::vector<FactorType> &output);
virtual ~GenerationDictionary();
// returns Generate
DecodeType GetDecodeType() const
{
return Generate;
}
//! load data file
bool Load(const std::string &filePath, FactorDirection direction);
std::string GetScoreProducerWeightShortName(unsigned) const
{
return "g";
}
/** number of unique input entries in the generation table.
* NOT the number of lines in the generation table
*/
size_t GetSize() const
{
return m_collection.size();
}
/** returns a bag of output words, OutputWordCollection, for a particular input word.
* Or NULL if the input word isn't found. The search function used is the WordComparer functor
*/
const OutputWordCollection *FindWord(const Word &word) const;
virtual bool ComputeValueInTranslationOption() const;
};
}
#endif
|
