Moses::Manager Class Reference

#include <Manager.h>

Collaboration diagram for Moses::Manager:

List of all members.

Public Member Functions

Manager (InputType const &source, SearchAlgorithm searchAlgorithm, const TranslationSystem *system)

~Manager ()

const TranslationOptionCollection * getSntTranslationOptions ()

const TranslationSystem * GetTranslationSystem ()

void ProcessSentence ()

const Hypothesis * GetBestHypothesis () const

const Hypothesis * GetActualBestHypothesis () const

void CalcNBest (size_t count, TrellisPathList &ret, bool onlyDistinct=0) const

void CalcLatticeSamples (size_t count, TrellisPathList &ret) const

void PrintAllDerivations (long translationId, std::ostream &outputStream) const

void printDivergentHypothesis (long translationId, const Hypothesis *hypo, const std::vector< const TargetPhrase * > &remainingPhrases, float remainingScore, std::ostream &outputStream) const

void printThisHypothesis (long translationId, const Hypothesis *hypo, const std::vector< const TargetPhrase * > &remainingPhrases, float remainingScore, std::ostream &outputStream) const

void GetWordGraph (long translationId, std::ostream &outputWordGraphStream) const

int GetNextHypoId ()

void OutputSearchGraph (long translationId, std::ostream &outputSearchGraphStream) const

void GetSearchGraph (std::vector< SearchGraphNode > &searchGraph) const

const InputType & GetSource () const

void CalcDecoderStatistics () const

void ResetSentenceStats (const InputType &source)

SentenceStats & GetSentenceStats () const

void GetForwardBackwardSearchGraph (std::map< int, bool > *pConnected, std::vector< const Hypothesis * > *pConnectedList, std::map< const Hypothesis *, std::set< const Hypothesis * > > *pOutgoingHyps, std::vector< float > *pFwdBwdScores) const

Public Attributes

InputType const & m_source

Protected Member Functions

void GetConnectedGraph (std::map< int, bool > *pConnected, std::vector< const Hypothesis * > *pConnectedList) const

void GetWinnerConnectedGraph (std::map< int, bool > *pConnected, std::vector< const Hypothesis * > *pConnectedList) const

Protected Attributes

TranslationOptionCollection * m_transOptColl

Search * m_search

HypothesisStack * actual_hypoStack

clock_t m_start

size_t interrupted_flag

std::auto_ptr< SentenceStats > m_sentenceStats

int m_hypoId

Detailed Description

The Manager class implements a stack decoding algorithm. Hypotheses are organized in stacks. One stack contains all hypothesis that have the same number of foreign words translated. The data structure for hypothesis stacks is the class HypothesisStack. The data structure for a hypothesis is the class Hypothesis.

The main decoder loop in the function ProcessSentence() consists of the steps:

Create the list of possible translation options. In phrase-based decoding (and also the first mapping step in the factored model) is a phrase translation from the source to the target. Given a specific input sentence, only a limited number of phrase translation can be applied. For efficient lookup of the translation options later, these optuions are first collected in the function CreateTranslationOption (for more information check the class TranslationOptionCollection)
Create initial hypothesis: Hypothesis stack 0 contains only one empty hypothesis.
Going through stacks 0 ... (sentence_length-1):
- The stack is pruned to the maximum size
- Going through all hypotheses in the stack
  - Each hypothesis is expanded by ProcessOneHypothesis()
  - Expansion means applying a translation option to the hypothesis to create new hypotheses
  - What translation options may be applied depends on reordering limits and overlap with already translated words
  - With a applicable translation option and a hypothesis at hand, a new hypothesis can be created in ExpandHypothesis()
  - New hypothesis are either discarded (because they are too bad), added to the appropriate stack, or re-combined with existing hypotheses

Definition at line 91 of file Manager.h.

Constructor & Destructor Documentation

Moses::Manager::Manager	(	InputType const &	source,
		SearchAlgorithm	searchAlgorithm,
		const TranslationSystem *	system
	)

Definition at line 51 of file Manager.cpp.

References Moses::TranslationSystem::InitializeBeforeSentenceProcessing().

Here is the call graph for this function:

Moses::Manager::~Manager ( )

Definition at line 63 of file Manager.cpp.

