Welcome to mirror list, hosted at ThFree Co, Russian Federation.

scorer.cpp « memscore « contrib - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: e8cf4ce494fd9eceb90078fe17d1ee89ce896d60 (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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
// memscore - in-memory phrase scoring for Statistical Machine Translation
// Christian Hardmeier, FBK-irst, Trento, 2010
// $Id$

#include <cassert>
#include <cstring>
#include <fstream>

#include "scorer-impl.h"
#include "timestamp.h"
#include "lexdecom.h"

#ifdef ENABLE_CHANNEL_SCORER
#include "channel-scorer.h"
#endif

const std::vector<String> &PhraseScorerFactory::scorer_list()
{
  static std::vector<String> list;
  if(list.size() == 0) {
    list.push_back("ml                              - maximum likelihood score (relative frequency)");
    list.push_back("wittenbell                      - Witten-Bell smoothing");
    list.push_back("absdiscount                     - absolute discounting");
    list.push_back("kndiscount1                     - Knesser-Ney discounting");
    list.push_back("kndiscount3                     - modified Knesser-Ney discounting");
    list.push_back("lexweights <weightfile>         - lexical weights (Koehn et al., NAACL 2003)");
#ifdef ENABLE_CHANNEL_SCORER
    list.push_back("channel <sigma> <srclm> <tgtlm> - channel adaptation");
#endif
    list.push_back("const <constant>                - constant phrase penalty");
    list.push_back("lexdecomp <weightfile>          - lexical decomposition smoothing");
  }

  return list;
}

PhraseScorer *PhraseScorerFactory::create_scorer(const char *argv[], int &argp, bool reverse)
{
  const char *arg = argv[argp++];
  if(arg == NULL)
    usage();

  if(!strcmp(arg, "ml"))
    return MLPhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if(!strcmp(arg, "wittenbell"))
    return WittenBellPhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if(!strcmp(arg, "absdiscount"))
    return AbsoluteDiscountPhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if(!strcmp(arg, "kndiscount1"))
    return KNDiscount1PhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if(!strcmp(arg, "kndiscount3"))
    return KNDiscount3PhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if(!strcmp(arg, "lexweights"))
    return LexicalWeightPhraseScorer::create_scorer(argv, argp, reverse, *this);
#ifdef ENABLE_CHANNEL_SCORER
  else if(!strcmp(arg, "channel"))
    return ChannelAdaptationPhraseScorer::create_scorer(argv, argp, reverse, *this);
#endif
  else if(!strcmp(arg, "const"))
    return ConstantPhraseScorer::create_scorer(argv, argp, reverse, *this);
  else if (!strcmp(arg, "lexdecomp"))
    return LexicalDecompositionPhraseScorer::create_scorer(argv, argp, reverse, *this);
  else {
    std::cerr << "Unknown phrase scorer type: " << arg << std::endl << std::endl;
    usage();
  }
}

PhraseScorer *MLPhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  return new MLPhraseScorer(ptf.get_phrase_table(), reverse);
}

#if 1
void MLPhraseScorer::do_score_phrases() {}
#else
void MLPhraseScorer::do_score_phrases()
{
  Score bla = 0;
  Timestamp t_it;
  for(Count i = 0; i < 200; i++) {
    for(PhraseTable::iterator it = phrase_table_.begin(); it != phrase_table_.end(); ++it) {
      PhrasePairInfo ppair = *it;
      Phrase tgt = ppair.get_tgt();
      bla += bla * ppair.get_count() / phrase_table_.get_tgt_phrase(tgt).get_count();
    }
  }
  std::cerr << "Time for 200 iterations with ML estimation: " << (t_it.elapsed_time() / 1000) << " ms" << std::endl;
  std::cerr << bla << std::endl;
}
#endif

Score MLPhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
  return static_cast<Score>(it->get_count()) / tgt_phrase.get_count();
}

PhraseScorer *WittenBellPhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  return new WittenBellPhraseScorer(ptf.get_phrase_table(), reverse);
}

Score WittenBellPhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
  return static_cast<Score>(it->get_count()) / (tgt_phrase.get_count() + tgt_phrase.get_distinct());
}


PhraseScorer *AbsoluteDiscountPhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  return new AbsoluteDiscountPhraseScorer(ptf.get_phrase_table(), reverse);
}
// p(s|t) = (c(s,t) - beta) / c(t)    <-- absolute discounting

void AbsoluteDiscountPhraseScorer::do_score_phrases()
{
  Count n1 = 0, n2 = 0;

  for(PhraseTable::iterator it = phrase_table_.begin(); it != phrase_table_.end(); ++it) {
    PhrasePairInfo ppinfo = *it;
    Count c = ppinfo.get_count();
    switch(c) {
    case 1:
      n1++;
      break;
    case 2:
      n2++;
    }
  }

  discount_ = static_cast<Score>(n1) / (n1 + 2*n2);
}

