/
translator.clj
244 lines (210 loc) · 8.11 KB
/
translator.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
(ns decloder.translator
(:require clojure.string)
(:require clojure.java.io)
(:import [java.io BufferedReader FileReader])
(:require clojure.data.priority-map)
(:require decloder.blm)
)
;; GLOBALS
(def MAX_HYPO_PER_STACK 100)
;; UTILS
(defrecord Hypothesis [token, score, pred])
;; FUNCTIONS
(defn score-hypothesis [model trg-token lex-prob pred-hypo]
{:pre [(string? trg-token)
(= java.lang.Double (type lex-prob))
(>= lex-prob 0)
(or (nil? pred-hypo) (= decloder.translator.Hypothesis (type pred-hypo)))]
:post [(>= % 0) (>= % lex-prob)]}
(if (nil? pred-hypo)
lex-prob
(let [bi-gram (str (:token pred-hypo) " " trg-token)]
(if (nil? (:pred pred-hypo))
(let [lm-score (decloder.blm/score-ngrams (model :lm) bi-gram)]
;(println "bi-gram to score: " bi-gram " -> " lm-score)
(+ lex-prob (* 0.5 (:score pred-hypo)) (* 0.1 lm-score))
)
(let [tri-gram (str (:token (:pred pred-hypo)) " " bi-gram)
lm-score (decloder.blm/score-ngrams (model :lm) tri-gram)]
;(println "tri-gram to score: " tri-gram " -> " lm-score)
(+ lex-prob (* 0.5 (:score pred-hypo)) (* 0.1 lm-score))
)
)
)
)
)
(defn new-hypo [model stack lex-prob]
{:pre [(map? stack)
(= clojure.lang.MapEntry (type lex-prob))]
:post [(map? %)
(>= (count %) (count stack))]}
(let [trg-token-id (key lex-prob)
trg-token ((model :voc-id-trg) trg-token-id)
lexical-prob (val lex-prob)
pred (Hypothesis. nil 0 nil)
score (score-hypothesis model trg-token lexical-prob pred)]
(assoc stack (Hypothesis. trg-token score pred) score)
)
)
(defn extend-hypo [model stack top-hypo src-token]
{:pre [(map? model)
(map? stack)
(or (nil? top-hypo) (= decloder.translator.Hypothesis (type top-hypo)))
(= java.lang.String (type src-token))]
:post [(map? %)
(>= (count %) (count stack))]}
(let [src-token-id ((model :voc-src-id) src-token)]
(loop [stack_ stack
lex-probs ((model :lex-prob) src-token-id)
];tata (println "count lex-probs" (count lex-probs))]
(if (empty? lex-probs)
stack_
(let [lex-prob (first lex-probs)
trg-token-id (key lex-prob)
lexical-prob (val lex-prob)
trg-token ((model :voc-id-trg) trg-token-id)
score (score-hypothesis model trg-token lexical-prob top-hypo)]
(recur (assoc stack_ (Hypothesis. trg-token score top-hypo) score) (rest lex-probs))
)
)
)
)
)
(defn count-stacks [stacks]
(loop [stacks_ stacks
msg ""]
(if (empty? stacks_)
msg
(let [first-key (first (sort (keys stacks_)))
stack (stacks first-key)
msg (str msg " " first-key ":" (count stack))]
(recur (dissoc stacks_ first-key) msg)
)
)
)
)
(defn search [model src-sentence]
(loop [src-sentence_ src-sentence
pos 0
stacks {}]
(let [src-token (first src-sentence_)
src-token-id ((model :voc-src-id) src-token)]
(println "Main loop, pos " pos ", src-token " src-token ", count(stacks) " (count-stacks stacks) "(count src-sentence) " (count src-sentence))
(if (nil? (stacks pos))
(recur src-sentence_ pos (assoc stacks pos (clojure.data.priority-map/priority-map)))
(if (>= pos (count src-sentence))
stacks
(if (nil? src-token)
(recur (rest src-sentence_) (+ pos 1) stacks)
(if (= 0 (count ((model :lex-prob) src-token-id)))
(recur (rest src-sentence_) (+ pos 1) stacks)
(if (= pos 0)
(let [hypos ((model :lex-prob) src-token-id)
;hypos (filter #(= (first (key %)) src-token) (model :lex-prob))
;titi (println "(count hypos) " (count hypos))
stack_ (reduce (partial new-hypo model) (stacks 0) hypos)
];tata (println "(count stack_) " (count stack_))]
(recur (rest src-sentence_) (+ pos 1) (assoc stacks 0 stack_)))
(recur (rest src-sentence_) (+ pos 1)
(loop [stacks_ stacks
cur-stack (stacks_ pos)
;titi (println "count cur-stack " (count cur-stack))
prev-stack-pos 1
prev-stack (stacks_ (- pos prev-stack-pos))
];titi (println "count prev-stack " (count prev-stack))]
(if (and (not (nil? prev-stack)) (= 0 (count prev-stack)))
(let [prev-stack-pos_ (+ 1 prev-stack-pos)
prev-stack_ (stacks_ (- pos prev-stack-pos_))
];tit (println "count prev-stack " (count prev-stack_))
;toto (println "recur prev-stack 0")]
(recur stacks_ cur-stack prev-stack-pos_ prev-stack_)
)
(if (< (count cur-stack) MAX_HYPO_PER_STACK)
(let [toto (println "recur cur-stack > 0, count2 " (count cur-stack))
top-hypo (if (nil? prev-stack) nil (key (first prev-stack)))
cur-stack_ (extend-hypo model cur-stack top-hypo src-token)
tata (println "count3 " (count cur-stack_))]
(recur (assoc stacks_ pos cur-stack_)
cur-stack_
prev-stack-pos
(rest prev-stack))
)
stacks_
)
)
)
)
)
)
)
)
)
)
)
)
(defn extract-best-path [graph]
(let [nb-stacks (count graph)]
(loop [cpt (- nb-stacks 1)]
(let [cur-stack (graph cpt)]
(if (= 0 (count cur-stack))
(recur (- cpt 1))
(loop [hypo (key (first cur-stack))
best-path []]
(if (nil? (:pred hypo))
best-path
(do
;(println "c" best-path)
;(println "d" hypo)
(recur (:pred hypo) (concat [(:token hypo)] best-path))
)
)
)
)
)
)
)
)
(defn tokenize-sentence [s]
(map clojure.string/lower-case
(clojure.string/split s #" ")
)
)
(defn tokens-to-ids [model s]
(let [voc-src (model :voc-src-id)]
(map #(voc-src %) s)
)
)
(defn ids-to-tokens [inv-voc-trg ids]
(map #(inv-voc-trg %) ids)
)
(defn filter-src-lex-probs [model sent-tok-ids]
(println "Filtering lexical probabilities")
(loop [tokens sent-tok-ids
new-lex-probs {}]
(if (empty? tokens)
(do
(println (count new-lex-probs) " lex probs remaining.")
(assoc model :lex-prob new-lex-probs))
(let [fil (filter #(= (first (key %)) (first tokens)) (model :lex-prob))]
(println "Filtered " (count fil) " lex probs.")
(recur (rest tokens) (merge new-lex-probs fil))
)
)
)
)
(defn translate-sentence [model sentence]
(println "Translating: " sentence)
(let [sent-tok (tokenize-sentence sentence)
];sent-tok-id (tokens-to-ids model sent-tok)]
(println "Tokenized: " sent-tok)
;(println "Ids: " sent-tok-id)
(let [;model (filter-src-lex-probs model sent-tok-id)
graph (search model sent-tok)
best-path (extract-best-path graph)
;inv-voc-trg (reduce #(assoc %1 (val %2) (key %2)) {} (model :voc-trg))
];tt (println (take 10 inv-voc-trg))]
(println best-path)
;(println (ids-to-tokens inv-voc-trg best-path))
)
)
)