File size: 1,691 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 |
/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2012 University of Edinburgh
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
***********************************************************************/
#pragma once
#include "SentenceMap.h"
#include "VarSpanNode.h"
#include "moses/TranslationModel/RuleTable/UTrieNode.h"
#include "moses/Util.h"
#include <vector>
namespace Moses
{
struct VarSpanNode;
/** @todo what is this?
*/
struct ApplicableRuleTrie {
public:
ApplicableRuleTrie(int start, int end, const UTrieNode &node)
: m_start(start)
, m_end(end)
, m_node(&node)
, m_vstNode(NULL) {}
~ApplicableRuleTrie() {
RemoveAllInColl(m_children);
}
void Extend(const UTrieNode &root, int minPos, const SentenceMap &sentMap,
bool followsGap);
int m_start;
int m_end;
const UTrieNode *m_node;
const VarSpanNode *m_vstNode;
std::vector<ApplicableRuleTrie*> m_children;
};
}
|