Question 19: The following pseudocode constructs a graph from the "Wo…

1i = 0
2wordI = { }, wordF = { }
3while (Table 1 has more rows) {
4    Read the first row X in Table 1
5    if (isKey(wordF, X.Word)) {
6        wordF[X.Word] = wordF[X.Word] + 1
7    }
8    else {
9        wordF[X.Word] = 1
10        wordI[X.Word] = i
11        i = i + 1
12    }
13    Move row X to Table 2
14}
15
16n = length(keys(wordI))
17W = createMatrix(n, n)
18foreach r in keys(wordI) {
19    foreach c in keys(wordI) {
20        if (r ≠ c and wordF[r] ≠ wordF[c] and isSimilar(r, c)) {
21            W[wordI[r]] [wordI[c]] = 1
22        }
23    }
24}
25
26Procedure isSimilar(P, Q)
27    if (P.PartOfSpeech == Q.PartOfSpeech) {
28        return (True)
29    }
30    else {
31        return (False)
32    }
33End isSimilar