mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-09-20 07:42:21 +03:00
74 lines
1.7 KiB
C++
74 lines
1.7 KiB
C++
#ifndef moses_DynSuffixArray_h
|
|
#define moses_DynSuffixArray_h
|
|
|
|
#include <vector>
|
|
#include <set>
|
|
#include <algorithm>
|
|
#include <utility>
|
|
#include "moses/Util.h"
|
|
#include "moses/File.h"
|
|
#include "moses/TranslationModel/DynSAInclude/types.h"
|
|
|
|
namespace Moses
|
|
{
|
|
using namespace std;
|
|
typedef std::vector<unsigned> vuint_t;
|
|
|
|
|
|
/// compare position /i/ in the suffix array /m_sfa/ into corpus /m_crp/
|
|
/// against reference phrase /phrase/
|
|
// added by Ulrich Germann
|
|
class ComparePosition
|
|
{
|
|
vuint_t const& m_crp;
|
|
vuint_t const& m_sfa;
|
|
|
|
public:
|
|
ComparePosition(vuint_t const& crp, vuint_t const& sfa);
|
|
bool operator()(unsigned const& i, vector<wordID_t> const& phrase) const;
|
|
bool operator()(vector<wordID_t> const& phrase, unsigned const& i) const;
|
|
};
|
|
|
|
|
|
/** @todo ask Abbey Levenberg
|
|
*/
|
|
class DynSuffixArray
|
|
{
|
|
|
|
public:
|
|
DynSuffixArray();
|
|
DynSuffixArray(vuint_t*);
|
|
~DynSuffixArray();
|
|
bool GetCorpusIndex(const vuint_t*, vuint_t*);
|
|
void Load(FILE*);
|
|
void Save(FILE*);
|
|
void Insert(vuint_t*, unsigned);
|
|
void Delete(unsigned, unsigned);
|
|
void Substitute(vuint_t*, unsigned);
|
|
|
|
size_t GetCount(vuint_t const& phrase) const;
|
|
|
|
private:
|
|
vuint_t* m_SA;
|
|
vuint_t* m_ISA;
|
|
vuint_t* m_F;
|
|
vuint_t* m_L;
|
|
vuint_t* m_corpus;
|
|
void BuildAuxArrays();
|
|
void Qsort(int* array, int begin, int end);
|
|
int Compare(int, int, int);
|
|
void Reorder(unsigned, unsigned);
|
|
int LastFirstFunc(unsigned);
|
|
int Rank(unsigned, unsigned);
|
|
int F_firstIdx(unsigned);
|
|
void PrintAuxArrays() {
|
|
std::cerr << "SA\tISA\tF\tL\n";
|
|
for(size_t i=0; i < m_SA->size(); ++i)
|
|
std::cerr << m_SA->at(i) << "\t" << m_ISA->at(i) << "\t"
|
|
<< m_F->at(i) << "\t" << m_L->at(i) << std::endl;
|
|
}
|
|
};
|
|
} //end namespace
|
|
|
|
#endif
|