mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-12-26 05:14:36 +03:00
45630a5851
speed-up of decoding depends on how much time is spent in parser: 10-50% speed-up for string-to-tree systems observed (more on long sentences and with high max-chart-span). if you only use hiero or string-to-tree models (but none with source syntax), use compile-option --unlabelled-source for (small) efficiency gains.
90 lines
2.8 KiB
C++
90 lines
2.8 KiB
C++
/***********************************************************************
|
|
Moses - factored phrase-based language decoder
|
|
Copyright (C) 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
|
|
#ifndef moses_ChartRuleLookupManagerMemoryPerSentence_h
|
|
#define moses_ChartRuleLookupManagerMemoryPerSentence_h
|
|
|
|
#include <vector>
|
|
|
|
#include "ChartRuleLookupManagerCYKPlus.h"
|
|
#include "CompletedRuleCollection.h"
|
|
#include "moses/NonTerminal.h"
|
|
#include "moses/TranslationModel/PhraseDictionaryMemory.h"
|
|
#include "moses/TranslationModel/PhraseDictionaryNodeMemory.h"
|
|
#include "moses/StackVec.h"
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
class ChartParserCallback;
|
|
class WordsRange;
|
|
|
|
//! Implementation of ChartRuleLookupManager for in-memory rule tables.
|
|
class ChartRuleLookupManagerMemoryPerSentence : public ChartRuleLookupManagerCYKPlus
|
|
{
|
|
public:
|
|
ChartRuleLookupManagerMemoryPerSentence(const ChartParser &parser,
|
|
const ChartCellCollectionBase &cellColl,
|
|
const PhraseDictionaryFuzzyMatch &ruleTable);
|
|
|
|
~ChartRuleLookupManagerMemoryPerSentence() {};
|
|
|
|
virtual void GetChartRuleCollection(
|
|
const WordsRange &range,
|
|
size_t lastPos, // last position to consider if using lookahead
|
|
ChartParserCallback &outColl);
|
|
|
|
private:
|
|
|
|
void GetTerminalExtension(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t pos);
|
|
|
|
void GetNonTerminalExtension(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t startPos,
|
|
size_t endPos);
|
|
|
|
void AddAndExtend(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t endPos,
|
|
const ChartCellLabel *cellLabel);
|
|
|
|
const PhraseDictionaryFuzzyMatch &m_ruleTable;
|
|
|
|
// permissible soft nonterminal matches (target side)
|
|
bool m_isSoftMatching;
|
|
const std::vector<std::vector<Word> >& m_softMatchingMap;
|
|
|
|
// temporary storage of completed rules (one collection per end position; all rules collected consecutively start from the same position)
|
|
std::vector<CompletedRuleCollection> m_completedRules;
|
|
|
|
size_t m_lastPos;
|
|
size_t m_unaryPos;
|
|
|
|
StackVec m_stackVec;
|
|
ChartParserCallback* m_outColl;
|
|
|
|
};
|
|
|
|
} // namespace Moses
|
|
|
|
#endif
|