References Moses::TranslationSystem::CleanUpAfterSentenceProcessing(), end, m_search, m_start, m_transOptColl, and VERBOSE.

Here is the call graph for this function:

Member Function Documentation

void Moses::Manager::CalcDecoderStatistics ( ) const

Definition at line 407 of file Manager.cpp.

References Moses::SentenceStats::CalcFinalStats(), GetBestHypothesis(), Moses::Hypothesis::GetCurrSourceWordsRange(), Moses::Hypothesis::GetCurrTargetPhrase(), Moses::Hypothesis::GetInput(), Moses::Hypothesis::GetPrevHypo(), GetSentenceStats(), IFVERBOSE, NULL, and TRACE_ERR.

Here is the call graph for this function:

void Moses::Manager::CalcLatticeSamples	(	size_t	count,
		TrellisPathList &	ret
	)			const

Implements lattice sampling, as in Chatterjee & Cancedda, emnlp 2010

Definition at line 267 of file Manager.cpp.

References Moses::TrellisPathList::Add(), CHECK, Moses::Hypothesis::GetId(), Moses::Hypothesis::GetPrevHypo(), Moses::Hypothesis::GetScore(), GetSearchGraph(), and Moses::log_sum().

Here is the call graph for this function:

void Moses::Manager::CalcNBest	(	size_t	count,
		TrellisPathList &	ret,
		bool	onlyDistinct = `0`
	)			const

After decoding, the hypotheses in the stacks and additional arcs form a search graph that can be mined for n-best lists. The heavy lifting is done in the TrellisPath and TrellisPathCollection this function controls this for one sentence.

Parameters:

	count	the number of n-best translations to produce
	ret	holds the n-best list that was calculated

Definition at line 200 of file Manager.cpp.

References Moses::TrellisPathList::Add(), Moses::TrellisPathCollection::Add(), CHECK, Moses::TrellisPath::CreateDeviantPaths(), Moses::Search::GetHypothesisStacks(), Moses::StaticData::GetNBestFactor(), Moses::TrellisPathCollection::GetSize(), Moses::TrellisPathList::GetSize(), Moses::TrellisPath::GetSurfacePhrase(), Moses::StaticData::Instance(), m_search, NULL, Moses::TrellisPathCollection::pop(), and Moses::TrellisPathCollection::Prune().

Here is the call graph for this function:

const Hypothesis* Moses::Manager::GetActualBestHypothesis ( ) const

const Hypothesis * Moses::Manager::GetBestHypothesis ( ) const

Definition at line 977 of file Manager.cpp.

References Moses::Search::GetBestHypothesis(), and m_search.

Referenced by CalcDecoderStatistics(), doConsensusDecoding(), and getLatticeMBRNBest().

Here is the call graph for this function:

Here is the caller graph for this function:

void Moses::Manager::GetConnectedGraph	(	std::map< int, bool > *	pConnected,
		std::vector< const Hypothesis * > *	pConnectedList
	)			const `[protected]`

Definition at line 701 of file Manager.cpp.

References Moses::HypothesisStack::begin(), Moses::HypothesisStack::end(), Moses::Hypothesis::GetArcList(), Moses::Search::GetHypothesisStacks(), Moses::Hypothesis::GetId(), Moses::Hypothesis::GetPrevHypo(), m_search, and NULL.

Here is the call graph for this function:

void Moses::Manager::GetForwardBackwardSearchGraph	(	std::map< int, bool > *	pConnected,
		std::vector< const Hypothesis * > *	pConnectedList,
		std::map< const Hypothesis , std::set< const Hypothesis > > *	pOutgoingHyps,
		std::vector< float > *	pFwdBwdScores
	)			const

Referenced by doConsensusDecoding(), and getLatticeMBRNBest().

Here is the caller graph for this function:

int Moses::Manager::GetNextHypoId ( )

Definition at line 982 of file Manager.cpp.

References m_hypoId.

void Moses::Manager::GetSearchGraph ( std::vector< SearchGraphNode > & searchGraph ) const

Referenced by CalcLatticeSamples(), and OutputSearchGraph().

Here is the caller graph for this function:

SentenceStats & Moses::Manager::GetSentenceStats ( ) const

