-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsubstring_automaton.clj
263 lines (181 loc) · 6.03 KB
/
substring_automaton.clj
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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
(ns substring-automaton
(:require [tech.v3.datatype.functional :as f]
[tech.v3.datatype :as dtype]
[tech.v3.tensor :as dtt]
[tech.v3.datatype.bitmap :as bitmap]
[fastmath.random :as fm.rand]
[fastmath.core :as fm]
[bennischwerdtner.hd.binary-sparse-segmented :as
hd]
[tech.v3.datatype.unary-pred :as unary-pred]
[tech.v3.datatype.argops :as dtype-argops]
[bennischwerdtner.hd.data :as hdd]))
;; I didn't make this work yet
;; Using a nonderministic finte-state automaton for substring search
;; --------------------------------------------------------------------
;;
;; - each position of a symbol in the base string is modeled as a unique state of the automaton S
;; - hello generates an automaton with 6 states
;; - transitions are the base string symbols {b1,b2,...,bn}
(def base-string "hello")
;; (def )
(def automaton
;; has unique state for each position
;; then position-1 ⊙ symbol -> position-2
;;
;; So you can see that you
;;
(hdd/finite-state-automaton-1
(for [[n symbol] (map-indexed vector base-string)]
(hdd/clj->vsa* [n symbol (inc n)]))))
(hdd/cleanup*
(hdd/automaton-destination
automaton
(hdd/clj->vsa* 0)
(hdd/clj->vsa* \h)))
'(1)
(def q "hel")
(hdd/cleanup*
(hdd/automaton-destination
automaton
(hdd/clj->vsa* (into #{} (range (count base-string))))
(hdd/clj->vsa* \e)))
'(2)
(hdd/cleanup*
(let [p
(hdd/automaton-destination
automaton
(hdd/clj->vsa*
(into #{} (range (count base-string))))
(hdd/clj->vsa* \e))
p (some->
(hdd/cleanup p)
(hdd/clj->vsa))
]
(hdd/automaton-destination
automaton
p
(hdd/clj->vsa* \l))))
(hdd/automaton-destination
(hdd/finite-state-automaton-1
[(hdd/clj->vsa* [0 \a 1])])
(hdd/clj->vsa* 0)
(hdd/clj->vsa* \a))
(let
[base-string (map char (range (int \a) (inc (int \z))))
automaton (hdd/finite-state-automaton-1
(for [[n symbol]
(map-indexed vector base-string)]
(hdd/clj->vsa* [n symbol (inc n)])))]
(hdd/cleanup-verbose
(hdd/automaton-destination
automaton
(hdd/clj->vsa* (into #{} (range 10)))
(hdd/clj->vsa* \a)))
;; (hdd/cleanup*
;; (hdd/automaton-destination
;; (hdd/finite-state-automaton-1
;; [(hdd/clj->vsa* [0 \a 1])])
;; ;; automaton
;; (hdd/clj->vsa* (into #{} (range 5)))
;; (hdd/clj->vsa* \a)))
)
(let [x (hd/unbind
(hdd/intersection
[(hdd/clj->vsa* (into
{}
(map-indexed vector)
"abc"
;; (map char (range
;; (int \a)
;; (inc
;; (int
;; \z))))
))
(hdd/clj->vsa*
(into {} (map-indexed vector) "abc"))])
(hdd/clj->vsa* (into #{} "abc")))]
(map (fn [i] (hd/similarity x (hdd/clj->vsa* i)))
(range 5)))
'(0.5 0.45 0.05 0.0 0.0)
;; (0 1)
1.0
(f/sum (hdd/clj->vsa* 0))
(hd/similarity (hdd/clj->vsa* 0) (hdd/clj->vsa* 0))
(into #{} (range 5))
(=
(hdd/clj->vsa* (into #{} (range 5)))
(hdd/clj->vsa* #{0 1 2}))
(let
[base-string "abcde"
;; (map char (range (int \a) (inc (int \z))))
automaton
;; state0 ⊙ a -> state1
(hdd/finite-state-automaton-1
(for [[n symbol] (map-indexed vector base-string)]
(hdd/clj->vsa* [n symbol (inc n)])))
query-string "abc"]
(reduce
(fn [state query]
(cond (not query) (ensure-reduced state)
(not state) (ensure-reduced false)
:else (some-> (hdd/automaton-destination
automaton
state
query)
;; cleaning up at each
;; step like they also
;; do in the paper such
;; a thing can be done
;; with a resonator
;; network
hdd/cleanup
hdd/clj->vsa)))
;;
;; in the paper,
;; the initial state is the superposition of all
;; states for the base-string
;;
;; but here, the signal noise ration isn't capable of handling this,
;; so I first search through chunks of the atomaton for a start state
;;
;;
;;
#_(hdd/clj->vsa* (into #{} (range (count base-string))))
;; wip
(recur [state
query (first (hdd/clj->vsa* (into [] query-string)))]
)
(hdd/clj->vsa* (into #{} (range (count base-string))))
(some-> (hdd/automaton-destination
automaton
state
query)
;; cleaning up at each
;; step like they also
;; do in the paper such
;; a thing can be done
;; with a resonator
;; network
hdd/cleanup
hdd/clj->vsa)
;; hypersymbols for the query string
(hdd/clj->vsa* (into [] query-string))))
(hdd/cleanup*
(let [base-string "abc"
;; (map char (range (int \a) (inc (int \z))))
automaton
;; state0 ⊙ a -> state1
(hdd/finite-state-automaton-1
(for [[n symbol] (map-indexed vector
base-string)]
(hdd/clj->vsa* [n symbol (inc n)])))
query-string "a"]
(reduce (fn [state query]
(hdd/automaton-destination automaton
state
query))
;; initial generalized state
(hdd/clj->vsa* (into #{} (range (count base-string))))
;; hypersymbols for the query string
(hdd/clj->vsa* (into [] query-string)))))