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
|
// $Id$
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2006 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 <string>
#include <vector>
#include <map>
#include "Factor.h"
#include "Phrase.h"
#include "TypeDef.h"
#include "Util.h"
#include "WordsRange.h"
#include "ScoreProducer.h"
class FactorCollection;
class Factor;
class Phrase;
class Hypothesis;
/***
* The LexicalReordering class handles everything involved with
* lexical reordering. It loads a probability table P(orientation|f,e)
* and computes scores in either forward, backward, or bidirectional
* direction.
*/
class LexicalReordering : public ScoreProducer
{
private:
// Members
typedef std::map<std::string, std::vector<float> > ORIENTATION_TABLE;
// This is the order in which the different forward/backward
// probabilities are stored in the table.
enum TableLookupMsd { BACK_M, BACK_S, BACK_D, FOR_M,FOR_S, FOR_D };
enum TableLookupMonotone { BACK_MONO, BACK_NONMONO, FOR_MONO, FOR_NONMONO};
// This is the order in which pieces appear in the orientation table
// when conditioning on f and e.
enum FEFileFormat { FE_FOREIGN, FE_ENGLISH, FE_PROBS };
// This is the order in which pieces appear in the orientation table
// when conditioning on f only.
enum FFileFormat { F_FOREIGN, F_PROBS };
// different numbers of probabilities for different ranges of
// orientation variable
static const int MSD_NUM_PROBS = 6;
static const int MONO_NUM_PROBS = 4;
int m_orientation; // msd or monotone
std::vector<int> m_direction; // contains forward, backward, or both (bidirectional)
int m_condition; // fe or f
int m_numberscores; //2, 3, 4 or 6
std::string m_filename; // probability table location
ORIENTATION_TABLE m_orientation_table; // probability table
// Functions
void LoadFile(void);
public:
// Constructor: takes 3 arguments -- filename is the path to the
// orientation probability table, orientation is one of {MSD, MONO},
// direction is one of {FOR,BACK,BI}, and condition is one of {F,FE}.
LexicalReordering(const std::string &filename, int orientation, int direction,
int condition, const std::vector<float>& weights);
// Descructor
~LexicalReordering(void) {}
// Compute and return a score for a hypothesis
std::vector<float> CalcScore(Hypothesis *curr_hypothesis);
// Print the orientation probability table
void PrintTable(void);
void SetForwardWeight(float weight);
void SetBackwardWeight(float weight);
float GetForwardWeight(void);
float GetBackwardWeight(void);
float GetProbability(Hypothesis *hypothesis, int orientation);
unsigned int GetNumScoreComponents() const;
const std::string GetScoreProducerDescription() const;
};
|
