Blame view
tools/openfst-1.6.7/src/bin/fstshortestdistance-main.cc
1.85 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 |
// See www.openfst.org for extensive documentation on this weighted
// finite-state transducer library.
//
// Find shortest distances in an FST.
#include <cstring>
#include <memory>
#include <string>
#include <vector>
#include <fst/flags.h>
#include <fst/log.h>
#include <fst/script/getters.h>
#include <fst/script/shortest-distance.h>
#include <fst/script/text-io.h>
DECLARE_bool(reverse);
DECLARE_double(delta);
DECLARE_int64(nstate);
DECLARE_string(queue_type);
int fstshortestdistance_main(int argc, char **argv) {
namespace s = fst::script;
using fst::script::FstClass;
using fst::script::WeightClass;
using fst::QueueType;
using fst::AUTO_QUEUE;
string usage = "Finds shortest distance(s) in an FST.
Usage: ";
usage += argv[0];
usage += " [in.fst [distance.txt]]
";
std::set_new_handler(FailedNewHandler);
SET_FLAGS(usage.c_str(), &argc, &argv, true);
if (argc > 3) {
ShowUsage();
return 1;
}
string in_name = (argc > 1 && (strcmp(argv[1], "-") != 0)) ? argv[1] : "";
string out_name = argc > 2 ? argv[2] : "";
std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));
if (!ifst) return 1;
std::vector<WeightClass> distance;
QueueType queue_type;
if (!s::GetQueueType(FLAGS_queue_type, &queue_type)) {
LOG(ERROR) << argv[0]
<< ": Unknown or unsupported queue type: " << FLAGS_queue_type;
return 1;
}
if (FLAGS_reverse && queue_type != AUTO_QUEUE) {
LOG(ERROR) << argv[0] << ": Can't use non-default queue with reverse";
return 1;
}
if (FLAGS_reverse) {
s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);
} else {
const s::ShortestDistanceOptions opts(queue_type, s::ANY_ARC_FILTER,
FLAGS_nstate, FLAGS_delta);
s::ShortestDistance(*ifst, &distance, opts);
}
return !s::WritePotentials(out_name, distance);
}
|