You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 

138 lines
4.2 KiB

// Copyright 2005-2024 Google LLC
//
// 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.
//
// See www.openfst.org for extensive documentation on this weighted
// finite-state transducer library.
#ifndef FST_SCRIPT_RMEPSILON_H_
#define FST_SCRIPT_RMEPSILON_H_
#include <cstdint>
#include <utility>
#include <vector>
#include <fst/log.h>
#include <fst/arcfilter.h>
#include <fst/fst.h>
#include <fst/mutable-fst.h>
#include <fst/properties.h>
#include <fst/queue.h>
#include <fst/rmepsilon.h>
#include <fst/util.h>
#include <fst/weight.h>
#include <fst/script/arcfilter-impl.h>
#include <fst/script/fst-class.h>
#include <fst/script/shortest-distance.h>
#include <fst/script/weight-class.h>
namespace fst {
namespace script {
struct RmEpsilonOptions : public ShortestDistanceOptions {
const bool connect;
const WeightClass &weight_threshold;
const int64_t state_threshold;
RmEpsilonOptions(QueueType queue_type, bool connect,
const WeightClass &weight_threshold,
int64_t state_threshold = kNoStateId, float delta = kDelta)
: ShortestDistanceOptions(queue_type, ArcFilterType::EPSILON, kNoStateId,
delta),
connect(connect),
weight_threshold(weight_threshold),
state_threshold(state_threshold) {}
};
namespace internal {
// Code to implement switching on queue types.
template <class Arc, class Queue>
void RmEpsilon(MutableFst<Arc> *fst,
std::vector<typename Arc::Weight> *distance,
const RmEpsilonOptions &opts, Queue *queue) {
using Weight = typename Arc::Weight;
const fst::RmEpsilonOptions<Arc, Queue> ropts(
queue, opts.delta, opts.connect,
*opts.weight_threshold.GetWeight<Weight>(), opts.state_threshold);
RmEpsilon(fst, distance, ropts);
}
template <class Arc>
void RmEpsilon(MutableFst<Arc> *fst, const RmEpsilonOptions &opts) {
using StateId = typename Arc::StateId;
using Weight = typename Arc::Weight;
std::vector<Weight> distance;
switch (opts.queue_type) {
case AUTO_QUEUE: {
AutoQueue<StateId> queue(*fst, &distance, EpsilonArcFilter<Arc>());
RmEpsilon(fst, &distance, opts, &queue);
return;
}
case FIFO_QUEUE: {
FifoQueue<StateId> queue;
RmEpsilon(fst, &distance, opts, &queue);
return;
}
case LIFO_QUEUE: {
LifoQueue<StateId> queue;
RmEpsilon(fst, &distance, opts, &queue);
return;
}
case SHORTEST_FIRST_QUEUE: {
if constexpr (IsIdempotent<Weight>::value) {
NaturalShortestFirstQueue<StateId, Weight> queue(distance);
RmEpsilon(fst, &distance, opts, &queue);
} else {
FSTERROR() << "RmEpsilon: Bad queue type SHORTEST_FIRST_QUEUE for"
<< " non-idempotent Weight " << Weight::Type();
fst->SetProperties(kError, kError);
}
return;
}
case STATE_ORDER_QUEUE: {
StateOrderQueue<StateId> queue;
RmEpsilon(fst, &distance, opts, &queue);
return;
}
case TOP_ORDER_QUEUE: {
TopOrderQueue<StateId> queue(*fst, EpsilonArcFilter<Arc>());
internal::RmEpsilon(fst, &distance, opts, &queue);
return;
}
default: {
FSTERROR() << "RmEpsilon: Unknown queue type: " << opts.queue_type;
fst->SetProperties(kError, kError);
return;
}
}
}
} // namespace internal
using FstRmEpsilonArgs = std::pair<MutableFstClass *, const RmEpsilonOptions &>;
template <class Arc>
void RmEpsilon(FstRmEpsilonArgs *args) {
MutableFst<Arc> *fst = std::get<0>(*args)->GetMutableFst<Arc>();
const auto &opts = std::get<1>(*args);
internal::RmEpsilon(fst, opts);
}
void RmEpsilon(MutableFstClass *fst, const RmEpsilonOptions &opts);
} // namespace script
} // namespace fst
#endif // FST_SCRIPT_RMEPSILON_H_