mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-26 05:14:36 +03:00
129 lines
3.6 KiB
C++
129 lines
3.6 KiB
C++
/***********************************************************************
|
|
Moses - statistical machine translation system
|
|
Copyright (C) 2006-2011 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 "DotChart.h"
|
|
#include "moses/TranslationModel/PhraseDictionaryNodeMemory.h"
|
|
|
|
#include <vector>
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
/** @todo what is this?
|
|
*/
|
|
class DottedRuleInMemory : public DottedRule
|
|
{
|
|
public:
|
|
// used only to init dot stack.
|
|
explicit DottedRuleInMemory(const PhraseDictionaryNodeMemory &node)
|
|
: DottedRule()
|
|
, m_node(node) {}
|
|
|
|
DottedRuleInMemory(const PhraseDictionaryNodeMemory &node,
|
|
const ChartCellLabel &cellLabel,
|
|
const DottedRuleInMemory &prev)
|
|
: DottedRule(cellLabel, prev)
|
|
, m_node(node) {}
|
|
|
|
const PhraseDictionaryNodeMemory &GetLastNode() const {
|
|
return m_node;
|
|
}
|
|
|
|
private:
|
|
const PhraseDictionaryNodeMemory &m_node;
|
|
};
|
|
|
|
typedef std::vector<const DottedRuleInMemory*> DottedRuleList;
|
|
typedef std::map<size_t, DottedRuleList> DottedRuleMap;
|
|
|
|
// Collection of all in-memory DottedRules that share a common start point,
|
|
// grouped by end point. Additionally, maintains a list of all
|
|
// DottedRules that could be expanded further, i.e. for which the
|
|
// corresponding PhraseDictionaryNodeMemory is not a leaf.
|
|
class DottedRuleColl
|
|
{
|
|
protected:
|
|
typedef std::vector<DottedRuleList> CollType;
|
|
CollType m_coll;
|
|
DottedRuleList m_expandableDottedRuleList;
|
|
DottedRuleMap m_expandableDottedRuleListTerminalsOnly;
|
|
|
|
public:
|
|
typedef CollType::iterator iterator;
|
|
typedef CollType::const_iterator const_iterator;
|
|
|
|
const_iterator begin() const {
|
|
return m_coll.begin();
|
|
}
|
|
const_iterator end() const {
|
|
return m_coll.end();
|
|
}
|
|
iterator begin() {
|
|
return m_coll.begin();
|
|
}
|
|
iterator end() {
|
|
return m_coll.end();
|
|
}
|
|
|
|
DottedRuleColl(size_t size)
|
|
: m_coll(size) {
|
|
}
|
|
|
|
~DottedRuleColl();
|
|
|
|
const DottedRuleList &Get(size_t pos) const {
|
|
return m_coll[pos];
|
|
}
|
|
DottedRuleList &Get(size_t pos) {
|
|
return m_coll[pos];
|
|
}
|
|
|
|
void Add(size_t pos, const DottedRuleInMemory *dottedRule) {
|
|
UTIL_THROW_IF2(dottedRule == NULL, "Dotted rule is null");
|
|
m_coll[pos].push_back(dottedRule);
|
|
if (!dottedRule->GetLastNode().IsLeaf()) {
|
|
if (dottedRule->GetLastNode().GetNonTerminalMap().empty() && !dottedRule->IsRoot()) {
|
|
size_t startPos = dottedRule->GetWordsRange().GetEndPos() + 1;
|
|
m_expandableDottedRuleListTerminalsOnly[startPos].push_back(dottedRule);
|
|
} else {
|
|
m_expandableDottedRuleList.push_back(dottedRule);
|
|
}
|
|
}
|
|
}
|
|
|
|
void Clear(size_t pos) {
|
|
#ifdef USE_BOOST_POOL
|
|
m_coll[pos].clear();
|
|
#endif
|
|
}
|
|
|
|
const DottedRuleList &GetExpandableDottedRuleList() const {
|
|
return m_expandableDottedRuleList;
|
|
}
|
|
|
|
DottedRuleMap &GetExpandableDottedRuleListTerminalsOnly() {
|
|
return m_expandableDottedRuleListTerminalsOnly;
|
|
}
|
|
|
|
};
|
|
|
|
}
|