Back FactorCollection with a memory pool. Less memory for large vocabularies.

1 files changed, 3 insertions, 3 deletions

diff --git a/moses/ScoreComponentCollection.h b/moses/ScoreComponentCollection.h
index be23e03fd..32b8cb1c9 100644
--- a/moses/ScoreComponentCollection.h
+++ b/moses/ScoreComponentCollection.h
@@ -200,7 +200,7 @@ public:
   }
 
   //For features which have an unbounded number of components
-  void SparseMinusEquals(const std::string& full_name, float score)
+  void SparseMinusEquals(const StringPiece &full_name, float score)
   {
     FName fname(full_name);
     m_scores[fname] -= score;
@@ -240,7 +240,7 @@ public:
 	}
 
   //For features which have an unbounded number of components
-  void PlusEquals(const ScoreProducer*sp, const std::string& name, float score)
+  void PlusEquals(const ScoreProducer*sp, const StringPiece &name, float score)
   {
     CHECK(sp->GetNumScoreComponents() == ScoreProducer::unlimited);
     FName fname(sp->GetScoreProducerDescription(),name);
@@ -248,7 +248,7 @@ public:
   }
 
   //For features which have an unbounded number of components
-  void SparsePlusEquals(const std::string& full_name, float score)
+  void SparsePlusEquals(const StringPiece &full_name, float score)
   {
   	FName fname(full_name);
     m_scores[fname] += score;