inline Score AbsoluteDiscountPhraseScorer::get_discount()
{
  return discount_;
}

Score AbsoluteDiscountPhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
  return (it->get_count() - discount_) / tgt_phrase.get_count();
}

PhraseScorer *KNDiscount1PhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  return new KNDiscount1PhraseScorer(ptf.get_phrase_table(), reverse);
}


void KNDiscount1PhraseScorer::do_score_phrases()
{
  Count n1 = 0, n2 = 0;
  Count total_count = 0;

  for(PhraseTable::iterator it = phrase_table_.begin(); it != phrase_table_.end(); ++it) {
    PhrasePairInfo ppinfo = *it;
    PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
    total_count += tgt_phrase.get_count();

    Count c = ppinfo.get_count();
    switch(c) {
    case 1:
      n1++;
      break;
    case 2:
      n2++;
    }
  }

  discount_ = static_cast<Score>(n1) / (n1 + 2*n2);
  total_count_ = static_cast<Count>(total_count);

}

Score KNDiscount1PhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
  PhraseInfo &src_phrase = phrase_table_.get_src_phrase(it->get_src());
  return ((it->get_count() - discount_) / tgt_phrase.get_count()) + (discount_ * tgt_phrase.get_distinct() / tgt_phrase.get_count())*(src_phrase.get_count() / total_count_);
}

PhraseScorer *KNDiscount3PhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  return new KNDiscount3PhraseScorer(ptf.get_phrase_table(), reverse);
}


void KNDiscount3PhraseScorer::do_score_phrases()
{
  Count n1 = 0, n2 = 0, n3 = 0, n4 = 0;
  Count total_count = 0; //total number of source or target phrases (including repetitions)
  Count total_distinct_n1 = 0; //sum_{s} n1plus(s,*)
  Count total_distinct_n2 = 0;
  Count total_distinct_n3plus = 0;
  Score y;

  for(PhraseTable::iterator it = phrase_table_.begin(); it != phrase_table_.end(); ++it) {
    PhrasePairInfo ppinfo = *it;
    PhraseInfo &src_phrase = phrase_table_.get_src_phrase(it->get_src());
    PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());

    total_count += src_phrase.get_count();

    Count c = ppinfo.get_count();
    switch(c) {
    case 1:
      n1++;
      tgt_phrase.inc_n1();
      src_phrase.inc_n1();
      total_distinct_n1++;
      break;
    case 2:
      n2++;
      tgt_phrase.inc_n2();
      src_phrase.inc_n2();
      total_distinct_n2++;
      break;
    case 3:
      n3++;
      tgt_phrase.inc_n3plus();
      src_phrase.inc_n3plus();
      total_distinct_n3plus++;
      break;
    case 4:
      n4++;
      tgt_phrase.inc_n3plus();
      src_phrase.inc_n3plus();
      total_distinct_n3plus++;
    }

  }

  y = (Score)(n1) / (n1 + 2*n2);
  discount1_ = static_cast<Score> (1) - (2)*(y)*(n2 / n1);
  discount2_ = static_cast<Score> (2) - (3)*(y)*(n3 / n2);
  discount3plus_ = static_cast<Score> (3) - (4)*(y)*(n4 / n3);
  total_distinct_n1_ = static_cast<Count>(total_distinct_n1);
  total_distinct_n2_ = static_cast<Count>(total_distinct_n2);
  total_distinct_n3plus_ = static_cast<Count>(total_distinct_n3plus);
}

Score KNDiscount3PhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  PhrasePairInfo ppinfo = *it;
  PhraseInfo &tgt_phrase = phrase_table_.get_tgt_phrase(it->get_tgt());
  PhraseInfo &src_phrase = phrase_table_.get_src_phrase(it->get_src());

  Score norm = (discount1_ * tgt_phrase.get_n1() + discount2_ * tgt_phrase.get_n2() + discount3plus_ * tgt_phrase.get_n3plus()) / tgt_phrase.get_count();
  Count c = ppinfo.get_count();
  switch(c) {
  case 1:
    return ((it->get_count() - discount1_) / tgt_phrase.get_count()) + \
           norm*(src_phrase.get_n1() / total_distinct_n1_);
    break;
  case 2:
    return ((it->get_count() - discount2_) / tgt_phrase.get_count()) + \
           norm*(src_phrase.get_n2() / total_distinct_n2_);
    break;
  default:
    return ((it->get_count() - discount3plus_) / tgt_phrase.get_count()) + \
           norm*(src_phrase.get_n3plus() / total_distinct_n3plus_);
  }
}

