-
Notifications
You must be signed in to change notification settings - Fork 0
/
dictionary.cpp
355 lines (292 loc) · 7.64 KB
/
dictionary.cpp
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
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
#include <bits/stdc++.h>
using namespace std;
#define total_alphabets 26
#define underline_start "\033[4m"
#define underline_stop "\033[0m"
int letter_count(char letter)
{
if (letter >= 'A' && letter <= 'Z')
{
return letter - 'A';
}
else if (letter >= 'a' && letter <= 'z')
{
return letter - 'a';
}
return -1;
}
struct temp
{
char word[20], meaning[50];
};
class trienode
{
public:
char meaning[50];
trienode *edge[total_alphabets];
int end_indicator;
trienode()
{
end_indicator = 0;
for (int i = 0; i < total_alphabets; i++)
{
edge[i] = NULL;
}
}
} *root = new trienode();
void read_from_file()
{
ifstream file("dictionary.dat", ios::binary | ios::in);
temp obj;
while (file.read((char *)&obj, sizeof(obj)))
{
trienode *current = root;
char temp[20];
strcpy(temp, obj.word);
int index;
for (int i = 0; i < strlen(temp); i++)
{
index = letter_count(temp[i]);
if (!current->edge[index])
current->edge[index] = new trienode();
current = current->edge[index];
}
current->end_indicator = 1;
strcpy(current->meaning, obj.meaning);
}
file.close();
}
void insert(char word[], char meaning[])
{
temp object;
trienode *current = root;
int index;
for (int i = 0; i < strlen(word); i++)
{
index = letter_count(word[i]);
if (!current->edge[index])
current->edge[index] = new trienode();
current = current->edge[index];
}
current->end_indicator = 1;
strcpy(current->meaning, meaning);
strcpy(object.word, word);
strcpy(object.meaning, meaning);
ofstream file("dictionary.dat", ios::binary | ios::app);
file.write((char *)&object, (sizeof(object)));
file.close();
}
bool search(char word[], int flag)
{
trienode *current = root;
int index;
for (int i = 0; i < strlen(word); i++)
{
index = letter_count(word[i]);
if (current->edge[index] == NULL)
return false;
current = current->edge[index];
}
if (current->end_indicator != 1)
return false;
if (flag == 1)
{
cout << "Meaning of this word is ";
cout << current->meaning;
}
return true;
}
bool delete_word(char word[])
{
temp object;
trienode *current = root;
int index;
for (int i = 0; i < strlen(word); i++)
{
index = letter_count(word[i]);
if (current->edge[index] == NULL)
return false;
current = current->edge[index];
}
if (current->end_indicator == 1)
{
current->end_indicator = 0;
}
else
{
return false;
}
ifstream file("dictionary.dat", ios::binary | ios::in);
ofstream new_file("temporary.dat", ios::out | ios::binary);
while (file.read((char *)&object, sizeof(object)))
{
if (strcmp(object.word, word) == 1)
new_file.write((char *)&object, sizeof(temp));
}
file.close();
new_file.close();
remove("dictionary.dat");
rename("temporary.dat", "dictionary.dat");
cout << "\nWord is successfully deleted.";
return true;
}
void print_prefix_search(trienode *node, char allWords[], int index, char prefix[])
{
trienode *curr = node;
if (curr != NULL && curr->end_indicator == 1)
{
cout << prefix;
for (int j = 0; j < index; j++)
{
cout << allWords[j];
}
cout << ": ";
cout << curr->meaning << "\n";
}
for (int i = 0; i < total_alphabets; i++)
{
if (curr->edge[i] != NULL)
{
allWords[index] = 'a' + i;
print_prefix_search(curr->edge[i], allWords, index + 1, prefix);
}
}
}
void prefix_search(char prefix[])
{
trienode *curr = root;
for (int i = 0; i < strlen(prefix); i++)
{
int index = letter_count(prefix[i]);
curr = curr->edge[index];
}
char allWords[50];
print_prefix_search(curr, allWords, 0, prefix);
}
void spell_checker(char phrase[])
{
int i = 0, j = 0;
while (phrase[i] != '\0')
{
char temp[20] = "";
j = 0;
while (phrase[i] != ' ' && phrase[i] != '\0')
{
temp[j] = phrase[i];
i++;
j++;
}
if (!search(temp, 0))
{
cout << underline_start << temp << underline_stop << " ";
}
else
{
cout << temp << " ";
}
if (phrase[i] == '\0')
break;
i++;
}
}
bool compound(char word[], int index, int sections)
{
if (index == strlen(word))
return sections >= 2;
trienode *cur = root;
for (int i = index; i < strlen(word); i++)
{
int index = letter_count(word[i]);
if (cur->edge[index])
{
cur = cur->edge[index];
if (cur->end_indicator && compound(word, i + 1, sections + 1))
{
return true;
}
}
else
{
return false;
}
}
return false;
}
int main()
{
read_from_file();
char word[50], meaning[50];
int choice;
char ans;
do
{
cout << "\n\tDictionary\n\n\n"
<< "\t1. Search a word\n"
<< "\t2. Add a word\n"
<< "\t3. Delete a word\n"
<< "\t4. Prefix search or autocomplete\n"
<< "\t5. Spell Checker\n"
<< "\t6. Compound Checker\n"
<< "\t7. EXIT\n";
cout << "\n\nEnter your choice: ";
cin >> choice;
switch (choice)
{
case 1:
cout << "\nEnter the word to be searched : ";
fflush(stdin);
cin.get(word, 20);
if (!search(word, 1))
{
cout << "\nWord is not found. \nTry again";
}
break;
case 2:
cout << "Enter the word to be added: ";
fflush(stdin);
cin.get(word, 20);
cout << "Enter its meaning: ";
fflush(stdin);
cin.get(meaning, 50);
insert(word, meaning);
break;
case 3:
cout << "Enter the word to be deleted: ";
fflush(stdin);
cin.get(word, 20);
if (!delete_word(word))
{
cout << "\nWord to be deleted is not found.";
}
break;
case 4:
cout << "Enter the prefix: ";
fflush(stdin);
cin.get(word, 20);
prefix_search(word);
break;
case 5:
char phrase[100];
cout << "Enter any word or phrase: ";
fflush(stdin);
cin.get(phrase, 100);
spell_checker(phrase);
break;
case 6:
cout << "Enter the word to be checked: ";
fflush(stdin);
cin.get(word, 20);
if (compound(word, 0, 0))
cout << "true";
else
cout << "false";
break;
case 7:
exit(0);
break;
}
cout << "\nDo you want to continue : ";
cin >> ans;
} while (ans != 'n' && ans != 'N');
return 0;
}