Welcome to mirror list, hosted at ThFree Co, Russian Federation.

ug_im_ttrack.h « mm « UG « TranslationModel « moses - github.com/moses-smt/mosesdecoder.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
blob: 05066c922f5bd8433ab28e7280f851b01d915ab4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
// -*- c++ -*-
// In-memory corpus track
// (c) 2006-2012 Ulrich Germann. 

#ifndef __ug_im_ttrack
#define __ug_im_ttrack

#include <string>
#include <iostream>

#include <boost/shared_ptr.hpp>
#include <boost/unordered_map.hpp>
#include <boost/foreach.hpp>

#include "tpt_typedefs.h"
#include "tpt_tokenindex.h"
#include "ug_ttrack_base.h"
#include "tpt_tokenindex.h"
// #include "ug_vocab.h"

// define the corpus buffer size (in sentences) and the
// for adding additional sentences:
#define IMTTRACK_INCREMENT_SIZE 100000
#define IMTSA_INCREMENT_SIZE   1000000

namespace ugdiss
{
  using namespace std;
  using namespace boost;
  namespace bio=boost::iostreams;

  template<typename Token> class imTSA;
  template<typename Token> class imTtrack;

  template<typename TOKEN>
  typename boost::shared_ptr<imTtrack<TOKEN> > 
  append(typename boost::shared_ptr<imTtrack<TOKEN> > const &  crp, vector<TOKEN> const & snt);

  template<typename Token>
  class imTtrack : public Ttrack<Token>
  {
    
  private:
    size_t numToks;
    boost::shared_ptr<vector<vector<Token> > > myData;  // pointer to corpus data
    friend class imTSA<Token>;

    friend 
    typename boost::shared_ptr<imTtrack<Token> > 
    append<Token>(typename boost::shared_ptr<imTtrack<Token> > const & crp, vector<Token> const & snt);

  public:

    imTtrack(boost::shared_ptr<vector<vector<Token> > > const& d);
    imTtrack(istream& in, TokenIndex const& V, ostream* log);
    imTtrack(size_t reserve = 0);
    // imTtrack(istream& in, Vocab& V);
    
    /** return pointer to beginning of sentence */
    Token const* sntStart(size_t sid) const; 

    /** return pointer to beginning of sentence */
    Token const* sntEnd(size_t sid) const;   

    size_t size() const; 
    size_t numTokens() const;

    id_type findSid(Token const* t) const;

  };

  template<typename Token>
  Token const* 
  imTtrack<Token>::
  sntStart(size_t sid) const // return pointer to beginning of sentence
  {
    assert(sid < size());
    if ((*myData)[sid].size() == 0) return NULL;
    return &((*myData)[sid].front());
  }
  
  template<typename Token>
  Token const* 
  imTtrack<Token>::
  sntEnd(size_t sid) const // return pointer to end of sentence
  {
    assert(sid < size());
    if ((*myData)[sid].size() == 0) return NULL;
    return &(*myData)[sid].back()+1;
  }
  
  template<typename Token>
  size_t 
  imTtrack<Token>::
  size() const // return size of corpus (in number of sentences)
  {
    // we assume that myIndex has pointers to both the beginning of the
    // first sentence and the end point of the last, so there's one more
    // offset in the myIndex than there are sentences
    return myData->size();
  }
  
  template<typename Token>
  size_t 
  imTtrack<Token>::
  numTokens() const // return size of corpus (in number of words)
  {
    return numToks;
  }
  
  template<typename Token>
  imTtrack<Token>::
  imTtrack(istream& in, TokenIndex const& V, ostream* log = NULL)
  {
    myData.reset(new vector<vector<Token> >());
    numToks = 0;
    string line,w;
    size_t linectr=0;
    boost::unordered_map<string,id_type> H;
    for (id_type i = 0; i < V.knownVocabSize(); ++i)
      H[V[i]] = i;
    while (getline(in,line)) 
      {
	myData->push_back(vector<Token>());
	if (log && ++linectr%1000000==0) 
	  *log << linectr/1000000 << "M lines of input processed" << endl;
	istringstream buf(line);
	while (buf>>w) 
	  myData->back().push_back(Token(H[w]));
	myData->back().resize(myData.back().size());
	numToks += myData->back().size();
      }
  }
  
  template<typename Token>
  imTtrack<Token>::
  imTtrack(size_t reserve)
  {
    myData.reset(new vector<vector<Token> >());
    if (reserve) myData->reserve(reserve);
  }

  template<typename Token>
  imTtrack<Token>::
  imTtrack(boost::shared_ptr<vector<vector<Token> > > const& d)
  {
    myData  = d;
    numToks = 0;
    BOOST_FOREACH(vector<Token> const& v, *d)
      numToks += v.size();
  }
  
  template<typename Token>
  id_type
  imTtrack<Token>::
  findSid(Token const* t) const
  {
    id_type i;
    for (i = 0; i < myData->size(); ++i)
      {
	vector<Token> const& v = (*myData)[i];
	if (v.size() == 0) continue;
	if (&v.front() <= t && &v.back() >= t) 
	  break;
      }
    return i;
  }

  /// add a sentence to the database
  template<typename TOKEN>
  shared_ptr<imTtrack<TOKEN> > 
  append(shared_ptr<imTtrack<TOKEN> > const& crp, vector<TOKEN> const & snt)
  {
    shared_ptr<imTtrack<TOKEN> > ret;
    if (crp == NULL)
      {
  	ret.reset(new imTtrack<TOKEN>());
	ret->myData->reserve(IMTTRACK_INCREMENT_SIZE);
      }
    else if (crp->myData->capacity() == crp->size())
      {
  	ret.reset(new imTtrack<TOKEN>());
	ret->myData->reserve(crp->size() + IMTTRACK_INCREMENT_SIZE);
	copy(crp->myData->begin(),crp->myData->end(),ret->myData->begin());
      }
    else ret = crp;
    ret->myData->push_back(snt);
    return ret;
  }

}
#endif