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
|
// $Id$
// vim:tabstop=2
/***********************************************************************
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
***********************************************************************/
#ifndef moses_Phrase_h
#define moses_Phrase_h
#include <iostream>
#include <vector>
#include <list>
#include <string>
#include <boost/functional/hash.hpp>
#include "Word.h"
#include "WordsBitmap.h"
#include "TypeDef.h"
#include "Util.h"
#include "util/string_piece.hh"
namespace Moses
{
class Phrase
{
friend std::ostream& operator<<(std::ostream&, const Phrase&);
private:
std::vector<Word> m_words;
public:
/** No longer does anything as not using mem pool for Phrase class anymore */
static void InitializeMemPool();
static void FinalizeMemPool();
/** create empty phrase
*/
Phrase(size_t reserveSize);
/** create phrase from vectors of words */
Phrase(const std::vector< const Word* > &mergeWords);
/** destructor */
virtual ~Phrase();
/** Fills phrase with words from format string, typically from phrase table or sentence input
* \param factorOrder factor types of each element in 2D string vector
* \param phraseString formatted input string to parse
* \param factorDelimiter delimiter between factors.
*/
void CreateFromString(const std::vector<FactorType> &factorOrder, const StringPiece &phraseString, const StringPiece &factorDelimiter);
void CreateFromStringNewFormat(FactorDirection direction
, const std::vector<FactorType> &factorOrder
, const std::string &phraseString
, const std::string &factorDelimiter
, Word &lhs);
/** copy factors from the other phrase to this phrase.
IsCompatible() must be run beforehand to ensure incompatible factors aren't overwritten
*/
void MergeFactors(const Phrase ©);
//! copy a single factor (specified by factorType)
void MergeFactors(const Phrase ©, FactorType factorType);
//! copy all factors specified in factorVec and none others
void MergeFactors(const Phrase ©, const std::vector<FactorType>& factorVec);
/** compare 2 phrases to ensure no factors are lost if the phrases are merged
* must run IsCompatible() to ensure incompatible factors aren't being overwritten
*/
bool IsCompatible(const Phrase &inputPhrase) const;
bool IsCompatible(const Phrase &inputPhrase, FactorType factorType) const;
bool IsCompatible(const Phrase &inputPhrase, const std::vector<FactorType>& factorVec) const;
//! number of words
inline size_t GetSize() const {
return m_words.size();
}
//! word at a particular position
inline const Word &GetWord(size_t pos) const {
return m_words[pos];
}
inline Word &GetWord(size_t pos) {
return m_words[pos];
}
//! particular factor at a particular position
inline const Factor *GetFactor(size_t pos, FactorType factorType) const {
const Word &ptr = m_words[pos];
return ptr[factorType];
}
inline void SetFactor(size_t pos, FactorType factorType, const Factor *factor) {
Word &ptr = m_words[pos];
ptr[factorType] = factor;
}
size_t GetNumTerminals() const;
//! whether the 2D vector is a substring of this phrase
bool Contains(const std::vector< std::vector<std::string> > &subPhraseVector
, const std::vector<FactorType> &inputFactor) const;
//! create an empty word at the end of the phrase
Word &AddWord();
//! create copy of input word at the end of the phrase
void AddWord(const Word &newWord) {
AddWord() = newWord;
}
/** appends a phrase at the end of current phrase **/
void Append(const Phrase &endPhrase);
void PrependWord(const Word &newWord);
void Clear()
{
m_words.clear();
}
void RemoveWord(size_t pos)
{
CHECK(pos < m_words.size());
m_words.erase(m_words.begin() + pos);
}
//! create new phrase class that is a substring of this phrase
Phrase GetSubString(const WordsRange &wordsRange) const;
Phrase GetSubString(const WordsRange &wordsRange, FactorType factorType) const;
//! return a string rep of the phrase. Each factor is separated by the factor delimiter as specified in StaticData class
std::string GetStringRep(const std::vector<FactorType> factorsToPrint) const;
TO_STRING();
int Compare(const Phrase &other) const;
/** transitive comparison between 2 phrases
* used to insert & find phrase in dictionary
*/
bool operator< (const Phrase &compare) const
{
return Compare(compare) < 0;
}
bool operator== (const Phrase &compare) const
{
return Compare(compare) == 0;
}
};
inline size_t hash_value(const Phrase& phrase) {
size_t seed = 0;
for (size_t i = 0; i < phrase.GetSize(); ++i) {
boost::hash_combine(seed, phrase.GetWord(i));
}
return seed;
}
}
#endif
|
