-
Notifications
You must be signed in to change notification settings - Fork 17
Expand file tree
/
Copy pathScoringContext.cc
More file actions
171 lines (141 loc) · 4.87 KB
/
Copy pathScoringContext.cc
File metadata and controls
171 lines (141 loc) · 4.87 KB
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
/** Copyright 2024 RWTH Aachen University. All rights reserved.
*
* Licensed under the RWTH ASR License (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.hltpr.rwth-aachen.de/rwth-asr/rwth-asr-license.html
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include "ScoringContext.hh"
#include <Core/MurmurHash.hh>
namespace Nn {
typedef Mm::EmissionIndex LabelIndex;
/*
* =============================
* ====== ScoringContext =======
* =============================
*/
size_t ScoringContext::hash() const {
return 0ul;
}
bool ScoringContext::isEqual(ScoringContextRef const& other) const {
return true;
}
/*
* =============================
* === CombineScoringContext ===
* =============================
*/
size_t CombineScoringContext::hash() const {
size_t value = 0ul;
for (auto const& scoringContext : scoringContexts) {
value = Core::combineHashes(value, scoringContext->hash());
}
return value;
}
bool CombineScoringContext::isEqual(ScoringContextRef const& other) const {
auto* otherPtr = dynamic_cast<CombineScoringContext const*>(other.get());
if (otherPtr == nullptr or scoringContexts.size() != otherPtr->scoringContexts.size()) {
return false;
}
for (auto it_l = scoringContexts.begin(), it_r = otherPtr->scoringContexts.begin(); it_l != scoringContexts.end(); ++it_l, ++it_r) {
if (!(*it_l)->isEqual(*it_r)) {
return false;
}
}
return true;
}
/*
* =============================
* ==== StepScoringContext =====
* =============================
*/
size_t StepScoringContext::hash() const {
return currentStep;
}
bool StepScoringContext::isEqual(ScoringContextRef const& other) const {
StepScoringContext const* o = dynamic_cast<StepScoringContext const*>(other.get());
return o != nullptr and currentStep == o->currentStep;
}
/*
* =============================
* === SeqStepScoringContext ===
* =============================
*/
size_t SeqStepScoringContext::hash() const {
return Core::combineHashes(currentStep, Core::MurmurHash3_x64_64(reinterpret_cast<void const*>(labelSeq.data()), labelSeq.size() * sizeof(LabelIndex), 0x78b174eb));
}
bool SeqStepScoringContext::isEqual(ScoringContextRef const& other) const {
auto* otherPtr = dynamic_cast<SeqStepScoringContext const*>(other.get());
if (otherPtr == nullptr) {
return false;
}
if (currentStep != otherPtr->currentStep) {
return false;
}
if (labelSeq.size() != otherPtr->labelSeq.size()) {
return false;
}
for (auto it_l = labelSeq.begin(), it_r = otherPtr->labelSeq.begin(); it_l != labelSeq.end(); ++it_l, ++it_r) {
if (*it_l != *it_r) {
return false;
}
}
return true;
}
/*
* =================================
* = OnnxHiddenStateScoringContext =
* =================================
*/
size_t OnnxHiddenStateScoringContext::hash() const {
return Core::MurmurHash3_x64_64(reinterpret_cast<void const*>(labelSeq.data()), labelSeq.size() * sizeof(LabelIndex), 0x78b174eb);
}
bool OnnxHiddenStateScoringContext::isEqual(ScoringContextRef const& other) const {
auto* otherPtr = dynamic_cast<OnnxHiddenStateScoringContext const*>(other.get());
if (otherPtr == nullptr) {
return false;
}
if (labelSeq.size() != otherPtr->labelSeq.size()) {
return false;
}
for (auto it_l = labelSeq.begin(), it_r = otherPtr->labelSeq.begin(); it_l != labelSeq.end(); ++it_l, ++it_r) {
if (*it_l != *it_r) {
return false;
}
}
return true;
}
/*
* =====================================
* = StepOnnxHiddenStateScoringContext =
* =====================================
*/
size_t StepOnnxHiddenStateScoringContext::hash() const {
return Core::combineHashes(currentStep, Core::MurmurHash3_x64_64(reinterpret_cast<void const*>(labelSeq.data()), labelSeq.size() * sizeof(LabelIndex), 0x78b174eb));
}
bool StepOnnxHiddenStateScoringContext::isEqual(ScoringContextRef const& other) const {
auto* otherPtr = dynamic_cast<const StepOnnxHiddenStateScoringContext*>(other.get());
if (otherPtr == nullptr) {
return false;
}
if (currentStep != otherPtr->currentStep) {
return false;
}
if (labelSeq.size() != otherPtr->labelSeq.size()) {
return false;
}
for (auto it_l = labelSeq.begin(), it_r = otherPtr->labelSeq.begin(); it_l != labelSeq.end(); ++it_l, ++it_r) {
if (*it_l != *it_r) {
return false;
}
}
return true;
}
} // namespace Nn