1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
|
/***********************************************************************
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"
// 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
|
