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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (c) 2006 University of Edinburgh
All rights reserved.
Redistribution and use in source and binary forms, with or without modification,
are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright notice,
this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright notice,
this list of conditions and the following disclaimer in the documentation
and/or other materials provided with the distribution.
* Neither the name of the University of Edinburgh nor the names of its contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
POSSIBILITY OF SUCH DAMAGE.
***********************************************************************/
// example file on how to use moses library
#ifdef WIN32
// Include Visual Leak Detector
#include <vld.h>
#endif
#include <fstream>
#include "Main.h"
#include "LatticePath.h"
#include "FactorCollection.h"
#include "Manager.h"
#include "Phrase.h"
#include "Util.h"
#include "LatticePathList.h"
#include "Timer.h"
#include "IOCommandLine.h"
#include "IOFile.h"
#include "Sentence.h"
#include "ConfusionNet.h"
#include "TranslationAnalysis.h"
#if HAVE_CONFIG_H
#include "config.h"
#else
// those not using autoconf have to build MySQL support for now
# define USE_MYSQL 1
#endif
using namespace std;
Timer timer;
bool readInput(InputOutput *inputOutput, int inputType, InputType*& source)
{
delete source;
source=inputOutput->GetInput((inputType ?
static_cast<InputType*>(new ConfusionNet) :
static_cast<InputType*>(new Sentence(Input))));
return (source ? true : false);
}
int main(int argc, char* argv[])
{
// Welcome message
TRACE_ERR( "Moses (built on " << __DATE__ << ")" << endl );
TRACE_ERR( "a beam search decoder for phrase-based statistical machine translation models" << endl );
TRACE_ERR( "written by Hieu Hoang, with contributions by Nicola Bertoldi, Ondrej Bojar," << endl <<
"Chris Callison-Burch, Alexandra Constantin, Brooke Cowan, Chris Dyer, Marcello Federico," << endl <<
"Evan Herbst, Philipp Koehn, Christine Moran, Wade Shen, and Richard Zens." << endl);
TRACE_ERR( "(c) 2006 University of Edinburgh, Scotland" << endl );
TRACE_ERR( "command: " );
for(int i=0;i<argc;++i) TRACE_ERR( argv[i]<<" " );
TRACE_ERR(endl);
// load data structures
timer.start("Starting...");
StaticData staticData;
if (!staticData.LoadParameters(argc, argv))
return EXIT_FAILURE;
// set up read/writing class
InputOutput *inputOutput = GetInputOutput(staticData);
std::cerr << "The score component vector looks like this:\n" << staticData.GetScoreIndexManager();
std::cerr << "The global weight vector looks like this:\n";
vector<float> weights = staticData.GetAllWeights();
std::cerr << weights[0];
for (size_t j=1; j<weights.size(); j++) { std::cerr << ", " << weights[j]; }
std::cerr << "\n";
// every score must have a weight! check that here:
assert(weights.size() == staticData.GetScoreIndexManager().GetTotalNumberOfScores());
if (inputOutput == NULL)
return EXIT_FAILURE;
// read each sentence & decode
InputType *source=0;
size_t lineCount = 0;
while(readInput(inputOutput,staticData.GetInputType(),source))
{
// note: source is only valid within this while loop!
TRACE_ERR("\nTRANSLATING(" << ++lineCount << "): " << *source <<endl);
staticData.InitializeBeforeSentenceProcessing(*source);
Manager manager(*source, staticData);
manager.ProcessSentence();
inputOutput->SetOutput(manager.GetBestHypothesis(), source->GetTranslationId(),
staticData.GetReportSourceSpan(),
staticData.GetReportAllFactors()
);
// n-best
size_t nBestSize = staticData.GetNBestSize();
if (nBestSize > 0)
{
TRACE_ERR("WRITING " << nBestSize << " TRANSLATION ALTERNATIVES TO " << staticData.GetNBestFilePath() << endl);
LatticePathList nBestList;
manager.CalcNBest(nBestSize, nBestList,staticData.OnlyDistinctNBest());
inputOutput->SetNBest(nBestList, source->GetTranslationId());
RemoveAllInColl(nBestList);
}
if (staticData.IsDetailedTranslationReportingEnabled()) {
TranslationAnalysis::PrintTranslationAnalysis(std::cerr, manager.GetBestHypothesis());
}
manager.CalcDecoderStatistics(staticData);
staticData.CleanUpAfterSentenceProcessing();
}
delete inputOutput;
timer.check("End.");
return EXIT_SUCCESS;
}
InputOutput *GetInputOutput(StaticData &staticData)
{
InputOutput *inputOutput;
const std::vector<FactorType> &inputFactorOrder = staticData.GetInputFactorOrder()
,&outputFactorOrder = staticData.GetOutputFactorOrder();
FactorMask inputFactorUsed(inputFactorOrder);
// io
if (staticData.GetIOMethod() == IOMethodFile)
{
TRACE_ERR("IO from File" << endl);
string inputFileHash;
list< Phrase > inputPhraseList;
string filePath = staticData.GetParam("input-file")[0];
TRACE_ERR("About to create ioFile" << endl);
IOFile *ioFile = new IOFile(inputFactorOrder, outputFactorOrder, inputFactorUsed
, staticData.GetFactorCollection()
, staticData.GetNBestSize()
, staticData.GetNBestFilePath()
, filePath);
if(staticData.GetInputType())
{
TRACE_ERR("Do not read input phrases for confusion net translation\n");
}
else
{
TRACE_ERR("About to GetInputPhrase\n");
ioFile->GetInputPhrase(inputPhraseList);
}
TRACE_ERR("After GetInputPhrase" << endl);
inputOutput = ioFile;
inputFileHash = GetMD5Hash(filePath);
TRACE_ERR("About to LoadPhraseTables" << endl);
staticData.LoadPhraseTables(true, inputFileHash, inputPhraseList);
ioFile->ResetSentenceId();
}
else
{
TRACE_ERR("IO from STDOUT/STDIN" << endl);
inputOutput = new IOCommandLine(inputFactorOrder, outputFactorOrder, inputFactorUsed
, staticData.GetFactorCollection()
, staticData.GetNBestSize()
, staticData.GetNBestFilePath());
staticData.LoadPhraseTables();
}
staticData.LoadMapping();
timer.check("Created input-output object");
return inputOutput;
}
|
