2008-06-11 14:52:57 +04:00
|
|
|
// $Id$
|
|
|
|
|
|
|
|
/***********************************************************************
|
|
|
|
Moses - factored phrase-based language decoder
|
|
|
|
Copyright (C) 2006 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
|
|
|
|
***********************************************************************/
|
|
|
|
|
2010-02-24 14:15:44 +03:00
|
|
|
#ifndef moses_TargetPhraseCollection_h
|
|
|
|
#define moses_TargetPhraseCollection_h
|
2008-06-11 14:52:57 +04:00
|
|
|
|
|
|
|
#include <vector>
|
2013-03-08 20:33:36 +04:00
|
|
|
#include <iostream>
|
2008-06-11 14:52:57 +04:00
|
|
|
#include "TargetPhrase.h"
|
|
|
|
#include "Util.h"
|
|
|
|
|
2008-10-09 03:51:26 +04:00
|
|
|
namespace Moses
|
|
|
|
{
|
|
|
|
|
2009-05-26 23:30:35 +04:00
|
|
|
//! a list of target phrases that is translated from the same source phrase
|
2008-06-11 14:52:57 +04:00
|
|
|
class TargetPhraseCollection
|
|
|
|
{
|
|
|
|
protected:
|
2013-03-08 20:33:36 +04:00
|
|
|
friend std::ostream& operator<<(std::ostream &, const TargetPhraseCollection &);
|
|
|
|
|
2013-08-08 17:38:41 +04:00
|
|
|
typedef std::vector<const TargetPhrase*> CollType;
|
|
|
|
CollType m_collection;
|
2011-02-24 16:14:42 +03:00
|
|
|
|
|
|
|
public:
|
|
|
|
// iters
|
2013-08-08 17:38:41 +04:00
|
|
|
typedef CollType::iterator iterator;
|
|
|
|
typedef CollType::const_iterator const_iterator;
|
2011-02-24 16:14:42 +03:00
|
|
|
|
2015-01-14 14:07:42 +03:00
|
|
|
TargetPhrase const*
|
|
|
|
operator[](size_t const i) const {
|
2014-06-05 04:44:11 +04:00
|
|
|
return m_collection.at(i);
|
2015-01-14 14:07:42 +03:00
|
|
|
}
|
2014-06-05 04:44:11 +04:00
|
|
|
|
2011-02-24 16:14:42 +03:00
|
|
|
iterator begin() {
|
|
|
|
return m_collection.begin();
|
|
|
|
}
|
|
|
|
iterator end() {
|
|
|
|
return m_collection.end();
|
|
|
|
}
|
|
|
|
const_iterator begin() const {
|
|
|
|
return m_collection.begin();
|
|
|
|
}
|
|
|
|
const_iterator end() const {
|
|
|
|
return m_collection.end();
|
|
|
|
}
|
|
|
|
|
2015-01-14 14:07:42 +03:00
|
|
|
TargetPhraseCollection() {
|
|
|
|
}
|
2013-08-15 23:20:44 +04:00
|
|
|
|
2013-09-07 12:51:09 +04:00
|
|
|
TargetPhraseCollection(const TargetPhraseCollection ©);
|
2013-08-15 23:20:44 +04:00
|
|
|
|
2013-09-28 12:42:17 +04:00
|
|
|
virtual ~TargetPhraseCollection() {
|
2013-07-19 16:58:39 +04:00
|
|
|
Remove();
|
2011-02-24 16:14:42 +03:00
|
|
|
}
|
|
|
|
|
2013-08-08 17:38:41 +04:00
|
|
|
const CollType &GetCollection() const {
|
2013-05-29 21:16:15 +04:00
|
|
|
return m_collection;
|
|
|
|
}
|
2011-06-27 19:13:15 +04:00
|
|
|
|
2014-01-13 18:41:52 +04:00
|
|
|
//! delete an entry from the collection
|
|
|
|
void Remove(const size_t pos) {
|
2014-01-15 19:42:02 +04:00
|
|
|
if (pos < m_collection.size()) {
|
2014-01-13 18:41:52 +04:00
|
|
|
m_collection.erase(begin() + pos);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//! return an entry of the collection
|
2014-01-14 11:50:18 +04:00
|
|
|
const TargetPhrase* GetTargetPhrase(const size_t pos) const {
|
2014-01-15 19:42:02 +04:00
|
|
|
return m_collection[pos];
|
2014-01-13 18:41:52 +04:00
|
|
|
}
|
|
|
|
|
2011-02-24 16:14:42 +03:00
|
|
|
//! divide collection into 2 buckets using std::nth_element, the top & bottom according to table limit
|
|
|
|
void NthElement(size_t tableLimit);
|
|
|
|
|
|
|
|
//! number of target phrases in this collection
|
|
|
|
size_t GetSize() const {
|
|
|
|
return m_collection.size();
|
|
|
|
}
|
|
|
|
//! wether collection has any phrases
|
|
|
|
bool IsEmpty() const {
|
|
|
|
return m_collection.empty();
|
|
|
|
}
|
|
|
|
//! add a new entry into collection
|
|
|
|
void Add(TargetPhrase *targetPhrase) {
|
|
|
|
m_collection.push_back(targetPhrase);
|
|
|
|
}
|
|
|
|
|
|
|
|
void Prune(bool adhereTableLimit, size_t tableLimit);
|
2011-06-27 19:13:15 +04:00
|
|
|
void Sort(bool adhereTableLimit, size_t tableLimit);
|
2010-04-08 21:16:10 +04:00
|
|
|
|
2013-07-18 23:23:44 +04:00
|
|
|
void Remove() {
|
2013-07-18 20:00:44 +04:00
|
|
|
RemoveAllInColl(m_collection);
|
2013-07-12 17:49:52 +04:00
|
|
|
}
|
2013-07-18 23:23:44 +04:00
|
|
|
void Detach() {
|
|
|
|
m_collection.clear();
|
|
|
|
}
|
2013-07-12 17:49:52 +04:00
|
|
|
|
2008-06-11 14:52:57 +04:00
|
|
|
};
|
|
|
|
|
2013-08-07 17:10:42 +04:00
|
|
|
|
|
|
|
// LEGACY
|
|
|
|
// DO NOT USE. NOT LEGACY CODE
|
|
|
|
class TargetPhraseCollectionWithSourcePhrase : public TargetPhraseCollection
|
|
|
|
{
|
|
|
|
protected:
|
|
|
|
//friend std::ostream& operator<<(std::ostream &, const TargetPhraseCollectionWithSourcePhrase &);
|
|
|
|
|
|
|
|
// TODO boost::ptr_vector
|
|
|
|
std::vector<Phrase> m_sourcePhrases;
|
|
|
|
|
|
|
|
public:
|
|
|
|
const std::vector<Phrase> &GetSourcePhrases() const {
|
|
|
|
return m_sourcePhrases;
|
|
|
|
}
|
2013-07-12 17:49:52 +04:00
|
|
|
|
2013-08-07 17:35:40 +04:00
|
|
|
void Add(TargetPhrase *targetPhrase);
|
|
|
|
void Add(TargetPhrase *targetPhrase, const Phrase &sourcePhrase);
|
2008-06-11 14:52:57 +04:00
|
|
|
};
|
|
|
|
|
2013-09-27 12:35:24 +04:00
|
|
|
struct CompareTargetPhrase {
|
2013-09-25 03:07:18 +04:00
|
|
|
bool operator() (const TargetPhrase *a, const TargetPhrase *b) const;
|
|
|
|
bool operator() (const TargetPhrase &a, const TargetPhrase &b) const;
|
|
|
|
};
|
|
|
|
|
2008-10-09 03:51:26 +04:00
|
|
|
}
|
|
|
|
|
2010-02-24 14:15:44 +03:00
|
|
|
#endif
|