2008-06-11 14:52:57 +04:00
|
|
|
// vim:tabstop=2
|
|
|
|
|
|
|
|
/***********************************************************************
|
|
|
|
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
|
|
|
|
***********************************************************************/
|
|
|
|
|
2012-11-27 19:08:31 +04:00
|
|
|
#include "moses/TranslationModel/PhraseDictionary.h"
|
|
|
|
#include "moses/StaticData.h"
|
|
|
|
#include "moses/InputType.h"
|
|
|
|
#include "moses/TranslationOption.h"
|
|
|
|
#include "moses/UserMessage.h"
|
2008-06-11 14:52:57 +04:00
|
|
|
|
2010-08-10 17:51:20 +04:00
|
|
|
using namespace std;
|
|
|
|
|
2011-02-24 16:14:42 +03:00
|
|
|
namespace Moses
|
|
|
|
{
|
2008-06-11 14:52:57 +04:00
|
|
|
|
2013-02-22 23:17:57 +04:00
|
|
|
PhraseDictionary::PhraseDictionary(const std::string &description, const std::string &line)
|
2013-05-29 21:16:15 +04:00
|
|
|
:DecodeFeature(description, line)
|
2008-06-11 14:52:57 +04:00
|
|
|
{
|
2013-02-22 23:17:57 +04:00
|
|
|
m_tableLimit= 20; // TODO default?
|
2008-06-11 14:52:57 +04:00
|
|
|
|
2013-02-04 05:09:15 +04:00
|
|
|
for (size_t i = 0; i < m_args.size(); ++i) {
|
|
|
|
const vector<string> &args = m_args[i];
|
2013-02-01 19:50:57 +04:00
|
|
|
|
2013-05-20 22:57:46 +04:00
|
|
|
if (args[0] == "num-input-features") {
|
2013-02-04 03:30:36 +04:00
|
|
|
m_numInputScores = Scan<unsigned>(args[1]);
|
2013-05-29 21:16:15 +04:00
|
|
|
} else if (args[0] == "path") {
|
2013-02-01 19:50:57 +04:00
|
|
|
m_filePath = args[1];
|
2013-05-29 21:16:15 +04:00
|
|
|
} else if (args[0] == "table-limit") {
|
2013-02-01 19:50:57 +04:00
|
|
|
m_tableLimit = Scan<size_t>(args[1]);
|
2013-05-29 21:16:15 +04:00
|
|
|
} else if (args[0] == "target-path") {
|
2013-02-04 03:55:05 +04:00
|
|
|
m_targetFile = args[1];
|
2013-05-29 21:16:15 +04:00
|
|
|
} else if (args[0] == "alignment-path") {
|
2013-02-04 03:55:05 +04:00
|
|
|
m_alignmentsFile = args[1];
|
2013-05-29 21:16:15 +04:00
|
|
|
} else {
|
2013-05-10 18:13:03 +04:00
|
|
|
//throw "Unknown argument " + args[0];
|
2013-02-04 03:55:05 +04:00
|
|
|
}
|
2013-02-01 19:50:57 +04:00
|
|
|
} // for (size_t i = 0; i < toks.size(); ++i) {
|
|
|
|
|
2013-05-30 21:34:10 +04:00
|
|
|
// find out which feature function can be applied in this decode step
|
|
|
|
const std::vector<FeatureFunction*> &allFeatures = FeatureFunction::GetFeatureFunctions();
|
|
|
|
for (size_t i = 0; i < allFeatures.size(); ++i) {
|
|
|
|
FeatureFunction *feature = allFeatures[i];
|
|
|
|
if (feature->IsUseable(m_outputFactors)) {
|
|
|
|
m_featuresToApply.push_back(feature);
|
|
|
|
}
|
|
|
|
}
|
2013-02-22 23:17:57 +04:00
|
|
|
}
|
2013-02-21 22:06:03 +04:00
|
|
|
|
2013-02-22 23:17:57 +04:00
|
|
|
|
|
|
|
const TargetPhraseCollection *PhraseDictionary::
|
|
|
|
GetTargetPhraseCollection(InputType const& src,WordsRange const& range) const
|
|
|
|
{
|
2013-04-26 15:20:49 +04:00
|
|
|
Phrase phrase = src.GetSubString(range);
|
|
|
|
phrase.OnlyTheseFactors(m_inputFactors);
|
|
|
|
return GetTargetPhraseCollection(phrase);
|
2013-02-01 19:50:57 +04:00
|
|
|
}
|
|
|
|
|
2008-10-09 03:51:26 +04:00
|
|
|
}
|
|
|
|
|