File size: 3,596 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 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 |
// $Id$
// vim:tabstop=2
/***********************************************************************
Moses - factored phrase-based language decoder
Copyright (C) 2010 Hieu Hoang
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 <iostream>
#include <queue>
#include <map>
#include <vector>
#include "Word.h"
#include "Range.h"
#include "NonTerminal.h"
#include "ChartHypothesis.h"
#include "ChartHypothesisCollection.h"
#include "RuleCube.h"
#include "ChartCellLabelSet.h"
#include <boost/scoped_ptr.hpp>
#include <boost/functional/hash.hpp>
#include <boost/unordered_map.hpp>
#include <boost/version.hpp>
namespace Moses
{
class ChartSearchGraphWriter;
class ChartTranslationOptionList;
class ChartCellCollection;
class ChartManager;
class ChartCellBase
{
public:
ChartCellBase(size_t startPos, size_t endPos);
virtual ~ChartCellBase();
const ChartCellLabelSet &GetTargetLabelSet() const {
return m_targetLabelSet;
}
ChartCellLabelSet &MutableTargetLabelSet() {
return m_targetLabelSet;
}
const Range &GetCoverage() const {
return m_coverage;
}
protected:
const Range m_coverage;
ChartCellLabelSet m_targetLabelSet;
};
/** 1 cell in chart decoder.
* Doesn't directly hold hypotheses. Each cell contain a map of ChartHypothesisCollection that have different constituent labels
*/
class ChartCell : public ChartCellBase
{
friend std::ostream& operator<<(std::ostream&, const ChartCell&);
public:
#if defined(BOOST_VERSION) && (BOOST_VERSION >= 104200)
typedef boost::unordered_map<Word,
ChartHypothesisCollection,
NonTerminalHasher,
NonTerminalEqualityPred
> MapType;
#else
typedef std::map<Word, ChartHypothesisCollection> MapType;
#endif
protected:
MapType m_hypoColl;
bool m_nBestIsEnabled; /**< flag to determine whether to keep track of old arcs */
ChartManager &m_manager;
public:
ChartCell(size_t startPos, size_t endPos, ChartManager &manager);
~ChartCell();
void Decode(const ChartTranslationOptionList &transOptList
,const ChartCellCollection &allChartCells);
//! Get all hypotheses in the cell that have the specified constituent label
const HypoList *GetSortedHypotheses(const Word &constituentLabel) const {
MapType::const_iterator p = m_hypoColl.find(constituentLabel);
return (p == m_hypoColl.end()) ? NULL : &(p->second.GetSortedHypotheses());
}
//! for n-best list
const HypoList *GetAllSortedHypotheses() const;
bool AddHypothesis(ChartHypothesis *hypo);
void SortHypotheses();
void PruneToSize();
const ChartHypothesis *GetBestHypothesis() const;
void CleanupArcList();
void OutputSizes(std::ostream &out) const;
size_t GetSize() const;
void WriteSearchGraph(const ChartSearchGraphWriter& writer, const std::map<unsigned,bool> &reachable) const;
};
}
|