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 <hieu@hoang.co.uk>2013-05-08 15:34:56 +0400
committerHieu Hoang <hieu@hoang.co.uk>2013-05-08 15:34:56 +0400
commitad0472baeb486b9038c27d9ba0736dc316ee8aba (patch)
tree4a6c4cab07fab1ccb6b747048ba1e3dc36e8b682 /moses/TranslationOption.h
parent1bf12d57281024c9c335ed8fe0444f2d0755dc3c (diff)
rename variable which is just used for caching lexicalised reordering scores
Diffstat (limited to 'moses/TranslationOption.h')
-rw-r--r--moses/TranslationOption.h14
1 files changed, 7 insertions, 7 deletions
diff --git a/moses/TranslationOption.h b/moses/TranslationOption.h
index 2748206b0..bcd5bbf4c 100644
--- a/moses/TranslationOption.h
+++ b/moses/TranslationOption.h
@@ -40,7 +40,7 @@ namespace Moses
class PhraseDictionary;
class GenerationDictionary;
-class LexicalReordering;
+class FeatureFunction;
/** Available phrase translation for a particular sentence pair.
* In a multi-factor model, this is expanded from the entries in the
@@ -67,8 +67,8 @@ protected:
const WordsRange m_sourceWordsRange; /*< word position in the input that are covered by this translation option */
float m_futureScore; /*< estimate of total cost when using this translation option, includes language model probabilities */
- typedef std::map<const FeatureFunction *, Scores> _ScoreCacheMap;
- _ScoreCacheMap m_cachedScores;
+ typedef std::map<const FeatureFunction*, Scores> _ScoreCacheMap;
+ _ScoreCacheMap m_lexReorderingScores;
public:
/** constructor. Used by initial translation step */
@@ -131,15 +131,15 @@ public:
}
/** returns cached scores */
- inline const Scores *GetCachedScores(const FeatureFunction *scoreProducer) const {
- _ScoreCacheMap::const_iterator it = m_cachedScores.find(scoreProducer);
- if(it == m_cachedScores.end())
+ inline const Scores *GetLexReorderingScores(const FeatureFunction *scoreProducer) const {
+ _ScoreCacheMap::const_iterator it = m_lexReorderingScores.find(scoreProducer);
+ if(it == m_lexReorderingScores.end())
return NULL;
else
return &(it->second);
}
- void CacheScores(const FeatureFunction &scoreProducer, const Scores &score);
+ void CacheLexReorderingScores(const FeatureFunction &scoreProducer, const Scores &score);
TO_STRING();