File size: 1,757 Bytes
158b61b |
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 |
#pragma once
#include <map>
#include <vector>
#include <boost/functional/hash.hpp>
#include <boost/unordered_map.hpp>
#include <boost/version.hpp>
#include "moses/Syntax/RuleTable.h"
#include "moses/Syntax/SymbolEqualityPred.h"
#include "moses/Syntax/SymbolHasher.h"
#include "moses/TargetPhrase.h"
#include "moses/TargetPhraseCollection.h"
#include "moses/Terminal.h"
#include "moses/Util.h"
#include "moses/Word.h"
#include "RuleTrie.h"
namespace Moses
{
namespace Syntax
{
namespace T2S
{
class HyperTree: public RuleTable
{
public:
class Node
{
public:
typedef boost::unordered_map<std::vector<Factor*>, Node> Map;
bool IsLeaf() const {
return m_map.empty();
}
bool HasRules() const {
return !m_targetPhraseCollection.IsEmpty();
}
void Prune(std::size_t tableLimit);
void Sort(std::size_t tableLimit);
Node *GetOrCreateChild(const HyperPath::NodeSeq &);
const Node *GetChild(const HyperPath::NodeSeq &) const;
const TargetPhraseCollection::shared_ptr GetTargetPhraseCollection() const
return m_targetPhraseCollection;
}
TargetPhraseCollection::shared_ptr GetTargetPhraseCollection()
return m_targetPhraseCollection;
}
const Map &GetMap() const
{
return m_map;
}
private:
Map m_map;
TargetPhraseCollection m_targetPhraseCollection;
};
HyperTree(const RuleTableFF *ff) : RuleTable(ff) {}
const Node &GetRootNode() const
{
return m_root;
}
private:
friend class RuleTrieCreator;
TargetPhraseCollection::shared_ptr GetOrCreateTargetPhraseCollection(
const Word &sourceLHS, const Phrase &sourceRHS);
Node &GetOrCreateNode(const Phrase &sourceRHS);
void SortAndPrune(std::size_t);
Node m_root;
};
} // namespace T2S
} // namespace Syntax
} // namespace Moses
|