/usr/include/fst/lookahead-matcher.h is in libfst-dev 1.5.3+r3-2.
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 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 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 | // See www.openfst.org for extensive documentation on this weighted
// finite-state transducer library.
//
// Classes to add lookahead to FST matchers, useful e.g. for improving
// composition efficiency with certain inputs.
#ifndef FST_LIB_LOOKAHEAD_MATCHER_H_
#define FST_LIB_LOOKAHEAD_MATCHER_H_
#include <fst/add-on.h>
#include <fst/const-fst.h>
#include <fst/fst.h>
#include <fst/label-reachable.h>
#include <fst/matcher.h>
DECLARE_string(save_relabel_ipairs);
DECLARE_string(save_relabel_opairs);
namespace fst {
// LOOKAHEAD MATCHERS - these have the interface of Matchers (see
// matcher.h) and these additional methods:
//
// template <class F>
// class LookAheadMatcher {
// public:
// typedef F FST;
// typedef F::Arc Arc;
// typedef typename Arc::StateId StateId;
// typedef typename Arc::Label Label;
// typedef typename Arc::Weight Weight;
//
// // Required constructors.
// LookAheadMatcher(const F &fst, MatchType match_type);
// // If safe=true, the copy is thread-safe (except the lookahead Fst is
// // preserved). See Fst<>::Cop() for further doc.
// LookAheadMatcher(const LookAheadMatcher &matcher, bool safe = false);
//
// Below are methods for looking ahead for a match to a label and
// more generally, to a rational set. Each returns false if there is
// definitely not a match and returns true if there possibly is a
// match.
// // LABEL LOOKAHEAD: Can 'label' be read from the current matcher state
// // after possibly following epsilon transitions?
// bool LookAheadLabel(Label label) const;
//
// // RATIONAL LOOKAHEAD: The next methods allow looking ahead for an
// // arbitrary rational set of strings, specified by an FST and a state
// // from which to begin the matching. If the lookahead FST is a
// // transducer, this looks on the side different from the matcher
// // 'match_type' (cf. composition).
//
// // Are there paths P from 's' in the lookahead FST that can be read from
// // the cur. matcher state?
// bool LookAheadFst(const Fst<Arc>& fst, StateId s);
//
// // Gives an estimate of the combined weight of the paths P in the
// // lookahead and matcher FSTs for the last call to LookAheadFst.
// // A trivial implementation returns Weight::One(). Non-trivial
// // implementations are useful for weight-pushing in composition.
// Weight LookAheadWeight() const;
//
// // Is there is a single non-epsilon arc found in the lookahead FST
// // that begins P (after possibly following any epsilons) in the last
// // call LookAheadFst? If so, return true and copy it to '*arc', o.w.
// // return false. A trivial implementation returns false. Non-trivial
// // implementations are useful for label-pushing in composition.
// bool LookAheadPrefix(Arc *arc);
//
// // Optionally pre-specifies the lookahead FST that will be passed
// // to LookAheadFst() for possible precomputation. If copy is true,
// // then 'fst' is a copy of the FST used in the previous call to
// // this method (useful to avoid unnecessary updates).
// void InitLookAheadFst(const Fst<Arc>& fst, bool copy = false);
//
// };
//
// LOOK-AHEAD FLAGS (see also kMatcherFlags in matcher.h):
//
// Matcher is a lookahead matcher when 'match_type' is MATCH_INPUT.
const uint32 kInputLookAheadMatcher = 0x00000010;
// Matcher is a lookahead matcher when 'match_type' is MATCH_OUTPUT.
const uint32 kOutputLookAheadMatcher = 0x00000020;
// A non-trivial implementation of LookAheadWeight() method defined and
// should be used?
const uint32 kLookAheadWeight = 0x00000040;
// A non-trivial implementation of LookAheadPrefix() method defined and
// should be used?
const uint32 kLookAheadPrefix = 0x00000080;
// Look-ahead of matcher FST non-epsilon arcs?
const uint32 kLookAheadNonEpsilons = 0x00000100;
// Look-ahead of matcher FST epsilon arcs?
const uint32 kLookAheadEpsilons = 0x00000200;
// Ignore epsilon paths for the lookahead prefix? Note this gives
// correct results in composition only with an appropriate composition
// filter since it depends on the filter blocking the ignored paths.
const uint32 kLookAheadNonEpsilonPrefix = 0x00000400;
// For LabelLookAheadMatcher, save relabeling data to file
const uint32 kLookAheadKeepRelabelData = 0x00000800;
// Flags used for lookahead matchers.
const uint32 kLookAheadFlags = 0x00000ff0;
// LookAhead Matcher interface, templated on the Arc definition; used
// for lookahead matcher specializations that are returned by the
// InitMatcher() Fst method.
template <class A>
class LookAheadMatcherBase : public MatcherBase<A> {
public:
typedef A Arc;
typedef typename A::StateId StateId;
typedef typename A::Label Label;
typedef typename A::Weight Weight;
LookAheadMatcherBase()
: weight_(Weight::One()),
prefix_arc_(kNoLabel, kNoLabel, Weight::One(), kNoStateId) {}
~LookAheadMatcherBase() override {}
bool LookAheadLabel(Label label) const { return LookAheadLabel_(label); }
bool LookAheadFst(const Fst<Arc> &fst, StateId s) {
return LookAheadFst_(fst, s);
}
Weight LookAheadWeight() const { return weight_; }
bool LookAheadPrefix(Arc *arc) const {
if (prefix_arc_.nextstate != kNoStateId) {
*arc = prefix_arc_;
return true;
} else {
return false;
}
}
virtual void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) = 0;
protected:
void SetLookAheadWeight(const Weight &w) { weight_ = w; }
void SetLookAheadPrefix(const Arc &arc) { prefix_arc_ = arc; }
void ClearLookAheadPrefix() { prefix_arc_.nextstate = kNoStateId; }
private:
virtual bool LookAheadLabel_(Label label) const = 0;
virtual bool LookAheadFst_(const Fst<Arc> &fst,
StateId s) = 0; // This must set l.a. weight and
// prefix if non-trivial.
Weight weight_; // Look-ahead weight
Arc prefix_arc_; // Look-ahead prefix arc
};
// Don't really lookahead, just declare future looks good regardless.
template <class M>
class TrivialLookAheadMatcher
: public LookAheadMatcherBase<typename M::FST::Arc> {
public:
typedef typename M::FST FST;
typedef typename M::Arc Arc;
typedef typename Arc::StateId StateId;
typedef typename Arc::Label Label;
typedef typename Arc::Weight Weight;
TrivialLookAheadMatcher(const FST &fst, MatchType match_type)
: matcher_(fst, match_type) {}
TrivialLookAheadMatcher(const TrivialLookAheadMatcher<M> &lmatcher,
bool safe = false)
: matcher_(lmatcher.matcher_, safe) {}
// General matcher methods
TrivialLookAheadMatcher<M> *Copy(bool safe = false) const override {
return new TrivialLookAheadMatcher<M>(*this, safe);
}
MatchType Type(bool test) const override { return matcher_.Type(test); }
void SetState(StateId s) { return matcher_.SetState(s); }
bool Find(Label label) { return matcher_.Find(label); }
bool Done() const { return matcher_.Done(); }
const Arc &Value() const { return matcher_.Value(); }
void Next() { matcher_.Next(); }
Weight Final(StateId s) const { return matcher_.Final(s); }
ssize_t Priority(StateId s) { return matcher_.Priority(s); }
const FST &GetFst() const override { return matcher_.GetFst(); }
uint64 Properties(uint64 props) const override {
return matcher_.Properties(props);
}
uint32 Flags() const override {
return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher;
}
// Look-ahead methods.
bool LookAheadLabel(Label label) const { return true; }
bool LookAheadFst(const Fst<Arc> &fst, StateId s) { return true; }
Weight LookAheadWeight() const { return Weight::One(); }
bool LookAheadPrefix(Arc *arc) const { return false; }
void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {}
private:
// This allows base class virtual access to non-virtual derived-
// class members of the same name. It makes the derived class more
// efficient to use but unsafe to further derive.
void SetState_(StateId s) override { SetState(s); }
bool Find_(Label label) override { return Find(label); }
bool Done_() const override { return Done(); }
const Arc &Value_() const override { return Value(); }
void Next_() override { Next(); }
Weight Final_(StateId s) const override { return Final(s); }
ssize_t Priority_(StateId s) override { return Priority(s); }
bool LookAheadLabel_(Label l) const override { return LookAheadLabel(l); }
bool LookAheadFst_(const Fst<Arc> &fst, StateId s) override {
return LookAheadFst(fst, s);
}
Weight LookAheadWeight_() const { return LookAheadWeight(); }
bool LookAheadPrefix_(Arc *arc) const { return LookAheadPrefix(arc); }
M matcher_;
};
// Look-ahead of one transition. Template argument F accepts flags to
// control behavior.
template <class M, uint32 F = kLookAheadNonEpsilons | kLookAheadEpsilons |
kLookAheadWeight | kLookAheadPrefix>
class ArcLookAheadMatcher : public LookAheadMatcherBase<typename M::FST::Arc> {
public:
typedef typename M::FST FST;
typedef typename M::Arc Arc;
typedef typename Arc::StateId StateId;
typedef typename Arc::Label Label;
typedef typename Arc::Weight Weight;
typedef NullAddOn MatcherData;
using LookAheadMatcherBase<Arc>::LookAheadWeight;
using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;
using LookAheadMatcherBase<Arc>::SetLookAheadWeight;
using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;
ArcLookAheadMatcher(
const FST &fst, MatchType match_type,
std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>())
: matcher_(fst, match_type),
fst_(matcher_.GetFst()),
lfst_(0),
s_(kNoStateId) {}
ArcLookAheadMatcher(const ArcLookAheadMatcher<M, F> &lmatcher,
bool safe = false)
: matcher_(lmatcher.matcher_, safe),
fst_(matcher_.GetFst()),
lfst_(lmatcher.lfst_),
s_(kNoStateId) {}
// General matcher methods
ArcLookAheadMatcher<M, F> *Copy(bool safe = false) const override {
return new ArcLookAheadMatcher<M, F>(*this, safe);
}
MatchType Type(bool test) const override { return matcher_.Type(test); }
void SetState(StateId s) {
s_ = s;
matcher_.SetState(s);
}
bool Find(Label label) { return matcher_.Find(label); }
bool Done() const { return matcher_.Done(); }
const Arc &Value() const { return matcher_.Value(); }
void Next() { matcher_.Next(); }
Weight Final(StateId s) const { return matcher_.Final(s); }
ssize_t Priority(StateId s) { return matcher_.Priority(s); }
const FST &GetFst() const override { return fst_; }
uint64 Properties(uint64 props) const override {
return matcher_.Properties(props);
}
uint32 Flags() const override {
return matcher_.Flags() | kInputLookAheadMatcher | kOutputLookAheadMatcher |
F;
}
const MatcherData *GetData() const { return nullptr; }
std::shared_ptr<MatcherData> GetSharedData() const {
return std::shared_ptr<MatcherData>();
}
// Look-ahead methods.
bool LookAheadLabel(Label label) const { return matcher_.Find(label); }
// Checks if there is a matching (possibly super-final) transition
// at (s_, s).
bool LookAheadFst(const Fst<Arc> &fst, StateId s);
void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {
lfst_ = &fst;
}
private:
// This allows base class virtual access to non-virtual derived-
// class members of the same name. It makes the derived class more
// efficient to use but unsafe to further derive.
void SetState_(StateId s) override { SetState(s); }
bool Find_(Label label) override { return Find(label); }
bool Done_() const override { return Done(); }
const Arc &Value_() const override { return Value(); }
void Next_() override { Next(); }
Weight Final_(StateId s) const override { return Final(s); }
ssize_t Priority_(StateId s) override { return Priority(s); }
bool LookAheadLabel_(Label l) const override { return LookAheadLabel(l); }
bool LookAheadFst_(const Fst<Arc> &fst, StateId s) override {
return LookAheadFst(fst, s);
}
mutable M matcher_;
const FST &fst_; // Matcher FST
const Fst<Arc> *lfst_; // Look-ahead FST
StateId s_; // Matcher state
};
template <class M, uint32 F>
bool ArcLookAheadMatcher<M, F>::LookAheadFst(const Fst<Arc> &fst, StateId s) {
if (&fst != lfst_) InitLookAheadFst(fst);
bool ret = false;
ssize_t nprefix = 0;
if (F & kLookAheadWeight) SetLookAheadWeight(Weight::Zero());
if (F & kLookAheadPrefix) ClearLookAheadPrefix();
if (fst_.Final(s_) != Weight::Zero() && lfst_->Final(s) != Weight::Zero()) {
if (!(F & (kLookAheadWeight | kLookAheadPrefix))) return true;
++nprefix;
if (F & kLookAheadWeight)
SetLookAheadWeight(
Plus(LookAheadWeight(), Times(fst_.Final(s_), lfst_->Final(s))));
ret = true;
}
if (matcher_.Find(kNoLabel)) {
if (!(F & (kLookAheadWeight | kLookAheadPrefix))) return true;
++nprefix;
if (F & kLookAheadWeight)
for (; !matcher_.Done(); matcher_.Next())
SetLookAheadWeight(Plus(LookAheadWeight(), matcher_.Value().weight));
ret = true;
}
for (ArcIterator<Fst<Arc>> aiter(*lfst_, s); !aiter.Done(); aiter.Next()) {
const Arc &arc = aiter.Value();
Label label = kNoLabel;
switch (matcher_.Type(false)) {
case MATCH_INPUT:
label = arc.olabel;
break;
case MATCH_OUTPUT:
label = arc.ilabel;
break;
default:
FSTERROR() << "ArcLookAheadMatcher::LookAheadFst: Bad match type";
return true;
}
if (label == 0) {
if (!(F & (kLookAheadWeight | kLookAheadPrefix))) return true;
if (!(F & kLookAheadNonEpsilonPrefix)) ++nprefix;
if (F & kLookAheadWeight)
SetLookAheadWeight(Plus(LookAheadWeight(), arc.weight));
ret = true;
} else if (matcher_.Find(label)) {
if (!(F & (kLookAheadWeight | kLookAheadPrefix))) return true;
for (; !matcher_.Done(); matcher_.Next()) {
++nprefix;
if (F & kLookAheadWeight)
SetLookAheadWeight(Plus(LookAheadWeight(),
Times(arc.weight, matcher_.Value().weight)));
if ((F & kLookAheadPrefix) && nprefix == 1) SetLookAheadPrefix(arc);
}
ret = true;
}
}
if (F & kLookAheadPrefix) {
if (nprefix == 1)
SetLookAheadWeight(Weight::One()); // Avoids double counting.
else
ClearLookAheadPrefix();
}
return ret;
}
// Template argument F accepts flags to control behavior.
// It must include precisely one of KInputLookAheadMatcher or
// KOutputLookAheadMatcher.
template <class M,
uint32 F = kLookAheadEpsilons | kLookAheadWeight | kLookAheadPrefix |
kLookAheadNonEpsilonPrefix | kLookAheadKeepRelabelData,
class S = DefaultAccumulator<typename M::Arc>,
class R = LabelReachable<typename M::Arc, S>>
class LabelLookAheadMatcher
: public LookAheadMatcherBase<typename M::FST::Arc> {
public:
typedef typename M::FST FST;
typedef typename M::Arc Arc;
typedef typename Arc::StateId StateId;
typedef typename Arc::Label Label;
typedef typename Arc::Weight Weight;
typedef typename R::Data MatcherData;
using LookAheadMatcherBase<Arc>::LookAheadWeight;
using LookAheadMatcherBase<Arc>::SetLookAheadPrefix;
using LookAheadMatcherBase<Arc>::SetLookAheadWeight;
using LookAheadMatcherBase<Arc>::ClearLookAheadPrefix;
LabelLookAheadMatcher(
const FST &fst, MatchType match_type,
std::shared_ptr<MatcherData> data = std::shared_ptr<MatcherData>(),
S *s = 0)
: matcher_(fst, match_type),
lfst_(0),
label_reachable_(0),
s_(kNoStateId),
error_(false) {
if (!(F & (kInputLookAheadMatcher | kOutputLookAheadMatcher))) {
FSTERROR() << "LabelLookaheadMatcher: Bad matcher flags: " << F;
error_ = true;
}
bool reach_input = match_type == MATCH_INPUT;
if (data) {
if (reach_input == data->ReachInput()) label_reachable_ = new R(data, s);
} else if ((reach_input && (F & kInputLookAheadMatcher)) ||
(!reach_input && (F & kOutputLookAheadMatcher))) {
label_reachable_ =
new R(fst, reach_input, s, F & kLookAheadKeepRelabelData);
}
}
LabelLookAheadMatcher(const LabelLookAheadMatcher<M, F, S, R> &lmatcher,
bool safe = false)
: matcher_(lmatcher.matcher_, safe),
lfst_(lmatcher.lfst_),
label_reachable_(lmatcher.label_reachable_
? new R(*lmatcher.label_reachable_, safe)
: 0),
s_(kNoStateId),
error_(lmatcher.error_) {}
~LabelLookAheadMatcher() override { delete label_reachable_; }
// General matcher methods
LabelLookAheadMatcher<M, F, S, R> *Copy(bool safe = false) const override {
return new LabelLookAheadMatcher<M, F, S, R>(*this, safe);
}
MatchType Type(bool test) const override { return matcher_.Type(test); }
void SetState(StateId s) {
if (s_ == s) return;
s_ = s;
match_set_state_ = false;
reach_set_state_ = false;
}
bool Find(Label label) {
if (!match_set_state_) {
matcher_.SetState(s_);
match_set_state_ = true;
}
return matcher_.Find(label);
}
bool Done() const { return matcher_.Done(); }
const Arc &Value() const { return matcher_.Value(); }
void Next() { matcher_.Next(); }
ssize_t Priority(StateId s) { return matcher_.Priority(s); }
Weight Final(StateId s) const { return matcher_.Final(s); }
const FST &GetFst() const override { return matcher_.GetFst(); }
uint64 Properties(uint64 inprops) const override {
uint64 outprops = matcher_.Properties(inprops);
if (error_ || (label_reachable_ && label_reachable_->Error()))
outprops |= kError;
return outprops;
}
uint32 Flags() const override {
if (label_reachable_ && label_reachable_->GetData()->ReachInput())
return matcher_.Flags() | F | kInputLookAheadMatcher;
else if (label_reachable_ && !label_reachable_->GetData()->ReachInput())
return matcher_.Flags() | F | kOutputLookAheadMatcher;
else
return matcher_.Flags();
}
const MatcherData *GetData() const {
return label_reachable_ ? label_reachable_->GetData() : 0;
};
std::shared_ptr<MatcherData> GetSharedData() const {
return label_reachable_ ? label_reachable_->GetSharedData()
: std::shared_ptr<MatcherData>();
}
// Look-ahead methods.
bool LookAheadLabel(Label label) const {
if (label == 0) return true;
if (label_reachable_) {
if (!reach_set_state_) {
label_reachable_->SetState(s_);
reach_set_state_ = true;
}
return label_reachable_->Reach(label);
} else {
return true;
}
}
// Checks if there is a matching (possibly super-final) transition
// at (s_, s).
template <class L>
bool LookAheadFst(const L &fst, StateId s);
void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) override {
lfst_ = &fst;
if (label_reachable_) {
bool reach_input = Type(false) == MATCH_OUTPUT;
label_reachable_->ReachInit(fst, reach_input, copy);
}
}
template <class L>
void InitLookAheadFst(const L &fst, bool copy = false) {
lfst_ = static_cast<const Fst<Arc> *>(&fst);
if (label_reachable_) {
bool reach_input = Type(false) == MATCH_OUTPUT;
label_reachable_->ReachInit(fst, reach_input, copy);
}
}
private:
// This allows base class virtual access to non-virtual derived-
// class members of the same name. It makes the derived class more
// efficient to use but unsafe to further derive.
void SetState_(StateId s) override { SetState(s); }
bool Find_(Label label) override { return Find(label); }
bool Done_() const override { return Done(); }
const Arc &Value_() const override { return Value(); }
void Next_() override { Next(); }
Weight Final_(StateId s) const override { return Final(s); }
ssize_t Priority_(StateId s) override { return Priority(s); }
bool LookAheadLabel_(Label l) const override { return LookAheadLabel(l); }
bool LookAheadFst_(const Fst<Arc> &fst, StateId s) override {
return LookAheadFst(fst, s);
}
mutable M matcher_;
const Fst<Arc> *lfst_; // Look-ahead FST
R *label_reachable_; // Label reachability info
StateId s_; // Matcher state
bool match_set_state_; // matcher_.SetState called?
mutable bool reach_set_state_; // reachable_.SetState called?
bool error_;
};
template <class M, uint32 F, class S, class R>
template <class L>
inline bool LabelLookAheadMatcher<M, F, S, R>::LookAheadFst(const L &fst,
StateId s) {
if (static_cast<const Fst<Arc> *>(&fst) != lfst_) InitLookAheadFst(fst);
SetLookAheadWeight(Weight::One());
ClearLookAheadPrefix();
if (!label_reachable_) return true;
label_reachable_->SetState(s_, s);
reach_set_state_ = true;
bool compute_weight = F & kLookAheadWeight;
bool compute_prefix = F & kLookAheadPrefix;
ArcIterator<L> aiter(fst, s);
aiter.SetFlags(kArcNoCache, kArcNoCache); // make caching optional;
bool reach_arc = label_reachable_->Reach(
&aiter, 0, internal::NumArcs(*lfst_, s), compute_weight);
Weight lfinal = internal::Final(*lfst_, s);
bool reach_final = lfinal != Weight::Zero() && label_reachable_->ReachFinal();
if (reach_arc) {
ssize_t begin = label_reachable_->ReachBegin();
ssize_t end = label_reachable_->ReachEnd();
if (compute_prefix && end - begin == 1 && !reach_final) {
aiter.Seek(begin);
SetLookAheadPrefix(aiter.Value());
compute_weight = false;
} else if (compute_weight) {
SetLookAheadWeight(label_reachable_->ReachWeight());
}
}
if (reach_final && compute_weight)
SetLookAheadWeight(reach_arc ? Plus(LookAheadWeight(), lfinal) : lfinal);
return reach_arc || reach_final;
}
// Label-lookahead relabeling class.
template <class A, class R = LabelReachableData<typename A::Label>>
class LabelLookAheadRelabeler {
public:
typedef typename A::Label Label;
typedef R MatcherData;
typedef AddOnPair<MatcherData, MatcherData> D;
typedef LabelReachable<A, DefaultAccumulator<A>, R> Reachable;
// Relabels matcher Fst - initialization function object.
template <typename I>
explicit LabelLookAheadRelabeler(std::shared_ptr<I> *impl);
// Relabels arbitrary Fst. Class L should be a label-lookahead Fst.
template <class L>
static void Relabel(MutableFst<A> *fst, const L &mfst, bool relabel_input) {
const D *data = mfst.GetAddOn();
Reachable reachable(data->First() ? data->SharedFirst()
: data->SharedSecond());
reachable.Relabel(fst, relabel_input);
}
// Returns relabeling pairs (cf. relabel.h::Relabel()).
// Class L should be a label-lookahead Fst.
// If 'avoid_collisions' is true, extra pairs are added to
// ensure no collisions when relabeling automata that have
// labels unseen here.
template <class L>
static void RelabelPairs(const L &mfst,
std::vector<std::pair<Label, Label>> *pairs,
bool avoid_collisions = false) {
const D *data = mfst.GetAddOn();
Reachable reachable(data->First() ? data->SharedFirst()
: data->SharedSecond());
reachable.RelabelPairs(pairs, avoid_collisions);
}
};
template <class A, class R>
template <typename I>
inline LabelLookAheadRelabeler<A, R>::LabelLookAheadRelabeler(
std::shared_ptr<I> *impl) {
Fst<A> &fst = (*impl)->GetFst();
std::shared_ptr<D> data = (*impl)->GetSharedAddOn();
const string name = (*impl)->Type();
bool is_mutable = fst.Properties(kMutable, false);
std::unique_ptr<MutableFst<A>> mfst;
if (is_mutable) {
mfst.reset(static_cast<MutableFst<A> *>(&fst));
} else {
mfst.reset(new VectorFst<A>(fst));
}
if (data->First()) { // reach_input
Reachable reachable(data->SharedFirst());
reachable.Relabel(mfst.get(), true);
if (!FLAGS_save_relabel_ipairs.empty()) {
std::vector<std::pair<Label, Label>> pairs;
reachable.RelabelPairs(&pairs, true);
WriteLabelPairs(FLAGS_save_relabel_ipairs, pairs);
}
} else {
Reachable reachable(data->SharedSecond());
reachable.Relabel(mfst.get(), false);
if (!FLAGS_save_relabel_opairs.empty()) {
std::vector<std::pair<Label, Label>> pairs;
reachable.RelabelPairs(&pairs, true);
WriteLabelPairs(FLAGS_save_relabel_opairs, pairs);
}
}
if (!is_mutable) {
*impl = std::make_shared<I>(*mfst, name);
(*impl)->SetAddOn(data);
}
}
// Generic lookahead matcher, templated on the FST definition
// - a wrapper around pointer to specific one.
template <class F>
class LookAheadMatcher {
public:
typedef F FST;
typedef typename F::Arc Arc;
typedef typename Arc::StateId StateId;
typedef typename Arc::Label Label;
typedef typename Arc::Weight Weight;
typedef LookAheadMatcherBase<Arc> LBase;
LookAheadMatcher(const F &fst, MatchType match_type) {
base_ = fst.InitMatcher(match_type);
if (!base_) base_ = new SortedMatcher<F>(fst, match_type);
lookahead_ = false;
}
// Takes ownership of base.
explicit LookAheadMatcher(MatcherBase<Arc> *base)
: base_(base), lookahead_(false) {}
LookAheadMatcher(const LookAheadMatcher<F> &matcher, bool safe = false) {
base_ = matcher.base_->Copy(safe);
lookahead_ = matcher.lookahead_;
}
~LookAheadMatcher() { delete base_; }
// General matcher methods
LookAheadMatcher<F> *Copy(bool safe = false) const {
return new LookAheadMatcher<F>(*this, safe);
}
MatchType Type(bool test) const { return base_->Type(test); }
void SetState(StateId s) { base_->SetState(s); }
bool Find(Label label) { return base_->Find(label); }
bool Done() const { return base_->Done(); }
const Arc &Value() const { return base_->Value(); }
void Next() { base_->Next(); }
Weight Final(StateId s) const { return base_->Final(s); }
ssize_t Priority(StateId s) { return base_->Priority(s); }
const F &GetFst() const { return static_cast<const F &>(base_->GetFst()); }
uint64 Properties(uint64 props) const { return base_->Properties(props); }
uint32 Flags() const { return base_->Flags(); }
// Look-ahead methods
bool LookAheadLabel(Label label) const {
if (LookAheadCheck()) {
LBase *lbase = static_cast<LBase *>(base_);
return lbase->LookAheadLabel(label);
} else {
return true;
}
}
bool LookAheadFst(const Fst<Arc> &fst, StateId s) {
if (LookAheadCheck()) {
LBase *lbase = static_cast<LBase *>(base_);
return lbase->LookAheadFst(fst, s);
} else {
return true;
}
}
Weight LookAheadWeight() const {
if (LookAheadCheck()) {
LBase *lbase = static_cast<LBase *>(base_);
return lbase->LookAheadWeight();
} else {
return Weight::One();
}
}
bool LookAheadPrefix(Arc *arc) const {
if (LookAheadCheck()) {
LBase *lbase = static_cast<LBase *>(base_);
return lbase->LookAheadPrefix(arc);
} else {
return false;
}
}
void InitLookAheadFst(const Fst<Arc> &fst, bool copy = false) {
if (LookAheadCheck()) {
LBase *lbase = static_cast<LBase *>(base_);
lbase->InitLookAheadFst(fst, copy);
}
}
private:
bool LookAheadCheck() const {
if (!lookahead_) {
lookahead_ =
base_->Flags() & (kInputLookAheadMatcher | kOutputLookAheadMatcher);
if (!lookahead_) {
FSTERROR() << "LookAheadMatcher: No look-ahead matcher defined";
}
}
return lookahead_;
}
MatcherBase<Arc> *base_;
mutable bool lookahead_;
void operator=(const LookAheadMatcher<Arc> &); // disallow
};
} // namespace fst
#endif // FST_LIB_LOOKAHEAD_MATCHER_H_
|