Blame view

src/nnet3/nnet-example.cc 5.74 KB
8dcb6dfcb   Yannick Estève   first commit
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
  // nnet3/nnet-example.cc
  
  // Copyright 2012-2015    Johns Hopkins University (author: Daniel Povey)
  //                2014    Vimal Manohar
  
  // See ../../COPYING for clarification regarding multiple authors
  //
  // Licensed under the Apache License, Version 2.0 (the "License");
  // you may not use this file except in compliance with the License.
  // You may obtain a copy of the License at
  //
  //  http://www.apache.org/licenses/LICENSE-2.0
  //
  // THIS CODE IS PROVIDED *AS IS* BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
  // KIND, EITHER EXPRESS OR IMPLIED, INCLUDING WITHOUT LIMITATION ANY IMPLIED
  // WARRANTIES OR CONDITIONS OF TITLE, FITNESS FOR A PARTICULAR PURPOSE,
  // MERCHANTABLITY OR NON-INFRINGEMENT.
  // See the Apache 2 License for the specific language governing permissions and
  // limitations under the License.
  
  #include "nnet3/nnet-example.h"
  #include "lat/lattice-functions.h"
  #include "hmm/posterior.h"
  
  namespace kaldi {
  namespace nnet3 {
  
  void NnetIo::Write(std::ostream &os, bool binary) const {
    KALDI_ASSERT(features.NumRows() == static_cast<int32>(indexes.size()));
    WriteToken(os, binary, "<NnetIo>");
    WriteToken(os, binary, name);
    WriteIndexVector(os, binary, indexes);
    features.Write(os, binary);
    WriteToken(os, binary, "</NnetIo>");
    KALDI_ASSERT(static_cast<size_t>(features.NumRows()) == indexes.size());
  }
  
  void NnetIo::Read(std::istream &is, bool binary) {
    ExpectToken(is, binary, "<NnetIo>");
    ReadToken(is, binary, &name);
    ReadIndexVector(is, binary, &indexes);
    features.Read(is, binary);
    ExpectToken(is, binary, "</NnetIo>");
  }
  
  bool NnetIo::operator == (const NnetIo &other) const {
    if (name != other.name) return false;
    if (indexes != other.indexes) return false;
    if (features.NumRows() != other.features.NumRows() ||
        features.NumCols() != other.features.NumCols())
      return false;
    Matrix<BaseFloat> this_mat, other_mat;
    features.GetMatrix(&this_mat);
    other.features.GetMatrix(&other_mat);
    return ApproxEqual(this_mat, other_mat);
  }
  
  NnetIo::NnetIo(const std::string &name,
                 int32 t_begin, const MatrixBase<BaseFloat> &feats,
                 int32 t_stride):
      name(name), features(feats) {
    int32 num_rows = feats.NumRows();
    KALDI_ASSERT(num_rows > 0);
    indexes.resize(num_rows);  // sets all n,t,x to zeros.
    for (int32 i = 0; i < num_rows; i++)
      indexes[i].t = t_begin + i * t_stride;
  }
  
  NnetIo::NnetIo(const std::string &name,
                 int32 t_begin, const GeneralMatrix &feats,
                 int32 t_stride):
      name(name), features(feats) {
    int32 num_rows = feats.NumRows();
    KALDI_ASSERT(num_rows > 0);
    indexes.resize(num_rows);  // sets all n,t,x to zeros.
    for (int32 i = 0; i < num_rows; i++)
      indexes[i].t = t_begin + i * t_stride;
  }
  
  void NnetIo::Swap(NnetIo *other) {
    name.swap(other->name);
    indexes.swap(other->indexes);
    features.Swap(&(other->features));
  }
  
  NnetIo::NnetIo(const std::string &name,
                 int32 dim,
                 int32 t_begin,
                 const Posterior &labels,
                 int32 t_stride):
      name(name) {
    int32 num_rows = labels.size();
    KALDI_ASSERT(num_rows > 0);
    SparseMatrix<BaseFloat> sparse_feats(dim, labels);
    features = sparse_feats;
    indexes.resize(num_rows);  // sets all n,t,x to zeros.
    for (int32 i = 0; i < num_rows; i++)
      indexes[i].t = t_begin + i * t_stride;
  }
  
  
  
  void NnetExample::Write(std::ostream &os, bool binary) const {
    // Note: weight, label, input_frames and spk_info are members.  This is a
    // struct.
    WriteToken(os, binary, "<Nnet3Eg>");
    WriteToken(os, binary, "<NumIo>");
    int32 size = io.size();
    KALDI_ASSERT(size > 0 && "Writing empty nnet example");
    WriteBasicType(os, binary, size);
    for (int32 i = 0; i < size; i++)
      io[i].Write(os, binary);
    WriteToken(os, binary, "</Nnet3Eg>");
  }
  
  void NnetExample::Read(std::istream &is, bool binary) {
    ExpectToken(is, binary, "<Nnet3Eg>");
    ExpectToken(is, binary, "<NumIo>");
    int32 size;
    ReadBasicType(is, binary, &size);
    if (size <= 0 || size > 1000000)
      KALDI_ERR << "Invalid size " << size;
    io.resize(size);
    for (int32 i = 0; i < size; i++)
      io[i].Read(is, binary);
    ExpectToken(is, binary, "</Nnet3Eg>");
  }
  
  
  void NnetExample::Compress() {
    std::vector<NnetIo>::iterator iter = io.begin(), end = io.end();
    // calling features.Compress() will do nothing if they are sparse or already
    // compressed.
    for (; iter != end; ++iter)
      iter->features.Compress();
  }
  
  
  size_t NnetIoStructureHasher::operator () (
      const NnetIo &io) const noexcept {
    StringHasher string_hasher;
    IndexVectorHasher indexes_hasher;
  
    // numbers appearing here were taken at random from a list of primes.
    size_t ans = string_hasher(io.name) +
        indexes_hasher(io.indexes) +
        19249  * io.features.NumRows() +
        14731 * io.features.NumCols();
    return ans;
  }
  
  
  bool NnetIoStructureCompare::operator () (
      const NnetIo &a, const NnetIo &b) const {
    return a.name == b.name &&
        a.features.NumRows() == b.features.NumRows() &&
        a.features.NumCols() == b.features.NumCols() &&
        a.indexes == b.indexes;
  }
  
  
  size_t NnetExampleStructureHasher::operator () (
      const NnetExample &eg) const noexcept {
    // these numbers were chosen at random from a list of primes.
    NnetIoStructureHasher io_hasher;
    size_t size = eg.io.size(), ans = size * 35099;
    for (size_t i = 0; i < size; i++)
      ans = ans * 19157 + io_hasher(eg.io[i]);
    return ans;
  }
  
  bool NnetExampleStructureCompare::operator () (const NnetExample &a,
                                                 const NnetExample &b) const {
    NnetIoStructureCompare io_compare;
    if (a.io.size() != b.io.size())
      return false;
    size_t size = a.io.size();
    for (size_t i = 0; i < size; i++)
      if (!io_compare(a.io[i], b.io[i]))
        return false;
    return true;
  }
  
  
  
  } // namespace nnet3
  } // namespace kaldi