mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-20 15:48:05 +03:00
230 lines
8.2 KiB
C++
230 lines
8.2 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
|
|
***********************************************************************/
|
|
|
|
#include <iostream>
|
|
#include "ChartRuleLookupManagerMemory.h"
|
|
|
|
#include "moses/ChartParser.h"
|
|
#include "moses/InputType.h"
|
|
#include "moses/ChartParserCallback.h"
|
|
#include "moses/StaticData.h"
|
|
#include "moses/NonTerminal.h"
|
|
#include "moses/ChartCellCollection.h"
|
|
#include "moses/TranslationModel/PhraseDictionaryMemory.h"
|
|
|
|
using namespace std;
|
|
|
|
namespace Moses
|
|
{
|
|
|
|
ChartRuleLookupManagerMemory::ChartRuleLookupManagerMemory(
|
|
const ChartParser &parser,
|
|
const ChartCellCollectionBase &cellColl,
|
|
const PhraseDictionaryMemory &ruleTable)
|
|
: ChartRuleLookupManagerCYKPlus(parser, cellColl)
|
|
, m_ruleTable(ruleTable)
|
|
, m_softMatchingMap(StaticData::Instance().GetSoftMatches())
|
|
{
|
|
|
|
size_t sourceSize = parser.GetSize();
|
|
|
|
m_completedRules.resize(sourceSize);
|
|
|
|
m_isSoftMatching = !m_softMatchingMap.empty();
|
|
}
|
|
|
|
void ChartRuleLookupManagerMemory::GetChartRuleCollection(
|
|
const WordsRange &range,
|
|
size_t lastPos,
|
|
ChartParserCallback &outColl)
|
|
{
|
|
size_t startPos = range.GetStartPos();
|
|
size_t absEndPos = range.GetEndPos();
|
|
|
|
m_lastPos = lastPos;
|
|
m_stackVec.clear();
|
|
m_outColl = &outColl;
|
|
m_unaryPos = absEndPos-1; // rules ending in this position are unary and should not be added to collection
|
|
|
|
const PhraseDictionaryNodeMemory &rootNode = m_ruleTable.GetRootNode();
|
|
|
|
// size-1 terminal rules
|
|
if (startPos == absEndPos) {
|
|
const Word &sourceWord = GetSourceAt(absEndPos).GetLabel();
|
|
const PhraseDictionaryNodeMemory *child = rootNode.GetChild(sourceWord);
|
|
|
|
// if we found a new rule -> directly add it to the out collection
|
|
if (child != NULL) {
|
|
const TargetPhraseCollection &tpc = child->GetTargetPhraseCollection();
|
|
outColl.Add(tpc, m_stackVec, range);
|
|
}
|
|
}
|
|
// all rules starting with nonterminal
|
|
else if (absEndPos > startPos) {
|
|
GetNonTerminalExtension(&rootNode, startPos, absEndPos-1);
|
|
// all (non-unary) rules starting with terminal
|
|
if (absEndPos == startPos+1) {
|
|
GetTerminalExtension(&rootNode, absEndPos-1);
|
|
}
|
|
}
|
|
|
|
// copy temporarily stored rules to out collection
|
|
CompletedRuleCollection rules = m_completedRules[absEndPos];
|
|
for (vector<CompletedRule*>::const_iterator iter = rules.begin(); iter != rules.end(); ++iter) {
|
|
outColl.Add((*iter)->GetTPC(), (*iter)->GetStackVector(), range);
|
|
}
|
|
|
|
m_completedRules[absEndPos].Clear();
|
|
|
|
}
|
|
|
|
// if a (partial) rule matches, add it to list completed rules (if non-unary and non-empty), and try find expansions that have this partial rule as prefix.
|
|
void ChartRuleLookupManagerMemory::AddAndExtend(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t endPos,
|
|
const ChartCellLabel *cellLabel) {
|
|
|
|
// add backpointer
|
|
if (cellLabel != NULL) {
|
|
m_stackVec.push_back(cellLabel);
|
|
}
|
|
|
|
const TargetPhraseCollection &tpc = node->GetTargetPhraseCollection();
|
|
// add target phrase collection (except if rule is empty or unary)
|
|
if (!tpc.IsEmpty() && endPos != m_unaryPos) {
|
|
m_completedRules[endPos].Add(tpc, m_stackVec, *m_outColl);
|
|
}
|
|
|
|
// get all further extensions of rule (until reaching end of sentence or max-chart-span)
|
|
if (endPos < m_lastPos) {
|
|
if (!node->GetTerminalMap().empty()) {
|
|
GetTerminalExtension(node, endPos+1);
|
|
}
|
|
if (!node->GetNonTerminalMap().empty()) {
|
|
for (size_t newEndPos = endPos+1; newEndPos <= m_lastPos; newEndPos++) {
|
|
GetNonTerminalExtension(node, endPos+1, newEndPos);
|
|
}
|
|
}
|
|
}
|
|
|
|
// remove backpointer
|
|
if (cellLabel != NULL) {
|
|
m_stackVec.pop_back();
|
|
}
|
|
}
|
|
|
|
// search all possible terminal extensions of a partial rule (pointed at by node) at a given position
|
|
// recursively try to expand partial rules into full rules up to m_lastPos.
|
|
void ChartRuleLookupManagerMemory::GetTerminalExtension(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t pos) {
|
|
|
|
const Word &sourceWord = GetSourceAt(pos).GetLabel();
|
|
const PhraseDictionaryNodeMemory::TerminalMap & terminals = node->GetTerminalMap();
|
|
|
|
// if node has small number of terminal edges, test word equality for each.
|
|
if (terminals.size() < 5) {
|
|
for (PhraseDictionaryNodeMemory::TerminalMap::const_iterator iter = terminals.begin(); iter != terminals.end(); ++iter) {
|
|
const Word & word = iter->first;
|
|
if (word == sourceWord) {
|
|
const PhraseDictionaryNodeMemory *child = & iter->second;
|
|
AddAndExtend(child, pos, NULL);
|
|
}
|
|
}
|
|
}
|
|
// else, do hash lookup
|
|
else {
|
|
const PhraseDictionaryNodeMemory *child = node->GetChild(sourceWord);
|
|
if (child != NULL) {
|
|
AddAndExtend(child, pos, NULL);
|
|
}
|
|
}
|
|
}
|
|
|
|
// search all nonterminal possible nonterminal extensions of a partial rule (pointed at by node) for a given span (StartPos, endPos).
|
|
// recursively try to expand partial rules into full rules up to m_lastPos.
|
|
void ChartRuleLookupManagerMemory::GetNonTerminalExtension(
|
|
const PhraseDictionaryNodeMemory *node,
|
|
size_t startPos,
|
|
size_t endPos) {
|
|
|
|
// target non-terminal labels for the span
|
|
const ChartCellLabelSet &targetNonTerms = GetTargetLabelSet(startPos, endPos);
|
|
|
|
if (targetNonTerms.GetSize() == 0) {
|
|
return;
|
|
}
|
|
|
|
#if !defined(UNLABELLED_SOURCE)
|
|
// source non-terminal labels for the span
|
|
const InputPath &inputPath = GetParser().GetInputPath(startPos, endPos);
|
|
const std::vector<bool> &sourceNonTermArray = inputPath.GetNonTerminalArray();
|
|
|
|
// can this ever be true? Moses seems to pad the non-terminal set of the input with [X]
|
|
if (inputPath.GetNonTerminalSet().size() == 0) {
|
|
return;
|
|
}
|
|
#endif
|
|
|
|
// non-terminal labels in phrase dictionary node
|
|
const PhraseDictionaryNodeMemory::NonTerminalMap & nonTermMap = node->GetNonTerminalMap();
|
|
|
|
// loop over possible expansions of the rule
|
|
PhraseDictionaryNodeMemory::NonTerminalMap::const_iterator p;
|
|
PhraseDictionaryNodeMemory::NonTerminalMap::const_iterator end = nonTermMap.end();
|
|
for (p = nonTermMap.begin(); p != end; ++p) {
|
|
// does it match possible source and target non-terminals?
|
|
#if defined(UNLABELLED_SOURCE)
|
|
const Word &targetNonTerm = p->first;
|
|
#else
|
|
const PhraseDictionaryNodeMemory::NonTerminalMapKey &key = p->first;
|
|
const Word &sourceNonTerm = key.first;
|
|
// check if source label matches
|
|
if (! sourceNonTermArray[sourceNonTerm[0]->GetId()]) {
|
|
continue;
|
|
}
|
|
const Word &targetNonTerm = key.second;
|
|
#endif
|
|
//soft matching of NTs
|
|
if (m_isSoftMatching && !m_softMatchingMap[targetNonTerm[0]->GetId()].empty()) {
|
|
const std::vector<Word>& softMatches = m_softMatchingMap[targetNonTerm[0]->GetId()];
|
|
for (std::vector<Word>::const_iterator softMatch = softMatches.begin(); softMatch != softMatches.end(); ++softMatch) {
|
|
const ChartCellLabel *cellLabel = targetNonTerms.Find(*softMatch);
|
|
if (cellLabel == NULL) {
|
|
continue;
|
|
}
|
|
// create new rule
|
|
const PhraseDictionaryNodeMemory &child = p->second;
|
|
AddAndExtend(&child, endPos, cellLabel);
|
|
}
|
|
} // end of soft matches lookup
|
|
|
|
const ChartCellLabel *cellLabel = targetNonTerms.Find(targetNonTerm);
|
|
if (cellLabel == NULL) {
|
|
continue;
|
|
}
|
|
// create new rule
|
|
const PhraseDictionaryNodeMemory &child = p->second;
|
|
AddAndExtend(&child, endPos, cellLabel);
|
|
}
|
|
}
|
|
|
|
|
|
} // namespace Moses
|