1 files changed, 0 insertions, 122 deletions
diff --git a/src/trule.h b/src/trule.h
deleted file mode 100644
index d2b1babe..00000000
--- a/src/trule.h
+++ /dev/null
@@ -1,122 +0,0 @@
-#ifndef _RULE_H_
-#define _RULE_H_
-
-#include <algorithm>
-#include <vector>
-#include <cassert>
-#include <boost/shared_ptr.hpp>
-
-#include "sparse_vector.h"
-#include "wordid.h"
-
-class TRule;
-typedef boost::shared_ptr<TRule> TRulePtr;
-struct SpanInfo;
-
-// Translation rule
-class TRule {
- public:
-  TRule() : lhs_(0), prev_i(-1), prev_j(-1) { }
-  explicit TRule(const std::vector<WordID>& e) : e_(e), lhs_(0), prev_i(-1), prev_j(-1) {}
-  TRule(const std::vector<WordID>& e, const std::vector<WordID>& f, const WordID& lhs) :
-    e_(e), f_(f), lhs_(lhs), prev_i(-1), prev_j(-1) {}
-
-  // deprecated - this will be private soon
-  explicit TRule(const std::string& text, bool strict = false, bool mono = false) {
-    ReadFromString(text, strict, mono);
-  }
-
-  // make a rule from a hiero-like rule table, e.g.
-  //    [X] ||| [X,1] DE [X,2] ||| [X,2] of the [X,1]
-  // if misformatted, returns NULL
-  static TRule* CreateRuleSynchronous(const std::string& rule);
-
-  // make a rule from a phrasetable entry (i.e., one that has no LHS type), e.g:
-  //    el gato ||| the cat ||| Feature_2=0.34
-  static TRule* CreateRulePhrasetable(const std::string& rule);
-
-  // make a rule from a non-synchrnous CFG representation, e.g.:
-  //    [LHS] ||| term1 [NT] term2 [OTHER_NT] [YET_ANOTHER_NT]
-  static TRule* CreateRuleMonolingual(const std::string& rule);
-
-  void ESubstitute(const std::vector<const std::vector<WordID>* >& var_values,
-                   std::vector<WordID>* result) const {
-    int vc = 0;
-    result->clear();
-    for (std::vector<WordID>::const_iterator i = e_.begin(); i != e_.end(); ++i) {
-      const WordID& c = *i;
-      if (c < 1) {
-        ++vc;
-        const std::vector<WordID>& var_value = *var_values[-c];
-        std::copy(var_value.begin(),
-                  var_value.end(),
-                  std::back_inserter(*result));
-      } else {
-        result->push_back(c);
-      }
-    }
-    assert(vc == var_values.size());
-  }
-
-  void FSubstitute(const std::vector<const std::vector<WordID>* >& var_values,
-                   std::vector<WordID>* result) const {
-    int vc = 0;
-    result->clear();
-    for (std::vector<WordID>::const_iterator i = f_.begin(); i != f_.end(); ++i) {
-      const WordID& c = *i;
-      if (c < 1) {
-        const std::vector<WordID>& var_value = *var_values[vc++];
-        std::copy(var_value.begin(),
-                  var_value.end(),
-                  std::back_inserter(*result));
-      } else {
-        result->push_back(c);
-      }
-    }
-    assert(vc == var_values.size());
-  }
-
-  bool ReadFromString(const std::string& line, bool strict = false, bool monolingual = false);
-
-  bool Initialized() const { return e_.size(); }
-
-  std::string AsString(bool verbose = true) const;
-
-  static TRule DummyRule() {
-    TRule res;
-    res.e_.resize(1, 0);
-    return res;
-  }
-
-  const std::vector<WordID>& f() const { return f_; }
-  const std::vector<WordID>& e() const { return e_; }
-
-  int EWords() const { return ELength() - Arity(); }
-  int FWords() const { return FLength() - Arity(); }
-  int FLength() const { return f_.size(); }
-  int ELength() const { return e_.size(); }
-  int Arity() const { return arity_; }
-  bool IsUnary() const { return (Arity() == 1) && (f_.size() == 1); }
-  const SparseVector<double>& GetFeatureValues() const { return scores_; }
-  double Score(int i) const { return scores_[i]; }
-  WordID GetLHS() const { return lhs_; }
-  void ComputeArity();
-
-  // 0 = first variable, -1 = second variable, -2 = third ...
-  std::vector<WordID> e_;
-  // < 0: *-1 = encoding of category of variable
-  std::vector<WordID> f_;
-  WordID lhs_;
-  SparseVector<double> scores_;
-  char arity_;
-  TRulePtr parent_rule_;  // usually NULL, except when doing constrained decoding
-
-  // this is only used when doing synchronous parsing
-  short int prev_i;
-  short int prev_j;
-
- private:
-  bool SanityCheck() const;
-};
-
-#endif