Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorHieu Hoang <hieuhoang@gmail.com>2012-11-12 23:56:18 +0400
committerHieu Hoang <hieuhoang@gmail.com>2012-11-12 23:56:18 +0400
commit5e3ef23cef6101d2c098eb3445f562e8f595655b (patch)
treeb8c332b6fa82bae84ea4910967a10ba1b08a7107 /moses/TranslationOption.cpp
parent8c785cff2b1be3cccd76ea9026f71b649762dfc3 (diff)
move moses/src/* to moses/
Diffstat (limited to 'moses/TranslationOption.cpp')
-rw-r--r--moses/TranslationOption.cpp141
1 files changed, 141 insertions, 0 deletions
diff --git a/moses/TranslationOption.cpp b/moses/TranslationOption.cpp
new file mode 100644
index 000000000..e15cf03c9
--- /dev/null
+++ b/moses/TranslationOption.cpp
@@ -0,0 +1,141 @@
+// $Id$
+// 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
+***********************************************************************/
+
+#include "TranslationOption.h"
+#include "WordsBitmap.h"
+#include "PhraseDictionaryMemory.h"
+#include "GenerationDictionary.h"
+#include "LMList.h"
+#include "LexicalReordering.h"
+#include "StaticData.h"
+#include "InputType.h"
+
+using namespace std;
+
+namespace Moses
+{
+
+//TODO this should be a factory function!
+TranslationOption::TranslationOption(const WordsRange &wordsRange
+ , const TargetPhrase &targetPhrase
+ , const InputType &inputType)
+ : m_targetPhrase(targetPhrase)
+ , m_sourceWordsRange(wordsRange)
+ , m_scoreBreakdown(targetPhrase.GetScoreBreakdown())
+{}
+
+//TODO this should be a factory function!
+TranslationOption::TranslationOption(const WordsRange &wordsRange
+ , const TargetPhrase &targetPhrase
+ , const InputType &inputType
+ , const UnknownWordPenaltyProducer* up)
+ : m_targetPhrase(targetPhrase)
+ , m_sourceWordsRange (wordsRange)
+ , m_futureScore(0)
+{
+ if (up) {
+ const ScoreProducer *scoreProducer = (const ScoreProducer *)up; // not sure why none of the c++ cast works
+ vector<float> score(1);
+ score[0] = FloorScore(-numeric_limits<float>::infinity());
+ m_scoreBreakdown.Assign(scoreProducer, score);
+ }
+}
+
+TranslationOption::TranslationOption(const TranslationOption &copy, const WordsRange &sourceWordsRange)
+ : m_targetPhrase(copy.m_targetPhrase)
+//, m_sourcePhrase(new Phrase(*copy.m_sourcePhrase)) // TODO use when confusion network trans opt for confusion net properly implemented
+ , m_sourceWordsRange(sourceWordsRange)
+ , m_futureScore(copy.m_futureScore)
+ , m_scoreBreakdown(copy.m_scoreBreakdown)
+ , m_cachedScores(copy.m_cachedScores)
+{}
+
+void TranslationOption::MergeNewFeatures(const Phrase& phrase, const ScoreComponentCollection& score, const std::vector<FactorType>& featuresToAdd)
+{
+ CHECK(phrase.GetSize() == m_targetPhrase.GetSize());
+ if (featuresToAdd.size() == 1) {
+ m_targetPhrase.MergeFactors(phrase, featuresToAdd[0]);
+ } else if (featuresToAdd.empty()) {
+ /* features already there, just update score */
+ } else {
+ m_targetPhrase.MergeFactors(phrase, featuresToAdd);
+ }
+ m_scoreBreakdown.PlusEquals(score);
+}
+
+bool TranslationOption::IsCompatible(const Phrase& phrase, const std::vector<FactorType>& featuresToCheck) const
+{
+ if (featuresToCheck.size() == 1) {
+ return m_targetPhrase.IsCompatible(phrase, featuresToCheck[0]);
+ } else if (featuresToCheck.empty()) {
+ return true;
+ /* features already there, just update score */
+ } else {
+ return m_targetPhrase.IsCompatible(phrase, featuresToCheck);
+ }
+}
+
+bool TranslationOption::Overlap(const Hypothesis &hypothesis) const
+{
+ const WordsBitmap &bitmap = hypothesis.GetWordsBitmap();
+ return bitmap.Overlap(GetSourceWordsRange());
+}
+
+void TranslationOption::CalcScore(const TranslationSystem* system)
+{
+ // LM scores
+ float ngramScore = 0;
+ float retFullScore = 0;
+ float oovScore = 0;
+
+ const LMList &allLM = system->GetLanguageModels();
+
+ allLM.CalcScore(GetTargetPhrase(), retFullScore, ngramScore, oovScore, &m_scoreBreakdown);
+
+ size_t phraseSize = GetTargetPhrase().GetSize();
+
+ // future score
+ m_futureScore = retFullScore - ngramScore + oovScore
+ + m_scoreBreakdown.InnerProduct(StaticData::Instance().GetAllWeights()) - phraseSize *
+ system->GetWeightWordPenalty();
+}
+
+TO_STRING_BODY(TranslationOption);
+
+// friend
+ostream& operator<<(ostream& out, const TranslationOption& possibleTranslation)
+{
+ out << possibleTranslation.GetTargetPhrase()
+ << " c=" << possibleTranslation.GetFutureScore()
+ << " [" << possibleTranslation.GetSourceWordsRange() << "]"
+ << possibleTranslation.GetScoreBreakdown();
+ return out;
+}
+
+void TranslationOption::CacheScores(const ScoreProducer &producer, const Scores &score)
+{
+ m_cachedScores[&producer] = score;
+}
+
+}
+
+