mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-07-14 14:50:41 +03:00
90 lines
2.4 KiB
C++
90 lines
2.4 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 "HypoList.h"
|
|
#include "Word.h"
|
|
#include "Range.h"
|
|
#include "ChartParserCallback.h"
|
|
|
|
namespace search
|
|
{
|
|
class Vertex;
|
|
}
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
class Word;
|
|
|
|
/** Contains a range, word (non-terms?) and a vector of hypotheses.
|
|
* @todo This is probably incompatible with lattice decoding when the word that spans
|
|
* a position (or positions) can vary.
|
|
* @todo is this to hold sorted hypotheses that are in the queue for creating the next hypos?
|
|
*/
|
|
class ChartCellLabel
|
|
{
|
|
public:
|
|
union Stack {
|
|
const HypoList *cube; // cube pruning
|
|
search::Vertex *incr; // incremental search after filling.
|
|
void *incr_generator; // incremental search during filling.
|
|
};
|
|
|
|
|
|
ChartCellLabel(const Range &coverage, const Word &label,
|
|
Stack stack=Stack())
|
|
: m_coverage(coverage)
|
|
, m_label(label)
|
|
, m_stack(stack)
|
|
, m_bestScore(0) {
|
|
}
|
|
|
|
const Range &GetCoverage() const {
|
|
return m_coverage;
|
|
}
|
|
const Word &GetLabel() const {
|
|
return m_label;
|
|
}
|
|
Stack GetStack() const {
|
|
return m_stack;
|
|
}
|
|
Stack &MutableStack() {
|
|
return m_stack;
|
|
}
|
|
|
|
//caching of best score on stack
|
|
float GetBestScore(const ChartParserCallback *outColl) const {
|
|
if (m_bestScore == 0) {
|
|
m_bestScore = outColl->GetBestScore(this);
|
|
}
|
|
return m_bestScore;
|
|
}
|
|
|
|
private:
|
|
const Range &m_coverage;
|
|
const Word &m_label;
|
|
//const InputPath &m_inputPath;
|
|
Stack m_stack;
|
|
mutable float m_bestScore;
|
|
};
|
|
|
|
}
|