Definition at line 991 of file Manager.cpp.

References m_sentenceStats.

Referenced by Moses::HypothesisStackNormal::AddPrune(), Moses::HypothesisStackCubePruning::AddPrune(), CalcDecoderStatistics(), Moses::Hypothesis::CalcExpectedScore(), Moses::Hypothesis::CalcRemainingScore(), Moses::Hypothesis::CalcScore(), Moses::LanguageModelImplementation::Evaluate(), Moses::SearchNormal::ExpandHypothesis(), Moses::Hypothesis::Hypothesis(), Moses::SearchNormal::ProcessSentence(), Moses::SearchCubePruning::ProcessSentence(), ProcessSentence(), Moses::HypothesisStackNormal::PruneToSize(), and Moses::HypothesisStackCubePruning::PruneToSize().

Here is the caller graph for this function:

const TranslationOptionCollection * Moses::Manager::getSntTranslationOptions ( )

Definition at line 131 of file Manager.cpp.

References m_transOptColl.

const InputType& Moses::Manager::GetSource ( ) const [inline]

Definition at line 142 of file Manager.h.

References m_source.

Referenced by Moses::HypothesisStackCubePruning::SetBitmapAccessor().

Here is the caller graph for this function:

const TranslationSystem* Moses::Manager::GetTranslationSystem ( ) [inline]

Definition at line 122 of file Manager.h.

Referenced by Moses::Hypothesis::CalcRemainingScore(), Moses::Hypothesis::CalcScore(), Moses::Hypothesis::Hypothesis(), and Moses::HypothesisStackCubePruning::SetBitmapAccessor().

Here is the caller graph for this function:

void Moses::Manager::GetWinnerConnectedGraph	(	std::map< int, bool > *	pConnected,
		std::vector< const Hypothesis * > *	pConnectedList
	)			const `[protected]`

Definition at line 744 of file Manager.cpp.

References Moses::HypothesisStack::begin(), Moses::HypothesisStack::end(), Moses::Hypothesis::GetArcList(), Moses::Search::GetHypothesisStacks(), Moses::Hypothesis::GetId(), Moses::Hypothesis::GetPrevHypo(), m_search, and NULL.

Here is the call graph for this function:

void Moses::Manager::GetWordGraph	(	long	translationId,
		std::ostream &	outputWordGraphStream
	)			const

Definition at line 510 of file Manager.cpp.

References Moses::HypothesisStack::begin(), Moses::HypothesisStack::end(), Moses::Hypothesis::GetArcList(), Moses::Search::GetHypothesisStacks(), Moses::StaticData::GetParam(), Moses::StaticData::Instance(), m_search, NULL, Moses::OutputWordGraph(), and Moses::Scan< bool >().

Here is the call graph for this function:

void Moses::Manager::OutputSearchGraph	(	long	translationId,
		std::ostream &	outputSearchGraphStream
	)			const

Definition at line 890 of file Manager.cpp.

References GetSearchGraph(), and Moses::OutputSearchNode().

Here is the call graph for this function:

void Moses::Manager::PrintAllDerivations	(	long	translationId,
		std::ostream &	outputStream
	)			const

void Moses::Manager::printDivergentHypothesis	(	long	translationId,
		const Hypothesis *	hypo,
		const std::vector< const TargetPhrase * > &	remainingPhrases,
		float	remainingScore,
		std::ostream &	outputStream
	)			const

void Moses::Manager::printThisHypothesis	(	long	translationId,
		const Hypothesis *	hypo,
		const std::vector< const TargetPhrase * > &	remainingPhrases,
		float	remainingScore,
		std::ostream &	outputStream
	)			const

void Moses::Manager::ProcessSentence ( )

Main decoder loop that translates a sentence by expanding hypotheses stack by stack, until the end of the sentence.

Definition at line 81 of file Manager.cpp.

References Moses::SentenceStats::AddTimeCollectOpts(), Moses::TranslationOptionCollection::CreateTranslationOptions(), GetSentenceStats(), IFVERBOSE, Moses::TranslationSystem::InitializeBeforeSentenceProcessing(), m_search, m_source, m_start, m_transOptColl, Moses::Search::ProcessSentence(), ResetSentenceStats(), and VERBOSE.

