mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-11 19:27:11 +03:00
2b4e61d826
Compiles, not tested. Conflicts: Jamroot OnDiskPt/PhraseNode.h OnDiskPt/TargetPhrase.cpp OnDiskPt/TargetPhrase.h OnDiskPt/TargetPhraseCollection.cpp mert/BleuScorer.cpp mert/Data.cpp mert/FeatureData.cpp moses-chart-cmd/src/Main.cpp moses/src/AlignmentInfo.h moses/src/ChartManager.cpp moses/src/LM/Ken.cpp moses/src/LM/Ken.h moses/src/LMList.h moses/src/LexicalReordering.h moses/src/PhraseDictionaryTree.h moses/src/ScoreIndexManager.h moses/src/StaticData.h moses/src/TargetPhrase.h moses/src/Word.cpp scripts/ems/experiment.meta scripts/ems/experiment.perl scripts/training/train-model.perl
100 lines
2.7 KiB
C++
100 lines
2.7 KiB
C++
// $Id$
|
|
/***********************************************************************
|
|
Moses - factored phrase-based, hierarchical and syntactic language decoder
|
|
Copyright (C) 2009 Hieu Hoang
|
|
|
|
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 <string>
|
|
#include <fstream>
|
|
#include "OnDiskWrapper.h"
|
|
#include "Vocab.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace OnDiskPt
|
|
{
|
|
|
|
bool Vocab::Load(OnDiskWrapper &onDiskWrapper)
|
|
{
|
|
fstream &file = onDiskWrapper.GetFileVocab();
|
|
|
|
string line;
|
|
while(getline(file, line)) {
|
|
vector<string> tokens;
|
|
Moses::Tokenize(tokens, line);
|
|
CHECK(tokens.size() == 2);
|
|
const string &key = tokens[0];
|
|
m_vocabColl[key] = Moses::Scan<UINT64>(tokens[1]);
|
|
}
|
|
|
|
// create lookup
|
|
// assume contiguous vocab id
|
|
m_lookup.resize(m_vocabColl.size() + 1);
|
|
m_nextId = m_lookup.size();
|
|
|
|
CollType::const_iterator iter;
|
|
for (iter = m_vocabColl.begin(); iter != m_vocabColl.end(); ++iter) {
|
|
UINT32 vocabId = iter->second;
|
|
const std::string &word = iter->first;
|
|
|
|
m_lookup[vocabId] = word;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
void Vocab::Save(OnDiskWrapper &onDiskWrapper)
|
|
{
|
|
fstream &file = onDiskWrapper.GetFileVocab();
|
|
CollType::const_iterator iterVocab;
|
|
for (iterVocab = m_vocabColl.begin(); iterVocab != m_vocabColl.end(); ++iterVocab) {
|
|
const string &word = iterVocab->first;
|
|
UINT32 vocabId = iterVocab->second;
|
|
|
|
file << word << " " << vocabId << endl;
|
|
}
|
|
}
|
|
|
|
UINT64 Vocab::AddVocabId(const std::string &str)
|
|
{
|
|
// find string id
|
|
CollType::const_iterator iter = m_vocabColl.find(str);
|
|
if (iter == m_vocabColl.end()) {
|
|
// add new vocab entry
|
|
m_vocabColl[str] = m_nextId;
|
|
return m_nextId++;
|
|
} else {
|
|
// return existing entry
|
|
return iter->second;
|
|
}
|
|
}
|
|
|
|
UINT64 Vocab::GetVocabId(const std::string &str, bool &found) const
|
|
{
|
|
// find string id
|
|
CollType::const_iterator iter = m_vocabColl.find(str);
|
|
if (iter == m_vocabColl.end()) {
|
|
found = false;
|
|
return 0; //return whatever
|
|
} else {
|
|
// return existing entry
|
|
found = true;
|
|
return iter->second;
|
|
}
|
|
}
|
|
|
|
}
|