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
|
// -*- c++ -*-
// Phrase scorer that counts the number of unaligend words in the phrase
// written by Ulrich Germann
#include "sapt_pscore_base.h"
#include <boost/dynamic_bitset.hpp>
namespace Moses {
namespace bitext
{
template<typename Token>
class
PScoreUnaligned : public PhraseScorer<Token>
{
typedef boost::dynamic_bitset<uint64_t> bitvector;
public:
PScoreUnaligned(string const spec)
{
this->m_index = -1;
int f = this->m_num_feats = atoi(spec.c_str());
UTIL_THROW_IF2(f != 1 && f != 2,"unal parameter must be 1 or 2 at "<<HERE);
this->m_feature_names.resize(f);
if (f == 1)
this->m_feature_names[0] = "unal";
else
{
this->m_feature_names[0] = "unal-s";
this->m_feature_names[1] = "unal-t";
}
}
bool
isLogVal(int i) const { return false; }
bool
isIntegerValued(int i) const { return true; }
void
operator()(Bitext<Token> const& bt,
PhrasePair<Token>& pp,
vector<float> * dest = NULL) const
{
if (!dest) dest = &pp.fvals;
// uint32_t sid1=0,sid2=0,off1=0,off2=0,len1=0,len2=0;
// parse_pid(pp.p1, sid1, off1, len1);
// parse_pid(pp.p2, sid2, off2, len2);
bitvector check1(pp.len1),check2(pp.len2);
for (size_t i = 0; i < pp.aln.size(); )
{
check1.set(pp.aln[i++]);
check2.set(pp.aln.at(i++));
}
if (this->m_num_feats == 1)
{
(*dest)[this->m_index] = pp.len1 - check1.count();
(*dest)[this->m_index] += pp.len2 - check2.count();
}
else
{
(*dest)[this->m_index] = pp.len1 - check1.count();
(*dest)[this->m_index+1] = pp.len2 - check2.count();
}
}
};
} // namespace bitext
} // namespace Moses
|
