/usr/include/ngram/ngram-split.h is in libngram-dev 1.3.2-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | // Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
//
// Copyright 2005-2016 Brian Roark and Google, Inc.
// Class for splitting an NGram model into multiple parts by context.
#ifndef NGRAM_NGRAM_SPLIT_H_
#define NGRAM_NGRAM_SPLIT_H_
#include <map>
#include <set>
#include <string>
#include <vector>
#include <ngram/ngram-context.h>
#include <ngram/ngram-model.h>
#include <ngram/ngram-mutable-model.h>
#include <ngram/util.h>
namespace ngram {
using std::map;
using std::set;
using fst::StdArc;
using fst::Fst;
using fst::MutableFst;
using fst::VectorFst;
// Splits NGram model into multiple parts by context.
// Assumes outer context encompasses input.
template <class Arc>
class NGramSplit {
public:
typedef typename Arc::StateId StateId;
typedef typename Arc::Label Label;
typedef typename Arc::Weight Weight;
// Split based on context patterns (sse ngram-context.h for more
// information).
NGramSplit(const Fst<Arc> &fst, const vector<string> &context_patterns,
Label backoff_label = 0, double norm_eps = kNormEps,
bool include_all_suffixes = false);
// Split based on context begin and end vectors (sse ngram-context.h
// for more information).
NGramSplit(const Fst<Arc> &infst, const vector<vector<Label>> &contexts,
Label backoff_label = 0, double norm_eps = kNormEps,
bool include_all_suffixes = false);
// Return next NGram component model.
bool NextNGramModel(MutableFst<Arc> *outfst) {
outfst->DeleteStates();
CreateSplitFst(model_.GetFst(), split_, outfst);
++split_;
if (Error()) return false;
return true;
}
// Indicates if no more components to return.
bool Done() const { return split_ >= contexts_.size(); }
// Returns true if split in a bad state.
bool Error() const { return error_; }
protected:
void SetError() { error_ = true; }
private:
void SplitNGramModel(const Fst<Arc> &fst);
void CreateSplitFst(const Fst<Arc> &fst, size_t context_idx,
MutableFst<Arc> *outfst);
NGramModel<Arc> model_;
vector<std::unique_ptr<NGramContext>> contexts_; // Ordered contexts to split
vector<vector<StateId>> context_states_; // States needed for each context.
size_t split_;
bool include_all_suffixes_;
bool error_;
};
// Split based on context patterns (sse ngram-context.h for more information).
template <typename Arc>
NGramSplit<Arc>::NGramSplit(const Fst<Arc> &fst,
const vector<string> &context_patterns,
Label backoff_label, double norm_eps,
bool include_all_suffixes)
: model_(fst, backoff_label, norm_eps, true),
split_(0),
include_all_suffixes_(include_all_suffixes),
error_(false) {
for (int i = 0; i < context_patterns.size(); ++i) {
contexts_.push_back(std::unique_ptr<NGramContext>(
new NGramContext(context_patterns[i], model_.HiOrder())));
}
SplitNGramModel(fst);
}
// Split based on context begin and end vectors (sse ngram-context.h
// for more information).
template <typename Arc>
NGramSplit<Arc>::NGramSplit(const Fst<Arc> &fst,
const vector<vector<Label>> &contexts,
Label backoff_label, double norm_eps,
bool include_all_suffixes)
: model_(fst, backoff_label, norm_eps, true),
split_(0),
include_all_suffixes_(include_all_suffixes),
error_(false) {
for (int i = 0; i < contexts.size() - 1; ++i) {
contexts_.push_back(std::unique_ptr<NGramContext>(
new NGramContext(contexts[i], contexts[i + 1], model_.HiOrder())));
}
SplitNGramModel(fst);
}
template <typename Arc>
void NGramSplit<Arc>::SplitNGramModel(const Fst<Arc> &fst) {
// For each state, compute the strict split it belongs to.
vector<set<size_t>> state_splits(model_.NumStates());
for (StateId state = 0; state < model_.NumStates(); ++state) {
const vector<Label> &ngram = model_.StateNGram(state);
for (size_t i = 0; i < contexts_.size(); ++i) {
if (contexts_[i]->HasContext(ngram, include_all_suffixes_))
state_splits[state].insert(i);
}
}
// Make sure the start state is added to every split.
for (size_t i = 0; i < contexts_.size(); ++i)
state_splits[fst.Start()].insert(i);
// For each state, compute the sets of splits it needs to belong
// to maintain the core model topology: needed ascending arcs and
// backoff arcs.
for (int order = model_.HiOrder(); order > 0; --order) {
for (StateId state = 0; state < model_.NumStates(); ++state) {
if (model_.StateOrder(state) != order) continue;
// Second get more splits from ascending arcs.
for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done();
aiter.Next()) {
const Arc &arc = aiter.Value();
if (model_.StateOrder(arc.nextstate) != model_.StateOrder(state) + 1)
continue;
for (set<size_t>::const_iterator iter =
state_splits[arc.nextstate].begin();
iter != state_splits[arc.nextstate].end(); ++iter) {
state_splits[state].insert(*iter);
}
}
// TODO(allauzen): decide whether keeping backoff of out of context
// states. If so, process backoff after ascending arcs.
// First propage the current splits for 'state' to its backoff.
StateId bo_state = model_.GetBackoff(state, 0);
if (bo_state >= 0) {
for (set<size_t>::const_iterator iter = state_splits[state].begin();
iter != state_splits[state].end(); ++iter) {
state_splits[bo_state].insert(*iter);
}
}
}
}
// Make sure the unigram state was added to every split.
for (size_t i = 0; i < contexts_.size(); ++i) {
if (state_splits[model_.UnigramState()].count(i) != 1) {
NGRAMERROR() << "Unigram state not added to every split";
SetError();
return;
}
}
// Create state vectors for every context.
context_states_.resize(contexts_.size());
for (StateId state = 0; state < model_.NumStates(); ++state) {
for (set<size_t>::const_iterator iter = state_splits[state].begin();
iter != state_splits[state].end(); ++iter) {
context_states_[*iter].push_back(state);
}
}
}
template <typename Arc>
void NGramSplit<Arc>::CreateSplitFst(const Fst<Arc> &fst, size_t context_idx,
MutableFst<Arc> *split_fst) {
if (Error()) return;
split_fst->SetInputSymbols(fst.InputSymbols());
split_fst->SetOutputSymbols(fst.OutputSymbols());
map<StateId, StateId> state_map;
vector<bool> state_in_context(model_.NumStates());
// Create all required states in each split, and compute
// state map for each split.
for (size_t i = 0; i < context_states_[context_idx].size(); ++i) {
state_in_context[context_states_[context_idx][i]] = true;
state_map[context_states_[context_idx][i]] = split_fst->AddState();
}
// Add all needed and strictly in context transitions to each split.
for (size_t i = 0; i < context_states_[context_idx].size(); ++i) {
StateId state = context_states_[context_idx][i];
Weight bo_weight = NGramModel<Arc>::UnitCount();
StateId bo_state = model_.GetBackoff(state, &bo_weight);
if (bo_state != kNoStateId) {
// Add backoff arc
split_fst->AddArc(state_map[state],
Arc(0, 0, bo_weight, state_map[bo_state]));
}
if (state == fst.Start()) split_fst->SetStart(state_map[state]);
const vector<Label> &ngram = model_.StateNGram(state);
bool in_context =
contexts_[context_idx]->HasContext(ngram, include_all_suffixes_);
for (ArcIterator<Fst<Arc>> aiter(fst, state); !aiter.Done(); aiter.Next()) {
const Arc &arc = aiter.Value();
if (arc.ilabel == model_.BackoffLabel()) continue;
StateId nextstate = arc.nextstate;
if (!in_context &&
((model_.StateOrder(nextstate) != model_.StateOrder(state) + 1) ||
!state_in_context[nextstate])) {
continue;
}
typename map<StateId, StateId>::const_iterator iter =
state_map.find(nextstate);
if (!in_context && state != fst.Start() && iter == state_map.end()) {
NGRAMERROR() << "out of context n-gram with no destination state";
SetError();
return;
}
while (iter == state_map.end()) {
nextstate = model_.GetBackoff(nextstate, 0);
if (nextstate == kNoStateId) {
NGRAMERROR() << "backoff state not found for destination state";
SetError();
return;
}
iter = state_map.find(nextstate);
}
split_fst->AddArc(state_map[state],
Arc(arc.ilabel, arc.olabel, arc.weight, iter->second));
}
if (in_context &&
NGramModel<Arc>::ScalarValue(fst.Final(state)) !=
NGramModel<Arc>::ScalarValue(Weight::Zero())) {
split_fst->SetFinal(state_map[state], fst.Final(state));
}
}
ArcSort(split_fst, fst::ILabelCompare<Arc>());
}
} // namespace ngram
#endif // NGRAM_NGRAM_SPLIT_H_
|