-
Notifications
You must be signed in to change notification settings - Fork 16
Expand file tree
/
Copy pathutils.py
More file actions
210 lines (163 loc) · 5.8 KB
/
utils.py
File metadata and controls
210 lines (163 loc) · 5.8 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
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
import sys
import numpy as np
import random
import pickle
import nltk
import scipy.sparse as spa
from sklearn.feature_extraction import FeatureHasher
import sklearn.feature_extraction._hashing as hasher
class Policy(object):
def predict(self, data, sequence, i):
raise NotImplementedError()
class ExpPolicy(Policy):
def __init__(self, oracle, ppolicy, blend):
self.oracle = oracle
self.ppolicy = ppolicy
self.blend = blend
def predict(self, feats, y):
if random.random() < self.blend:
return y
return self.ppolicy.predict(feats)
class Processor(object):
def __init__(self, classes, previous=1, following=1,
features=15000, prefix=(), affix=(),
hashes=1, stem=True, ohe=True):
self.hashes = hashes
self.previous = previous
self.following = following
self.prefix = prefix
self.affix = affix
self.stem = stem
self.es = nltk.stem.snowball.EnglishStemmer()
self.features = features
self.fh = FeatureHasher(features, input_type='string', dtype='float32')
self.labels = list(classes)
self.classes = {c: i for i, c in enumerate(self.labels)}
self.tlabels = {i: c for c, i in self.classes.items()}
self.n_classes = len(classes)
self._nident = np.identity(self.n_classes, 'float32')
self.to_ohe = ohe
def ohe(self, y):
return self._nident[self.classes[y]]
def _get_feat(self, prefix, f):
feat = f['feature']
ret = [prefix % feat]
if self.stem:
stem = self.es.stem(feat)
ret.append('s' + prefix % stem)
pprefix = 'p_' + prefix
for s in self.prefix:
ret.append(pprefix % feat[:s])
affix = 'a_' + prefix
for s in self.prefix:
ret.append(affix % feat[-s:])
return ret
def transform(self, sequence, trad, idx, verbose=False):
features = self.state(sequence, trad, idx)
if verbose:
print(features)
#return self.fh.transform(features)
return self._hash(features)
def _hash(self, features):
indices, indptr, values = \
hasher.transform([[(x,1) for x in features]], self.features, 'float32')
X = spa.csr_matrix((values, indices, indptr), dtype='float32',
shape=(1, self.features))
X.sum_duplicates()
return X
def state(self, Xs, trad, idx):
features = []
# Print previous featues
start = {'feature': '_START_'}
for i, pidx in enumerate(range(idx - self.previous, idx)):
if pidx < 0:
f, o = start, 'None'
else:
f, o = Xs[pidx], trad[pidx]
features.extend(self._get_feat('p_feat_%s:%%s' % i, f))
features.append('p_pred_%s:%s' % (i, o))
# Print following featues
until = idx + self.following + 1
for i, fidx in enumerate(range(idx + 1, until)):
f = {'feature': "_END_"} if fidx >= len(Xs) else Xs[fidx]
features.extend(self._get_feat('f_feat_%s:%%s' % i, f))
# Print current features
features.extend(self._get_feat('feat:%s', Xs[idx]))
if self.hashes > 1:
nhashes = features[:]
for i in range(1, self.hashes):
p = '!' * i
nhashes.extend(p+s for s in features)
hashes = nhashes
return features
def encode_target(self, ys, idx):
y = ys[idx]
if self.to_ohe:
return self.ohe(y)
return [self.classes[y]]
class Sequencer(object):
def __init__(self, processor, policy):
self.processor = processor
self.policy = policy
def classify(self, sequence, raw=False):
outputs = []
for i in range(len(sequence)):
outputs.append(self._partial_pred(sequence, outputs, i))
if raw:
return [self.processor.classes[o] for o in outputs]
return outputs
def _partial_pred(self, features, trad, i):
feats = self.processor.transform(features, trad, i)
output = self.policy.predict(feats)
return self.processor.tlabels[output[0]]
def readDataset(fn):
if fn == '-':
f = sys.stdin
else:
f = open(fn)
def run(f):
sequences = []
classes = set()
sequence = []
for line in f:
line = line.strip()
if line:
pieces = line.split()
feature, output = '/'.join(pieces[:-1]), pieces[-1]
classes.add(output)
sequence.append(dict(feature=feature, output=output))
elif sequence:
sequences.append(sequence)
sequence = []
if sequence:
sequences.append(sequence)
return sequences, classes
try:
return run(f)
finally:
if f != '-':
f.close()
def save(path, obj):
with open(path, 'wb') as outFile:
pickle.dump(obj, outFile)
def load(path):
with open(path) as f:
return pickle.load(f)
def test(Xss, yss, test_idx, seq):
y_true, y_pred = [], []
nerrors = 0.0
perrs = 0.0
for idx in test_idx:
y_true.extend(y for ys in yss[idx] for y in ys)
preds = seq.classify(Xss[idx], raw=True)
# Calculate errors per sequence
errors = sum(y[0] != t for y, t in zip(yss[idx], preds))
if errors > 0:
nerrors += 1
perrs += errors
y_pred.extend(preds)
print("Phrases with errors:", nerrors)
print("Total Errors:", perrs)
print("Errors per bad seq:", perrs / nerrors if nerrors else 0, nerrors)
print("Phrase Accuracy:", (len(test_idx) - nerrors) / len(test_idx))
return y_true, y_pred