-
Notifications
You must be signed in to change notification settings - Fork 0
/
Executable.rkt
287 lines (229 loc) · 8.95 KB
/
Executable.rkt
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
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
#lang racket
(require racket/gui/base)
(require "DL.rkt")
(require "Hasher.rkt")
(require "Bloom.rkt")
(require data/bit-vector)
(require net/sendurl)
(require "BKTree.rkt")
(define dictree (bknode 0 "correct" '()))
(define (make-tree)
(define word (read-line bki))
(cond [(not (eof-object? word))
(set! dictree (add dictree word))
(make-tree)]))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define (space-check word)
(let [(len (string-length word))
(ans #f)]
[begin (define (helper i)
(if (= i len) (void)
(let [(part1 (substring word 0 i))
(part2 (substring word i len))]
[if (and (is-correct? part1) (is-correct? part2))
(set! ans (string-append part1 " " part2))
(helper (+ i 1))])))
(helper 0) ans]))
(define (smart-correction word n)
(let* ([temp (space-check word)]
[x (find-matching-words word dictree)]
[one-list (lc z : z <- x @(equal? (edit-distance z word) 1))]
[l (length one-list)]
[res (if (>= l n) (first n one-list) (append one-list (first (- n l) x)))])
(cond [(boolean? temp) res]
[else (append (list temp) res)])
))
(define (first n l)
(cond [(or (null? l) (= n 0)) '()]
[else (cons (car l) (first (- n 1) (cdr l)))]))
;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
(define (is-correct? word)
(define new-word word)
(is-correct-helper new-word 10))
(define (is-correct-helper word i)
(cond [(= i 23) #t]
[(equal? (bit-vector-ref bloom-vec (murmur-hash word i)) #f) #f ]
[ else (is-correct-helper word (+ i 1))]
))
;;;;;;;;;Check Spellings;;;;;;;
(define (result-generator str)
(define incorrect-list '())
(define modified-string "")
(define (readx)
(let [(ans "")
(len (string-length str))]
[define (helper i)
(cond [(= len 0) (set! ans "#eof")]
[ (= i len) (begin (set! ans str) (set! str ""))]
[else
[let [(curr (string-ref str i))]
[cond
[(or (eq? #\space curr) (eq? #\newline curr))
(begin (set! ans (substring str 0 i)) (set! str (if (> len (+ i 1)) (substring str (+ i 1) len) "")))]
[(or (eq? #\. curr) (eq? #\? curr) (eq? #\, curr) (eq? #\! curr))
(begin (set! ans (substring str 0 i)) (set! str (if (> len (+ i 2)) (substring str (+ i 2) len) "")))]
[else (helper (+ i 1))]]]])]
[begin (helper 0) ans]))
(define (result-gen)
(let* ([word (readx)])
(cond [(equal? word "#eof") (cons modified-string incorrect-list )]
[(equal? word "") (result-gen)]
[else
(if (not (is-correct? word)) (begin (set! incorrect-list (cons word incorrect-list))
(set! modified-string (string-append modified-string (string-append " " (modify word))))
(result-gen))
(begin
(set! modified-string (string-append modified-string (string-append " " word)))
(result-gen))
) ]
)))
(result-gen)
)
(define (print-solution str)
(car (result-generator str)))
(define (incorrect-list str)
(cdr (result-generator str)))
(define (modify word)
(define wl (string->list word))
(list->string (append (cons #\{ wl) '(#\})))
)
(gen-vector)
(make-tree)
;;;;;;;;;;;;;;;;;;GUI;;;;;;;;;;;;;;;;;;;
(define sug #f)
(define replacement #f)
(define (find-and-replace str word1 word2)
(define (readx)
(let [(ans "")
(len (string-length str))]
[define (helper i)
(cond [(= len 0) (set! ans "#eof")]
[ (= i len) (begin (set! ans str) (set! str ""))]
[else
[let [(curr (string-ref str i))]
[cond
[(or (eq? #\space curr) (eq? #\newline curr))
(begin (set! ans (substring str 0 i)) (set! str (if (> len (+ i 1)) (substring str (+ i 1) len) "")))]
[(or (eq? #\. curr) (eq? #\? curr) (eq? #\, curr) (eq? #\! curr))
(begin (set! ans (substring str 0 i)) (set! str (if (> len (+ i 2)) (substring str (+ i 2) len) "")))]
[else (helper (+ i 1))]]]])]
[begin (helper 0) ans]))
(define modified-string "")
(define (fr)
(let* ([word (readx)])
(cond [(equal? word "#eof") (string-append " " modified-string)]
[(equal? word "") (fr)]
[else
(if (equal? word word1) (begin
(set! modified-string (string-append modified-string (string-append " " word2)))
(fr))
(begin
(set! modified-string (string-append modified-string (string-append " " word)))
(fr))
) ]
)))
(let*
[(strnew (fr))
(lennew (string-length strnew))]
[substring strnew 1 lennew]))
(define (func)
(define temp (send input get-value))
(define ans (print-solution temp))
(send output set-value ans)
(define inc (incorrect-list temp))
(send incorrect-words update-choices inc))
(define mainframe (new frame%
[label "CorRacketify"]
[width 800]
[height 800]
[enabled #t]
[border 5]))
(send mainframe show #t)
(define panel1 (new horizontal-panel%
[parent mainframe]))
(define input (new text-field%
[parent panel1]
[label "Enter Your Text Here"]
[min-height 80]
[style (list 'multiple)]
[vert-margin 0]))
(define correct-button(new button%
[label "Correct It!"]
[parent panel1]
[callback (lambda (x y) (func))]
))
(define panel2 (new horizontal-panel%
[parent mainframe]))
(define output (new text-field%
[parent panel2]
[label "Parsed Text"]
[min-height 60]
[horiz-margin 60]
[vert-margin 0]
[style (list 'multiple)]))
(define panel3 (new horizontal-panel%
[parent mainframe]))
(define incorrect-words
(new (class combo-field%
(super-new)
(inherit get-menu append)
(define/public (update-choices choice-list)
; remove all the old items
(map
(lambda (i)
(send i delete))
(send (get-menu) get-items))
; set up the menu with all new items
(map
(lambda (choice-label)
(append choice-label))
choice-list)
(void)
))
[parent panel3]
[label "Incorrect-Words"]
[choices '()]
[callback (lambda (x y) (begin (send suggestions update-choices (smart-correction (send x get-value) 10))
(set! sug (send x get-value))))]
))
(define add-button (new button%
[label "Add To Dictionary"]
[parent panel3]
[callback (lambda (x y) (map modify-vec (hasher sug))
(set! dictree (add dictree sug)))]
))
(define suggestions
(new (class combo-field%
(super-new)
(inherit get-menu append)
(define/public (update-choices choice-list)
; remove all the old items
(map
(lambda (i)
(send i delete))
(send (get-menu) get-items))
; set up the menu with all new items
(map
(lambda (choice-label)
(append choice-label))
choice-list)
(void)
))
[parent panel3]
[label "Suggestions"]
[choices '()]
[callback (lambda (x y) (set! replacement (send x get-value)))]
))
(define rep (new button%
[label "Replace"]
[parent panel3]
[callback (lambda (x y) (send input set-value (begin (find-and-replace (begin (send input get-value)) sug replacement))))]))
(define (google-search word)
(define url (string-append "https://www.google.com/search?q=" word "+meaning&oq=" word "+meaning&aqs=chrome..69i57j0l5.2108j0j8&sourceid=chrome&ie=UTF-8"))
(send-url url ))
(define panel4 (new horizontal-panel%
[parent mainframe]))
(define search (new button%
[label "Get Meaning Of Suggestion"]
[parent panel4]
[callback (lambda (x y) (google-search replacement))]))