Here is the call graph for this function:

void Moses::Manager::ResetSentenceStats ( const InputType & source )

Definition at line 987 of file Manager.cpp.

References m_sentenceStats.

Referenced by ProcessSentence().

Here is the caller graph for this function:

Member Data Documentation

HypothesisStack* Moses::Manager::actual_hypoStack [protected]

Definition at line 103 of file Manager.h.

size_t Moses::Manager::interrupted_flag [protected]

Definition at line 105 of file Manager.h.

int Moses::Manager::m_hypoId [protected]

Definition at line 107 of file Manager.h.

Referenced by GetNextHypoId().

Search* Moses::Manager::m_search [protected]

Definition at line 101 of file Manager.h.

Referenced by CalcNBest(), GetBestHypothesis(), GetConnectedGraph(), GetWinnerConnectedGraph(), GetWordGraph(), ProcessSentence(), and ~Manager().

std::auto_ptr<SentenceStats> Moses::Manager::m_sentenceStats [protected]

Definition at line 106 of file Manager.h.

Referenced by GetSentenceStats(), and ResetSentenceStats().

InputType const& Moses::Manager::m_source

source sentence to be translated

Definition at line 118 of file Manager.h.

Referenced by GetSource(), and ProcessSentence().

clock_t Moses::Manager::m_start [protected]

actual (full expanded) stack of hypotheses starting time, used for logging

Definition at line 104 of file Manager.h.

Referenced by ProcessSentence(), and ~Manager().

TranslationOptionCollection* Moses::Manager::m_transOptColl [protected]

pre-computed list of translation options for the phrases in this sentence

Definition at line 100 of file Manager.h.

Referenced by getSntTranslationOptions(), ProcessSentence(), and ~Manager().

The documentation for this class was generated from the following files:

mosesdecoder/moses/src/Manager.h
mosesdecoder/moses/src/Manager.cpp


Public Member Functions
	Manager (InputType const &source, SearchAlgorithm searchAlgorithm, const TranslationSystem *system)
	~Manager ()
const TranslationOptionCollection *	getSntTranslationOptions ()
const TranslationSystem *	GetTranslationSystem ()
void	ProcessSentence ()
const Hypothesis *	GetBestHypothesis () const
const Hypothesis *	GetActualBestHypothesis () const
void	CalcNBest (size_t count, TrellisPathList &ret, bool onlyDistinct=0) const
void	CalcLatticeSamples (size_t count, TrellisPathList &ret) const
void	PrintAllDerivations (long translationId, std::ostream &outputStream) const
void	printDivergentHypothesis (long translationId, const Hypothesis hypo, const std::vector< const TargetPhrase > &remainingPhrases, float remainingScore, std::ostream &outputStream) const
void	printThisHypothesis (long translationId, const Hypothesis hypo, const std::vector< const TargetPhrase > &remainingPhrases, float remainingScore, std::ostream &outputStream) const
void	GetWordGraph (long translationId, std::ostream &outputWordGraphStream) const
int	GetNextHypoId ()
void	OutputSearchGraph (long translationId, std::ostream &outputSearchGraphStream) const
void	GetSearchGraph (std::vector< SearchGraphNode > &searchGraph) const
const InputType &	GetSource () const
void	CalcDecoderStatistics () const
void	ResetSentenceStats (const InputType &source)
SentenceStats &	GetSentenceStats () const
void	GetForwardBackwardSearchGraph (std::map< int, bool > pConnected, std::vector< const Hypothesis > pConnectedList, std::map< const Hypothesis , std::set< const Hypothesis * > > pOutgoingHyps, std::vector< float > pFwdBwdScores) const
Public Attributes
InputType const &	m_source
Protected Member Functions
void	GetConnectedGraph (std::map< int, bool > pConnected, std::vector< const Hypothesis > *pConnectedList) const
void	GetWinnerConnectedGraph (std::map< int, bool > pConnected, std::vector< const Hypothesis > *pConnectedList) const
Protected Attributes
TranslationOptionCollection *	m_transOptColl
Search *	m_search
HypothesisStack *	actual_hypoStack
clock_t	m_start
size_t	interrupted_flag
std::auto_ptr< SentenceStats >	m_sentenceStats
int	m_hypoId