2010-04-12 14:15:49 +04:00
|
|
|
/***********************************************************************
|
2011-06-17 01:20:20 +04:00
|
|
|
Moses - statistical machine translation system
|
|
|
|
Copyright (C) 2006-2011 University of Edinburgh
|
|
|
|
|
2010-04-12 14:15:49 +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.
|
2011-06-17 01:20:20 +04:00
|
|
|
|
2010-04-12 14:15:49 +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.
|
2011-06-17 01:20:20 +04:00
|
|
|
|
2010-04-12 14:15:49 +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
|
2011-06-17 01:20:20 +04:00
|
|
|
***********************************************************************/
|
|
|
|
|
2010-04-08 21:16:10 +04:00
|
|
|
#pragma once
|
|
|
|
|
2012-04-19 22:08:06 +04:00
|
|
|
#include <iostream>
|
2010-04-08 21:16:10 +04:00
|
|
|
#include <ostream>
|
2011-06-17 01:20:20 +04:00
|
|
|
#include <set>
|
|
|
|
#include <vector>
|
2012-04-19 22:08:06 +04:00
|
|
|
#include <cstdlib>
|
2010-04-08 21:16:10 +04:00
|
|
|
|
2012-10-12 01:03:32 +04:00
|
|
|
#include <boost/functional/hash.hpp>
|
|
|
|
|
2010-04-08 21:16:10 +04:00
|
|
|
namespace Moses
|
|
|
|
{
|
|
|
|
|
2011-06-17 01:20:20 +04:00
|
|
|
class AlignmentInfoCollection;
|
|
|
|
|
2012-06-27 03:45:02 +04:00
|
|
|
/** Collection of non-terminal alignment pairs, ordered by source index.
|
|
|
|
* Usually held by a TargetPhrase to map non-terms in hierarchical/syntax models
|
|
|
|
*/
|
2010-04-08 21:16:10 +04:00
|
|
|
class AlignmentInfo
|
|
|
|
{
|
2011-06-17 01:20:20 +04:00
|
|
|
friend std::ostream& operator<<(std::ostream &, const AlignmentInfo &);
|
|
|
|
friend struct AlignmentInfoOrderer;
|
2012-10-12 01:03:32 +04:00
|
|
|
friend struct AlignmentInfoComparator;
|
|
|
|
friend struct AlignmentInfoHasher;
|
2011-06-17 01:20:20 +04:00
|
|
|
friend class AlignmentInfoCollection;
|
2010-04-08 21:16:10 +04:00
|
|
|
|
2011-06-17 01:20:20 +04:00
|
|
|
public:
|
2012-04-19 22:08:06 +04:00
|
|
|
typedef std::set<std::pair<size_t,size_t> > CollType;
|
2011-06-17 01:20:20 +04:00
|
|
|
typedef std::vector<size_t> NonTermIndexMap;
|
2012-04-19 22:08:06 +04:00
|
|
|
typedef std::vector<size_t> TermIndexMap;
|
2011-02-24 16:14:42 +03:00
|
|
|
typedef CollType::const_iterator const_iterator;
|
2011-06-17 01:20:20 +04:00
|
|
|
|
|
|
|
const_iterator begin() const { return m_collection.begin(); }
|
|
|
|
const_iterator end() const { return m_collection.end(); }
|
|
|
|
|
2012-07-02 23:01:07 +04:00
|
|
|
/** Provides a map from target-side to source-side non-terminal indices.
|
|
|
|
* The target-side index should be the rule symbol index (counting terminals).
|
|
|
|
* The index returned is the rule non-terminal index (ignoring terminals).
|
|
|
|
*/
|
2011-06-17 01:20:20 +04:00
|
|
|
const NonTermIndexMap &GetNonTermIndexMap() const {
|
|
|
|
return m_nonTermIndexMap;
|
2011-02-24 16:14:42 +03:00
|
|
|
}
|
2012-04-19 22:08:06 +04:00
|
|
|
|
|
|
|
// only used for hierarchical models, contains terminal alignments
|
|
|
|
const CollType &GetTerminalAlignments() const {
|
|
|
|
return m_terminalCollection;
|
|
|
|
}
|
|
|
|
|
|
|
|
// for phrase-based models, this contains all alignments, for hierarchical models only the NT alignments
|
|
|
|
const CollType &GetAlignments() const {
|
|
|
|
return m_collection;
|
|
|
|
}
|
|
|
|
|
2012-01-26 15:38:40 +04:00
|
|
|
size_t GetSize() const { return m_collection.size(); }
|
|
|
|
|
2011-08-26 06:37:52 +04:00
|
|
|
std::vector< const std::pair<size_t,size_t>* > GetSortedAlignments() const;
|
|
|
|
|
2011-06-17 01:20:20 +04:00
|
|
|
private:
|
2012-07-02 23:01:07 +04:00
|
|
|
//! AlignmentInfo objects should only be created by an AlignmentInfoCollection
|
2011-06-17 01:20:20 +04:00
|
|
|
explicit AlignmentInfo(const std::set<std::pair<size_t,size_t> > &pairs)
|
|
|
|
: m_collection(pairs)
|
|
|
|
{
|
|
|
|
BuildNonTermIndexMap();
|
2011-02-24 16:14:42 +03:00
|
|
|
}
|
2012-04-19 22:08:06 +04:00
|
|
|
|
|
|
|
// use this for hierarchical models
|
|
|
|
explicit AlignmentInfo(const std::set<std::pair<size_t,size_t> > &pairs, int* indicator)
|
|
|
|
{
|
|
|
|
// split alignment set in terminals and non-terminals
|
|
|
|
std::set<std::pair<size_t,size_t> > terminalSet;
|
|
|
|
std::set<std::pair<size_t,size_t> > nonTerminalSet;
|
|
|
|
std::set<std::pair<size_t,size_t> >::iterator iter;
|
|
|
|
for (iter = pairs.begin(); iter != pairs.end(); ++iter) {
|
|
|
|
if (*indicator == 1) nonTerminalSet.insert(*iter);
|
|
|
|
else terminalSet.insert(*iter);
|
|
|
|
indicator++;
|
|
|
|
}
|
|
|
|
m_collection = nonTerminalSet;
|
|
|
|
m_terminalCollection = terminalSet;
|
|
|
|
|
|
|
|
BuildNonTermIndexMap();
|
|
|
|
}
|
|
|
|
|
2011-06-17 01:20:20 +04:00
|
|
|
void BuildNonTermIndexMap();
|
|
|
|
|
|
|
|
CollType m_collection;
|
2012-04-19 22:08:06 +04:00
|
|
|
CollType m_terminalCollection;
|
2011-06-17 01:20:20 +04:00
|
|
|
NonTermIndexMap m_nonTermIndexMap;
|
2010-04-08 21:16:10 +04:00
|
|
|
};
|
|
|
|
|
2012-06-27 03:45:02 +04:00
|
|
|
/** Define an arbitrary strict weak ordering between AlignmentInfo objects
|
|
|
|
* for use by AlignmentInfoCollection.
|
|
|
|
*/
|
2011-06-17 01:20:20 +04:00
|
|
|
struct AlignmentInfoOrderer
|
|
|
|
{
|
|
|
|
bool operator()(const AlignmentInfo &a, const AlignmentInfo &b) const {
|
2012-04-19 22:08:06 +04:00
|
|
|
if (a.m_collection == b.m_collection)
|
|
|
|
return a.m_terminalCollection < b.m_terminalCollection;
|
2011-06-17 01:20:20 +04:00
|
|
|
return a.m_collection < b.m_collection;
|
|
|
|
}
|
2010-04-08 21:16:10 +04:00
|
|
|
};
|
|
|
|
|
2012-10-12 01:03:32 +04:00
|
|
|
/**
|
|
|
|
* Equality functoid
|
|
|
|
**/
|
|
|
|
struct AlignmentInfoComparator
|
|
|
|
{
|
|
|
|
inline bool operator()(const AlignmentInfo &a, const AlignmentInfo &b) const {
|
|
|
|
return a.m_collection == b.m_collection &&
|
|
|
|
a.m_terminalCollection == b.m_terminalCollection &&
|
|
|
|
a.m_nonTermIndexMap == b.m_nonTermIndexMap;
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Hashing functoid
|
|
|
|
**/
|
|
|
|
struct AlignmentInfoHasher
|
|
|
|
{
|
|
|
|
size_t operator()(const AlignmentInfo& a) const
|
|
|
|
{
|
|
|
|
size_t seed = 0;
|
|
|
|
boost::hash_combine(seed,a.m_collection);
|
|
|
|
boost::hash_combine(seed,a.m_terminalCollection);
|
|
|
|
boost::hash_combine(seed,a.m_nonTermIndexMap);
|
|
|
|
return seed;
|
|
|
|
}
|
|
|
|
|
|
|
|
};
|
|
|
|
|
2011-06-17 01:20:20 +04:00
|
|
|
}
|