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"
|
2013-07-07 01:42:52 +04:00
|
|
|
#include "moses/InputPath.h"
|
2013-07-03 19:57:23 +04:00
|
|
|
#include "util/exception.hh"
|
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)
|
2013-06-10 21:11:55 +04:00
|
|
|
,m_tableLimit(20) // default
|
2008-06-11 14:52:57 +04:00
|
|
|
{
|
2013-02-22 23:17:57 +04:00
|
|
|
}
|
2013-02-21 22:06:03 +04:00
|
|
|
|
2013-07-11 23:05:08 +04:00
|
|
|
const TargetPhraseCollection *PhraseDictionary::GetTargetPhraseCollection(const Phrase& src) const
|
|
|
|
{
|
|
|
|
UTIL_THROW(util::Exception, "Legacy method not implemented");
|
|
|
|
}
|
|
|
|
|
2013-02-22 23:17:57 +04:00
|
|
|
|
2013-08-07 15:55:10 +04:00
|
|
|
std::pair<const TargetPhraseCollection*, std::vector<Phrase> > PhraseDictionary::
|
2013-08-07 14:48:18 +04:00
|
|
|
GetTargetPhraseCollectionLegacy(InputType const& src,WordsRange const& range) const
|
2013-02-22 23:17:57 +04:00
|
|
|
{
|
2013-07-11 20:24:19 +04:00
|
|
|
UTIL_THROW(util::Exception, "Legacy method not implemented");
|
|
|
|
//Phrase phrase = src.GetSubString(range);
|
|
|
|
//return GetTargetPhraseCollection(phrase);
|
2013-02-01 19:50:57 +04:00
|
|
|
}
|
|
|
|
|
2013-06-20 16:25:02 +04:00
|
|
|
void PhraseDictionary::SetParameter(const std::string& key, const std::string& value)
|
2013-06-07 20:32:01 +04:00
|
|
|
{
|
2013-06-10 21:11:55 +04:00
|
|
|
if (key == "path") {
|
|
|
|
m_filePath = value;
|
|
|
|
} else if (key == "table-limit") {
|
|
|
|
m_tableLimit = Scan<size_t>(value);
|
|
|
|
} else {
|
2013-06-20 16:25:02 +04:00
|
|
|
DecodeFeature::SetParameter(key, value);
|
2013-06-07 20:32:01 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-14 21:34:47 +04:00
|
|
|
void PhraseDictionary::SetFeaturesToApply()
|
|
|
|
{
|
|
|
|
// 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-07-11 23:18:06 +04:00
|
|
|
void PhraseDictionary::GetTargetPhraseCollectionBatch(const InputPathList &phraseDictionaryQueue) const
|
2013-07-03 19:57:23 +04:00
|
|
|
{
|
2013-07-09 17:19:35 +04:00
|
|
|
InputPathList::const_iterator iter;
|
|
|
|
for (iter = phraseDictionaryQueue.begin(); iter != phraseDictionaryQueue.end(); ++iter) {
|
|
|
|
InputPath &node = **iter;
|
2013-07-03 19:57:23 +04:00
|
|
|
|
2013-07-03 22:07:36 +04:00
|
|
|
const Phrase &phrase = node.GetPhrase();
|
2013-07-05 02:38:18 +04:00
|
|
|
const TargetPhraseCollection *targetPhrases = this->GetTargetPhraseCollection(phrase);
|
|
|
|
node.SetTargetPhrases(*this, targetPhrases, NULL);
|
2013-07-03 19:57:23 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2008-10-09 03:51:26 +04:00
|
|
|
}
|
|
|
|
|