PhraseScorer *LexicalWeightPhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  bool overall_max = true;

  if(argv[argp] == NULL)
    usage();

  if(!strcmp(argv[argp], "-AlignmentCount")) {
    overall_max = false;
    argp++;
    if(argv[argp] == NULL)
      usage();
  }

  String lwfile(argv[argp++]);
  return new LexicalWeightPhraseScorer(ptf.get_phrase_table(), reverse, lwfile, overall_max);
}

LexicalWeightPhraseScorer::LexicalWeightPhraseScorer(PhraseTable &pd, bool reverse, const String &weightfile, bool overall_max) :
  PhraseScorer(pd, reverse), overall_max_score_(overall_max), null_word_(PhraseText::index_word("NULL"))
{
  std::ifstream wfile(weightfile.c_str());

  while(!wfile.eof()) {
    if(wfile.fail()) {
      std::cerr << "Problem reading file: " << weightfile << std::endl;
      exit(1);
    }

    String src, tgt;
    Score weight;

    wfile >> src >> tgt >> weight;
    Count src_id = PhraseText::index_word(src);
    Count tgt_id = PhraseText::index_word(tgt);
    weight_map_.insert(std::make_pair(std::make_pair(src_id, tgt_id), weight));
  }

  wfile.close();
}

Score LexicalWeightPhraseScorer::get_weight(const String &s_src, const String &s_tgt) const
{
  Count src = PhraseText::index_word(s_src);
  Count tgt = PhraseText::index_word(s_tgt);
  return get_weight(src, tgt);
}

inline Score LexicalWeightPhraseScorer::get_weight(Count src, Count tgt) const
{
  WeightMapType_::const_iterator it = weight_map_.find(std::make_pair(src, tgt));
  if(it == weight_map_.end())
    return 0.00001;		// default value copied from Philipp Koehn's scorer
  return it->second;
}

#if 1
void LexicalWeightPhraseScorer::do_score_phrases() {}
#else
void LexicalWeightPhraseScorer::do_score_phrases()
{
  Score bla = 0;
  Timestamp t_it;
  for(Count i = 0; i < 200; i++) {
    for(PhraseTable::iterator it = phrase_table_.begin(); it != phrase_table_.end(); ++it) {
      PhrasePairInfo ppair = *it;
      Phrase src = ppair.get_src();
      Phrase tgt = ppair.get_tgt();
      bla += bla * get_score(src, tgt);
    }
  }
  std::cerr << "Time for 200 iterations with lexical weights: " << (t_it.elapsed_time() / 1000) << " ms" << std::endl;
  std::cerr << bla << std::endl;
}
#endif

Score LexicalWeightPhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  const Phrase src = it->get_src();
  const Phrase tgt = it->get_tgt();
  const PhraseText &src_phrase = phrase_table_.get_src_phrase(src).get_phrase();
  const PhraseText &tgt_phrase = phrase_table_.get_tgt_phrase(tgt).get_phrase();
  const PhrasePairInfo &ppair = *it;

  Count max_count = 0;

  Score maxlex = 0;
  PhrasePairInfo::AlignmentVector av = ppair.get_alignments();
  for(PhrasePairInfo::AlignmentVector::const_iterator it = av.begin(); it != av.end(); ++it) {
    const PhraseAlignment &alig = it->first;
    const Count alig_cnt = it->second;

    assert(alig.get_source_length() == src_phrase.size() && alig.get_target_length() == tgt_phrase.size());

    if(!overall_max_score_ && alig_cnt < max_count)
      continue;
    max_count = alig_cnt;

    Score lex = 1;
    for(Count s = 0; s < src_phrase.size(); s++) {
      Score factor = 0;
      Count na = 0;
      for(Count t = 0; t < tgt_phrase.size(); t++)
        if(alig.is_aligned(s, t)) {
          const Score w = get_weight(src_phrase[s], tgt_phrase[t]);
          factor += w;
          na++;
        }

      if(na > 0)
        lex *= factor / na;
      else
        lex *= get_weight(src_phrase[s], null_word_);
    }

    if(lex > maxlex)
      maxlex = lex;
  }

  return maxlex;
}

PhraseScorer *ConstantPhraseScorer::create_scorer(const char *argv[], int &argp, bool reverse, const PhraseScorerFactory &ptf)
{
  if(argv[argp] == NULL)
    usage();
  Score c = atof(argv[argp++]);
  return new ConstantPhraseScorer(ptf.get_phrase_table(), reverse, c);
}

Score ConstantPhraseScorer::do_get_score(const PhraseTable::const_iterator &it)
{
  return constant_;
}