Blame view
tools/openfst-1.6.7/include/fst/complement.h
7.54 KB
8dcb6dfcb first commit |
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 |
// See www.openfst.org for extensive documentation on this weighted // finite-state transducer library. // // Class to complement an FST. #ifndef FST_COMPLEMENT_H_ #define FST_COMPLEMENT_H_ #include <algorithm> #include <string> #include <vector> #include <fst/log.h> #include <fst/fst.h> #include <fst/test-properties.h> namespace fst { template <class Arc> class ComplementFst; namespace internal { // Implementation of delayed ComplementFst. The algorithm used completes the // (deterministic) FSA and then exchanges final and non-final states. // Completion, i.e. ensuring that all labels can be read from every state, is // accomplished by using ρ-labels, which match all labels that are otherwise // not found leaving a state. The first state in the output is reserved to be a // new state that is the destination of all ρ-labels. Each remaining output // state s corresponds to input state s - 1. The first arc in the output at // these states is the ρ-label, the remaining arcs correspond to the input // arcs. template <class A> class ComplementFstImpl : public FstImpl<A> { public: using Arc = A; using Label = typename Arc::Label; using StateId = typename Arc::StateId; using Weight = typename Arc::Weight; using FstImpl<A>::SetType; using FstImpl<A>::SetProperties; using FstImpl<A>::SetInputSymbols; using FstImpl<A>::SetOutputSymbols; friend class StateIterator<ComplementFst<Arc>>; friend class ArcIterator<ComplementFst<Arc>>; explicit ComplementFstImpl(const Fst<Arc> &fst) : fst_(fst.Copy()) { SetType("complement"); uint64 props = fst.Properties(kILabelSorted, false); SetProperties(ComplementProperties(props), kCopyProperties); SetInputSymbols(fst.InputSymbols()); SetOutputSymbols(fst.OutputSymbols()); } ComplementFstImpl(const ComplementFstImpl<Arc> &impl) : fst_(impl.fst_->Copy()) { SetType("complement"); SetProperties(impl.Properties(), kCopyProperties); SetInputSymbols(impl.InputSymbols()); SetOutputSymbols(impl.OutputSymbols()); } StateId Start() const { if (Properties(kError)) return kNoStateId; auto start = fst_->Start(); return start != kNoStateId ? start + 1 : 0; } // Exchange final and non-final states; makes ρ-destination state final. Weight Final(StateId s) const { if (s == 0 || fst_->Final(s - 1) == Weight::Zero()) { return Weight::One(); } else { return Weight::Zero(); } } size_t NumArcs(StateId s) const { return s == 0 ? 1 : fst_->NumArcs(s - 1) + 1; } size_t NumInputEpsilons(StateId s) const { return s == 0 ? 0 : fst_->NumInputEpsilons(s - 1); } size_t NumOutputEpsilons(StateId s) const { return s == 0 ? 0 : fst_->NumOutputEpsilons(s - 1); } uint64 Properties() const override { return Properties(kFstProperties); } // Sets error if found, and returns other FST impl properties. uint64 Properties(uint64 mask) const override { if ((mask & kError) && fst_->Properties(kError, false)) { SetProperties(kError, kError); } return FstImpl<Arc>::Properties(mask); } private: std::unique_ptr<const Fst<Arc>> fst_; }; } // namespace internal // Complements an automaton. This is a library-internal operation that // introduces a (negative) ρ-label; use Difference/DifferenceFst in user code, // which will not see this label. This version is a delayed FST. // // This class attaches interface to implementation and handles // reference counting, delegating most methods to ImplToFst. template <class A> class ComplementFst : public ImplToFst<internal::ComplementFstImpl<A>> { public: using Arc = A; using Label = typename Arc::Label; using StateId = typename Arc::StateId; using Impl = internal::ComplementFstImpl<Arc>; friend class StateIterator<ComplementFst<Arc>>; friend class ArcIterator<ComplementFst<Arc>>; explicit ComplementFst(const Fst<Arc> &fst) : ImplToFst<Impl>(std::make_shared<Impl>(fst)) { static constexpr auto props = kUnweighted | kNoEpsilons | kIDeterministic | kAcceptor; if (fst.Properties(props, true) != props) { FSTERROR() << "ComplementFst: Argument not an unweighted " << "epsilon-free deterministic acceptor"; GetImpl()->SetProperties(kError, kError); } } // See Fst<>::Copy() for doc. ComplementFst(const ComplementFst<Arc> &fst, bool safe = false) : ImplToFst<Impl>(fst, safe) {} // Gets a copy of this FST. See Fst<>::Copy() for further doc. ComplementFst<Arc> *Copy(bool safe = false) const override { return new ComplementFst<Arc>(*this, safe); } inline void InitStateIterator(StateIteratorData<Arc> *data) const override; inline void InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const override; // Label that represents the ρ-transition; we use a negative value private to // the library and which will preserve FST label sort order. static const Label kRhoLabel = -2; private: using ImplToFst<Impl>::GetImpl; ComplementFst &operator=(const ComplementFst &) = delete; }; template <class Arc> const typename Arc::Label ComplementFst<Arc>::kRhoLabel; // Specialization for ComplementFst. template <class Arc> class StateIterator<ComplementFst<Arc>> : public StateIteratorBase<Arc> { public: using StateId = typename Arc::StateId; explicit StateIterator(const ComplementFst<Arc> &fst) : siter_(*fst.GetImpl()->fst_), s_(0) {} bool Done() const final { return s_ > 0 && siter_.Done(); } StateId Value() const final { return s_; } void Next() final { if (s_ != 0) siter_.Next(); ++s_; } void Reset() final { siter_.Reset(); s_ = 0; } private: StateIterator<Fst<Arc>> siter_; StateId s_; }; // Specialization for ComplementFst. template <class Arc> class ArcIterator<ComplementFst<Arc>> : public ArcIteratorBase<Arc> { public: using StateId = typename Arc::StateId; using Weight = typename Arc::Weight; ArcIterator(const ComplementFst<Arc> &fst, StateId s) : s_(s), pos_(0) { if (s_ != 0) { aiter_.reset(new ArcIterator<Fst<Arc>>(*fst.GetImpl()->fst_, s - 1)); } } bool Done() const final { if (s_ != 0) { return pos_ > 0 && aiter_->Done(); } else { return pos_ > 0; } } // Adds the ρ-label to the ρ destination state. const Arc &Value() const final { if (pos_ == 0) { arc_.ilabel = arc_.olabel = ComplementFst<Arc>::kRhoLabel; arc_.weight = Weight::One(); arc_.nextstate = 0; } else { arc_ = aiter_->Value(); ++arc_.nextstate; } return arc_; } void Next() final { if (s_ != 0 && pos_ > 0) aiter_->Next(); ++pos_; } size_t Position() const final { return pos_; } void Reset() final { if (s_ != 0) aiter_->Reset(); pos_ = 0; } void Seek(size_t a) final { if (s_ != 0) { if (a == 0) { aiter_->Reset(); } else { aiter_->Seek(a - 1); } } pos_ = a; } uint32 Flags() const final { return kArcValueFlags; } void SetFlags(uint32, uint32) final {} private: std::unique_ptr<ArcIterator<Fst<Arc>>> aiter_; StateId s_; size_t pos_; mutable Arc arc_; }; template <class Arc> inline void ComplementFst<Arc>::InitStateIterator( StateIteratorData<Arc> *data) const { data->base = new StateIterator<ComplementFst<Arc>>(*this); } template <class Arc> inline void ComplementFst<Arc>::InitArcIterator(StateId s, ArcIteratorData<Arc> *data) const { data->base = new ArcIterator<ComplementFst<Arc>>(*this, s); } // Useful alias when using StdArc. using StdComplementFst = ComplementFst<StdArc>; } // namespace fst #endif // FST_COMPLEMENT_H_ |