FST  openfst-1.8.4
OpenFst Library
pdtshortestpath-main.cc
Go to the documentation of this file.
1 // Copyright 2005-2024 Google LLC
2 //
3 // Licensed under the Apache License, Version 2.0 (the 'License');
4 // you may not use this file except in compliance with the License.
5 // You may obtain a copy of the License at
6 //
7 // http://www.apache.org/licenses/LICENSE-2.0
8 //
9 // Unless required by applicable law or agreed to in writing, software
10 // distributed under the License is distributed on an 'AS IS' BASIS,
11 // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 // See the License for the specific language governing permissions and
13 // limitations under the License.
14 //
15 // See www.openfst.org for extensive documentation on this weighted
16 // finite-state transducer library.
17 //
18 // Returns the shortest path in a (bounded-stack) PDT.
19 
20 #include <cstdint>
21 #include <cstring>
22 #include <memory>
23 #include <string>
24 #include <utility>
25 #include <vector>
26 
27 #include <fst/flags.h>
28 #include <fst/log.h>
30 #include <fst/queue.h>
31 #include <fst/util.h>
32 #include <fst/script/fst-class.h>
33 
34 DECLARE_bool(keep_parentheses);
35 DECLARE_string(queue_type);
36 DECLARE_bool(path_gc);
37 DECLARE_string(pdt_parentheses);
38 
39 int pdtshortestpath_main(int argc, char **argv) {
40  namespace s = fst::script;
41  using fst::QueueType;
42  using fst::ReadLabelPairs;
45 
46  std::string usage = "Shortest path in a (bounded-stack) PDT.\n\n Usage: ";
47  usage += argv[0];
48  usage += " in.pdt [out.fst]\n";
49 
50  SET_FLAGS(usage.c_str(), &argc, &argv, true);
51  if (argc > 3) {
52  ShowUsage();
53  return 1;
54  }
55 
56  const std::string in_name =
57  (argc > 1 && (strcmp(argv[1], "-") != 0)) ? argv[1] : "";
58  const std::string out_name =
59  (argc > 2 && (strcmp(argv[2], "-") != 0)) ? argv[2] : "";
60 
61  std::unique_ptr<FstClass> ifst(FstClass::Read(in_name));
62  if (!ifst) return 1;
63 
64  if (FST_FLAGS_pdt_parentheses.empty()) {
65  LOG(ERROR) << argv[0] << ": No PDT parenthesis label pairs provided";
66  return 1;
67  }
68 
69  std::vector<std::pair<int64_t, int64_t>> parens;
70  if (!ReadLabelPairs(FST_FLAGS_pdt_parentheses, &parens)) return 1;
71 
72  VectorFstClass ofst(ifst->ArcType());
73 
74  QueueType qt;
75  if (FST_FLAGS_queue_type == "fifo") {
76  qt = fst::FIFO_QUEUE;
77  } else if (FST_FLAGS_queue_type == "lifo") {
78  qt = fst::LIFO_QUEUE;
79  } else if (FST_FLAGS_queue_type == "state") {
81  } else {
82  LOG(ERROR) << "Unknown queue type: " << FST_FLAGS_queue_type;
83  return 1;
84  }
85 
86  const s::PdtShortestPathOptions opts(
87  qt, FST_FLAGS_keep_parentheses, FST_FLAGS_path_gc);
88 
89  s::ShortestPath(*ifst, parens, &ofst, opts);
90 
91  return !ofst.Write(out_name);
92 }
void ShowUsage(bool long_usage=true)
Definition: flags.cc:138
QueueType
Definition: queue.h:76
#define LOG(type)
Definition: log.h:53
void ShortestPath(const FstClass &ifst, const std::vector< std::pair< int64_t, int64_t >> &parens, MutableFstClass *ofst, const PdtShortestPathOptions &opts)
Definition: pdtscript.cc:106
#define SET_FLAGS(usage, argc, argv, rmflags)
Definition: flags.h:226
int pdtshortestpath_main(int argc, char **argv)
DECLARE_string(queue_type)
DECLARE_bool(keep_parentheses)
bool ReadLabelPairs(std::string_view source, std::vector< std::pair< Label, Label >> *pairs)
Definition: util.h:423