-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathHW01.cpp
More file actions
401 lines (364 loc) · 13.8 KB
/
HW01.cpp
File metadata and controls
401 lines (364 loc) · 13.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
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
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
#include <iostream>
#include <fstream>
#include <string.h>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
using namespace std;
bool ends(string s, char target[]);
bool cons(int i, char target[]);
int m(char target[]);
bool vowelinstem(char target[]);
bool cvc(char target[]);
void step1(char target[]);
void step2(char target[]);
void step3(char target[]);
void step4(char target[]);
void step5(char target[]);
void step6(char target[]);
int main(){
ifstream doc("C:\\Users\\Mark\\Desktop\\text.txt"); //read file
string line;
vector <string> token;
char delim[] = " ,.\n''";
char *t;
char target[1000][30];
int i=0, k=0;
string stopwords[] = {"are","and", "the", "of", "two", "on", "in", "with", "against", "you", "to", "for", "the", "s", "that"};
while (getline(doc, line)){
transform(line.begin(), line.end(), line.begin(), ::tolower); //convert to lowercase
t = strtok ((char*)line.c_str(), delim); //parse with delim
while (t != NULL){
strcpy(target[i], t); //copy the string pointed to char array 'target'
//printf ("%s\n", target[i]);
i++;
t = strtok(NULL, delim); //t pointing to the next delimiter position
}
}
ofstream outfile ("C:\\Users\\Mark\\Desktop\\output.txt");
/* 'target' is a char array, awaiting to undergo Porter's algorithm */
while(strlen(target[k]) != 0){
step1(target[k]);
step2(target[k]);
step3(target[k]);
step4(target[k]);
step5(target[k]);
step6(target[k]);
int check_delete = 1;
for(int j=0; j<sizeof(stopwords)/sizeof(stopwords[0]); j++)
{
if (strcmp(target[k], stopwords[j].c_str())==0)
{
check_delete = 0;
break;
}
}
if(check_delete){
cout<<target[k]<<endl;
outfile <<target[k]<<endl;
}
k++;
}
outfile.close();
return 0;
}
/* check if a word end with the input string s */
bool ends(string s, char target[]) {
int l = s.length(), k = strlen(target);
int o = k-l+1;
if (o < 0)
return false;
char sc[100] = "";
strcpy(sc, s.c_str());
for (int i = 0; i < s.length(); i++){
if (target[o+i-1] != sc[i])
return false;
}
return true;
}
/* cons(i) is true <=> target[i] is a consonant */
bool cons(int i, char target[]) {
switch (target[i]) {
case 'a': case 'e': case 'i': case 'o': case 'u':
return false;
case 'y':
if (i==0)
return true;
else
return !cons(i-1, target); //if Y is preceded by a consonant, then it's not a consonant
default:
return true;
}
}
/* c is a consonant sequence and v a vowel sequence
<c><v> gives 0
<c>vc<v> gives 1
<c>vcvc<v> gives 2
<c>vcvcvc<v> gives 3
.... */
int m(char target[]) {
int n = 0, i = 0, j = strlen(target)-1;
while(true) { //get the end of starting c, meaning the next one is v
if (i > j)
return n;
if (!cons(i, target))
break;
i++;
}
i++;
while(true) {
while(true) {
if (i > j) //get the end of v, meaning the next one is c
return n; //extreme case: CV will return 0
if (cons(i, target))
break;
i++;
}
i++;
n++;
while(true) { //get the end of c, meaning the next one is v
if (i > j)
return n; //extreme case: CVC will return 1
if (!cons(i, target))
break;
i++;
}
i++;
}
}
/* find if there's vowel in input char array */
bool vowelinstem(char target[]) {
int i;
for (i = 0; i <= strlen(target)-1; i++)
if (! cons(i, target))
return true;
return false;
}
/* the stem ends cvc, where the second c is not W, X or Y */
bool cvc(char target[]) {
int i = strlen(target)-1;
if (i < 2 || !cons(i, target) || cons(i-1, target) || !cons(i-2, target))
return false;
int last = target[i];
if (last == 'w' || last == 'x' || last == 'y')
return false;
return true;
}
/* step1() gets rid of plurals and -ed or -ing. e.g.
1(a)
SSES -> SS
IES -> I
SS -> SS
S ->
1(b)
(m>0) EED -> EE
(*v*) ED ->
(*v*) ING ->
1(c)
If the second or third of the rules in Step 1b is successful, the following is done:
AT -> ATE conflat(ed) -> conflate
BL -> BLE troubl(ed) -> trouble
IZ -> IZE siz(ed) -> size
(*d and not (*L or *S or *Z))
-> single letter
hopp(ing) -> hop
tann(ed) -> tan
fall(ing) -> fall
hiss(ing) -> hiss
fizz(ed) -> fizz
(m=1 and *o) -> E fail(ing) -> fail
fil(ing) -> file
*/
void step1(char target[]) {
char temp[100];
int k = strlen(target)-1;
if (target[k] == 's') {
if (ends("sses", target)) // SSES -> SS
{
strncpy(temp, target, strlen(target)-2);
strcpy(target, temp);
}
else if (ends("ies", target)) // IES -> I
{
strncpy(temp, target, strlen(target)-2);
strcpy(target, temp);
}
else if (k>=1 && (target[k-1] != 's')) // S -> ,but SS -> SS
{
strncpy(temp, target, strlen(target)-1);
strcpy(target, temp);
}
}
if (ends("eed", target)) { //(m>0) EED -> EE mÁÙ¨S¼g
if (m(target) > 0)
{
strncpy(temp, target, strlen(target)-1);
strcpy(target, temp);
}
}
else if ((ends("ed", target) || ends("ing", target)) && vowelinstem(target)) { //(*v*) ED -> , ING -> and 1(c)
if (ends("ed", target))
{
strncpy(temp, target, strlen(target)-2);
strcpy(target, temp);
}
if (ends("ing", target))
{
strncpy(temp, target, strlen(target)-3);
strcpy(target, temp);
}
if (ends("at", target))
strcat(target, "e");
else if (ends("bl", target))
strcat(target, "e");
else if (ends("iz", target))
strcat(target, "e");
else if ((target[strlen(target)-1] == target[strlen(target)-2])&&(target[strlen(target)-1] != 'l')
&&(target[strlen(target)-1] != 's')&&(target[strlen(target)-1] != 'z')&&(strlen(target) != 1))
{
target[strlen(target)-1]='\0';
}
else if (m(target) == 1 && cvc(target))
strcat(target, "e");
}
}
/* step2() if there is "another" vowel in the token, replace ending y with i */
void step2(char target[]) {
char temp[100] = "";
strncpy(temp, target, strlen(target)-1);
if (ends("y", target) && vowelinstem(temp))
target[strlen(target)-1] = 'i';
}
void step3(char target[]) {
if (m(target) == 0)
return;
char temp[100];
switch (target[strlen(target)-2]) {
case 'a':
if (ends("ational", target)) {strncpy(temp, target, strlen(target)-7); strcpy(target, temp); strcat(target, "ate"); break; }
if (ends("tional", target)) {strncpy(temp, target, strlen(target)-6); strcpy(target, temp); strcat(target, "tion"); break; }
break;
case 'c':
if (ends("enci", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); strcat(target, "ence"); break; }
if (ends("anci", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); strcat(target, "ance"); break; }
break;
case 'e':
if (ends("izer", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); strcat(target, "ize"); break; }
break;
case 'l':
if (ends("bli", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); strcat(target, "ble"); break; }
if (ends("alli", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); strcat(target, "al"); break; }
if (ends("entli", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "ent"); break; }
if (ends("eli", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); strcat(target, "e"); break; }
if (ends("ousli", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "ous"); break; }
break;
case 'o':
if (ends("ization", target)) {strncpy(temp, target, strlen(target)-7); strcpy(target, temp); strcat(target, "ize"); break; }
if (ends("ation", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "ate"); break; }
if (ends("ator", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); strcat(target, "ate"); break; }
break;
case 's':
if (ends("alism", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "al"); break; }
if (ends("iveness", target)) {strncpy(temp, target, strlen(target)-7); strcpy(target, temp); strcat(target, "ive"); break; }
if (ends("fulness", target)) {strncpy(temp, target, strlen(target)-7); strcpy(target, temp); strcat(target, "ful"); break; }
if (ends("ousness", target)) {strncpy(temp, target, strlen(target)-7); strcpy(target, temp); strcat(target, "ous"); break; }
break;
case 't':
if (ends("aliti", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "al"); break; }
if (ends("iviti", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); strcat(target, "ive"); break; }
if (ends("biliti", target)) {strncpy(temp, target, strlen(target)-6); strcpy(target, temp); strcat(target, "ble"); break; }
break;
case 'g':
if (ends("logi", target)) {strncpy(temp, target, strlen(target)-1); strcpy(target, temp); break; }
break;
default :
break;
}
return;
}
void step4(char target[]) {
if (m(target) == 0)
return;
char temp[100];
switch (target[strlen(target)-1]) {
case 'e':
if (ends("icate", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
if (ends("ative", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); break; }
if (ends("alize", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
break;
case 'i':
if (ends("iciti", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
break;
case 'l':
if (ends("ical", target)) {strncpy(temp, target, strlen(target)-2); strcpy(target, temp); break; }
if (ends("ful", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
break;
case 's':
if (ends("ness", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
break;
}
return;
}
void step5(char target[]) {
if (m(target) < 2)
return;
char temp[100];
switch (target[strlen(target)-2]) {
case 'a':
if (ends("al", target)) {strncpy(temp, target, strlen(target)-2); strcpy(target, temp); break; }
case 'c':
if (ends("ance", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
if (ends("ence", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
case 'e':
if (ends("er", target)) {strncpy(temp, target, strlen(target)-2); strcpy(target, temp); break; }
case 'i':
if (ends("ic", target)) {strncpy(temp, target, strlen(target)-2); strcpy(target, temp); break; }
case 'l':
if (ends("able", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
if (ends("ible", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
case 'n':
if (ends("ant", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
if (ends("ement", target)) {strncpy(temp, target, strlen(target)-5); strcpy(target, temp); break; }
if (ends("ment", target)) {strncpy(temp, target, strlen(target)-4); strcpy(target, temp); break; }
if (ends("ent", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
case 'o':
if (ends("ion", target) && ((strlen(target)-4) >= 0) && (target[strlen(target)-4] == 's' || target[strlen(target)-4] == 't'))
{strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
if (ends("ou", target)) {strncpy(temp, target, strlen(target)-2); strcpy(target, temp); break; }
case 's':
if (ends("ism", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
case 't':
if (ends("ate", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
if (ends("iti", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
case 'u':
if (ends("ous", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
case 'v':
if (ends("ive", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
case 'z':
if (ends("ize", target)) {strncpy(temp, target, strlen(target)-3); strcpy(target, temp); break; }
default:
return;
}
return;
}
void step6(char target[]) {
char temp[100] = "";
strncpy(temp, target, strlen(target)-1);
char tempt[100];
if (m(target)>1 && target[strlen(target)-1] == 'e')
{
strncpy(tempt, target, strlen(target)-1);
strcpy(target, tempt);
}
if (m(target)==1 && target[strlen(target)-1] == 'e' && !cvc(temp) && strlen(temp)>=3)
{
strncpy(tempt, target, strlen(target)-1);
strcpy(target, tempt);
}
if (m(target)>1 && target[strlen(target)-1] != 'L' && (target[strlen(target)-1] == target[strlen(target)-2]))
{
strncpy(tempt, target, strlen(target)-1);
strcpy(target, tempt);
}
}