mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-11 19:27:11 +03:00
66 lines
2.0 KiB
C++
66 lines
2.0 KiB
C++
/***********************************************************************
|
|
Moses - factored phrase-based language decoder
|
|
Copyright (C) 2010 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
|
|
***********************************************************************/
|
|
|
|
#pragma once
|
|
#ifndef RULEEXIST_H_INCLUDED_
|
|
#define RULEEXIST_H_INCLUDED_
|
|
|
|
#include <vector>
|
|
|
|
#include "Hole.h"
|
|
|
|
namespace MosesTraining
|
|
{
|
|
|
|
// reposity of extracted phrase pairs
|
|
// which are potential holes in larger phrase pairs
|
|
class RuleExist
|
|
{
|
|
protected:
|
|
std::vector< std::vector<HoleList> > m_phraseExist;
|
|
// indexed by source pos. and source length
|
|
// maps to list of holes where <int, int> are target pos
|
|
|
|
public:
|
|
RuleExist(size_t size)
|
|
:m_phraseExist(size) {
|
|
// size is the length of the source sentence
|
|
for (size_t pos = 0; pos < size; ++pos) {
|
|
// create empty hole lists
|
|
std::vector<HoleList> &endVec = m_phraseExist[pos];
|
|
endVec.resize(size - pos);
|
|
}
|
|
}
|
|
|
|
void Add(int startT, int endT, int startS, int endS) {
|
|
m_phraseExist[startT][endT - startT].push_back(Hole(startS, endS, startT, endT));
|
|
}
|
|
|
|
const HoleList &GetSourceHoles(int startT, int endT) const {
|
|
const HoleList &sourceHoles = m_phraseExist[startT][endT - startT];
|
|
return sourceHoles;
|
|
}
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
|
#endif
|