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/DecodeStep.cpp
parent8c785cff2b1be3cccd76ea9026f71b649762dfc3 (diff)
move moses/src/* to moses/
Diffstat (limited to 'moses/DecodeStep.cpp')
-rw-r--r--moses/DecodeStep.cpp66
1 files changed, 66 insertions, 0 deletions
diff --git a/moses/DecodeStep.cpp b/moses/DecodeStep.cpp
new file mode 100644
index 000000000..3345f95d0
--- /dev/null
+++ b/moses/DecodeStep.cpp
@@ -0,0 +1,66 @@
+// $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
+***********************************************************************/
+
+#include "DecodeStep.h"
+#include "PhraseDictionaryMemory.h"
+#include "GenerationDictionary.h"
+#include "StaticData.h"
+
+namespace Moses
+{
+DecodeStep::DecodeStep(const DecodeFeature *decodeFeature, const DecodeStep* prev) :
+ m_decodeFeature(decodeFeature)
+{
+ FactorMask prevOutputFactors;
+ if (prev) prevOutputFactors = prev->m_outputFactors;
+ m_outputFactors = prevOutputFactors;
+ FactorMask conflictMask = (m_outputFactors & decodeFeature->GetOutputFactorMask());
+ m_outputFactors |= decodeFeature->GetOutputFactorMask();
+ FactorMask newOutputFactorMask = m_outputFactors ^ prevOutputFactors; //xor
+ m_newOutputFactors.resize(newOutputFactorMask.count());
+ m_conflictFactors.resize(conflictMask.count());
+ size_t j=0, k=0;
+ for (size_t i = 0; i < MAX_NUM_FACTORS; i++) {
+ if (newOutputFactorMask[i]) m_newOutputFactors[j++] = i;
+ if (conflictMask[i]) m_conflictFactors[k++] = i;
+ }
+ VERBOSE(2,"DecodeStep():\n\toutputFactors=" << m_outputFactors
+ << "\n\tconflictFactors=" << conflictMask
+ << "\n\tnewOutputFactors=" << newOutputFactorMask << std::endl);
+}
+
+DecodeStep::~DecodeStep() {}
+
+/** returns phrase feature (dictionary) for translation step */
+const PhraseDictionaryFeature* DecodeStep::GetPhraseDictionaryFeature() const
+{
+ return dynamic_cast<const PhraseDictionaryFeature*>(m_decodeFeature);
+}
+
+/** returns generation feature (dictionary) for generation step */
+const GenerationDictionary* DecodeStep::GetGenerationDictionaryFeature() const
+{
+ return dynamic_cast<const GenerationDictionary*>(m_decodeFeature);
+}
+
+}
+
+