mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2025-01-06 19:49:41 +03:00
72 lines
1.4 KiB
C++
72 lines
1.4 KiB
C++
/*
|
|
* InputPaths.cpp
|
|
*
|
|
* Created on: 23 Oct 2015
|
|
* Author: hieu
|
|
*/
|
|
#include <iostream>
|
|
#include "InputPaths.h"
|
|
#include "Phrase.h"
|
|
#include "System.h"
|
|
#include "legacy/Range.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace Moses2
|
|
{
|
|
|
|
InputPaths::~InputPaths() {
|
|
delete m_blank;
|
|
}
|
|
|
|
void InputPaths::Init(const PhraseImpl &input, const System &system)
|
|
{
|
|
size_t numPt = system.mappings.size();
|
|
size_t size = input.GetSize();
|
|
size_t maxLength = min(size, system.maxPhraseLength);
|
|
|
|
// create blank path for initial hypo
|
|
Range range(NOT_FOUND, NOT_FOUND);
|
|
SubPhrase subPhrase = input.GetSubPhrase(NOT_FOUND, NOT_FOUND);
|
|
m_blank = new InputPath(subPhrase, range, numPt, NULL);
|
|
|
|
// create normal paths of subphrases through the sentence
|
|
for (size_t startPos = 0; startPos < size; ++startPos) {
|
|
const InputPath *prefixPath = NULL;
|
|
|
|
for (size_t phaseSize = 1; phaseSize <= maxLength; ++phaseSize) {
|
|
size_t endPos = startPos + phaseSize - 1;
|
|
|
|
if (endPos >= size) {
|
|
break;
|
|
}
|
|
|
|
SubPhrase subPhrase = input.GetSubPhrase(startPos, endPos);
|
|
Range range(startPos, endPos);
|
|
|
|
InputPath path(subPhrase, range, numPt, prefixPath);
|
|
m_inputPaths.push_back(path);
|
|
|
|
prefixPath = &m_inputPaths.back();
|
|
}
|
|
}
|
|
|
|
}
|
|
|
|
void InputPaths::DeleteUnusedPaths()
|
|
{
|
|
size_t ind = 0;
|
|
while (ind < m_inputPaths.size()) {
|
|
const InputPath &path = m_inputPaths[ind];
|
|
if (!path.IsUsed()) {
|
|
m_inputPaths.erase(m_inputPaths.begin() + ind);
|
|
}
|
|
else {
|
|
++ind;
|
|
}
|
|
}
|
|
}
|
|
|
|
}
|
|
|