blob: 7b9fdfb72ee326adf660068c32866d00ba220311 (
plain)
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
60
61
62
63
64
65
66
67
|
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2012 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
#include "TypeDef.h"
#include "Word.h"
#include "Factor.h"
#include <boost/functional/hash.hpp>
namespace Moses
{
class TerminalHasher
{
public:
// Generate a hash value for a word representing a terminal. It's
// assumed that the same subset of factors will be active for all words
// that are hashed.
size_t operator()(const Word &t) const {
size_t seed = 0;
for (size_t i = 0; i < MAX_NUM_FACTORS; ++i) {
const Factor *f = t[i];
if (f) {
boost::hash_combine(seed, *f);
}
}
return seed;
}
};
class TerminalEqualityPred
{
public:
// Equality predicate for comparing words representing terminals. As
// with the hasher, it's assumed that all words will have the same
// subset of active factors.
bool operator()(const Word &t1, const Word &t2) const {
for (size_t i = 0; i < MAX_NUM_FACTORS; ++i) {
const Factor *f1 = t1[i];
const Factor *f2 = t2[i];
if (f1 && f1->Compare(*f2)) {
return false;
}
}
return true;
}
};
} // namespace Moses
|
