mosesdecoder/phrase-extract/extract-ghkm/ScfgRule.h

119 lines
3.1 KiB
C
Raw Normal View History

/***********************************************************************
Moses - statistical machine translation system
Copyright (C) 2006-2011 University of Edinburgh
2013-05-29 21:16:15 +04:00
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.
2013-05-29 21:16:15 +04:00
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.
2013-05-29 21:16:15 +04:00
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 EXTRACT_GHKM_SCFG_RULE_H_
#define EXTRACT_GHKM_SCFG_RULE_H_
#include "Alignment.h"
#include "SyntaxTree.h"
#include <string>
#include <vector>
#include <list>
#include <memory>
#include <iostream>
2013-05-29 21:16:15 +04:00
namespace Moses
{
namespace GHKM
{
class Node;
class Subgraph;
enum SymbolType { Terminal, NonTerminal };
2013-05-29 21:16:15 +04:00
struct Symbol {
public:
Symbol(const std::string &v, SymbolType t) : m_value(v) , m_type(t) {}
2013-05-29 21:16:15 +04:00
const std::string &GetValue() const {
return m_value;
}
SymbolType GetType() const {
return m_type;
}
2013-05-29 21:16:15 +04:00
private:
std::string m_value;
SymbolType m_type;
};
class ScfgRule
{
2013-05-29 21:16:15 +04:00
public:
ScfgRule(const Subgraph &fragment,
const MosesTraining::SyntaxTree *sourceSyntaxTree = 0);
2013-05-29 21:16:15 +04:00
const Symbol &GetSourceLHS() const {
return m_sourceLHS;
}
const Symbol &GetTargetLHS() const {
return m_targetLHS;
}
const std::vector<Symbol> &GetSourceRHS() const {
return m_sourceRHS;
}
const std::vector<Symbol> &GetTargetRHS() const {
return m_targetRHS;
}
const Alignment &GetAlignment() const {
return m_alignment;
}
float GetPcfgScore() const {
return m_pcfgScore;
}
bool HasSourceLabels() const {
return m_hasSourceLabels;
}
void PrintSourceLabels(std::ostream &out) const {
for (std::vector<std::string>::const_iterator it = m_sourceLabels.begin();
it != m_sourceLabels.end(); ++it) {
out << " " << (*it);
}
}
void UpdateSourceLabelCoocCounts(std::map< std::string, std::map<std::string,float>* > &coocCounts,
float count) const;
int Scope() const;
2013-05-29 21:16:15 +04:00
private:
static bool PartitionOrderComp(const Node *, const Node *);
void PushSourceLabel(const MosesTraining::SyntaxTree *sourceSyntaxTree,
const Node *node,
const std::string &nonMatchingLabel);
Symbol m_sourceLHS;
Symbol m_targetLHS;
std::vector<Symbol> m_sourceRHS;
std::vector<Symbol> m_targetRHS;
Alignment m_alignment;
float m_pcfgScore;
bool m_hasSourceLabels;
std::vector<std::string> m_sourceLabels;
unsigned m_numberOfNonTerminals;
};
} // namespace GHKM
} // namespace Moses
#endif