-
Notifications
You must be signed in to change notification settings - Fork 0
/
TFIDF.java
215 lines (183 loc) · 5.78 KB
/
TFIDF.java
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
package final_project;
import java.util.Scanner;
import java.io.File;
import java.util.ArrayList;
import java.util.List;
import java.io.FileWriter;
public class TFIDF{
public static void main(String[] args) throws Exception{
ArrayList<ArrayList<String>> demDocSet = new ArrayList<ArrayList<String>>();
ArrayList<ArrayList<String>> repDocSet = new ArrayList<ArrayList<String>>();
File demFile = new File("/users/jingyi/desktop/NLP_Final_Project/dem_dev_lemma.txt");
File repFile = new File("/users/jingyi/desktop/NLP_Final_Project/rep_dev_lemma.txt");
Scanner demSC = new Scanner(demFile);
Scanner repSC = new Scanner(repFile);
getDocSet(demDocSet, demSC);
getDocSet(repDocSet, repSC);
//System.out.println(Math.round(1.2345238432342));
ArrayList<TFIDFword> DemMaxRes = new ArrayList<TFIDFword>();
FileWriter myWriter = new FileWriter("/users/jingyi/desktop/NLP_Final_Project/dem_dev_res.txt");
int counter = 0;
boolean lock = true;
System.out.println(demDocSet.size());
System.out.println(repDocSet.size());
while(lock) {
for(int f = counter; f < counter + 10; f++) {
System.out.println(f);
if((f + 10) >= repDocSet.size() || (f + 10) >= demDocSet.size()) {
mainCalculate(demDocSet, repDocSet, DemMaxRes, f, demDocSet.size());
lock = false;
break;
}
else {
mainCalculate(demDocSet, repDocSet, DemMaxRes, f, f + 10);
}
}
counter += 10;
}
for(int j = 0; j < DemMaxRes.size(); j++) {
System.out.println(DemMaxRes.get(j).getWord() + " ");
myWriter.write(DemMaxRes.get(j).getWord() + " ");
String maxTFIDF = String.valueOf(DemMaxRes.get(j).getTFIDF());
System.out.println(maxTFIDF);
myWriter.write(maxTFIDF);
myWriter.write("\n");
}
demSC.close();
//repSC.close();
}
public static void mainCalculate(ArrayList<ArrayList<String>> comparedDataSet, ArrayList<ArrayList<String>> comparingDataSet, ArrayList<TFIDFword> DemMaxRes, int currentIndex, int endingIndex) {
double min = Double.NEGATIVE_INFINITY;
ArrayList<ArrayList<String>> copyOfDataSet = comparedDataSet;
ArrayList<TFIDFword> comparingTFIDFRes = TFIDFword.TF(comparingDataSet.get(currentIndex), copyOfDataSet.subList(currentIndex, endingIndex));
TFIDFword maxWord = new TFIDFword();
for(int i = 0; i < comparingTFIDFRes.size(); i++) {
double currentTFIDF = comparingTFIDFRes.get(i).getTFIDF();
//System.out.println(currentTFIDF);
if(currentTFIDF > min) {
min = currentTFIDF;
maxWord.setWord(comparingTFIDFRes.get(i).getWord());
maxWord.setTFIDF(min);
//System.out.println(maxWord);
}
}
DemMaxRes.add(maxWord);
}
public static ArrayList<ArrayList<String>> getDocSet(ArrayList<ArrayList<String>> docSet, Scanner sc) {
while(sc.hasNextLine()) {
String line = sc.nextLine();
//System.out.println(line);
if(line.contains("+00:00")) {
sc.nextLine();
//System.out.println(line);
ArrayList<String> doc = new ArrayList<String>();
while(sc.hasNextLine()) {
String innerLine = sc.nextLine();
//System.out.println(innerLine);
if(innerLine.length() == 0) {
break;
}
else {
String word = "";
for(int j = 0; j < innerLine.length(); j++) {
if(!Character.isLetter(innerLine.charAt(j))) {
word = innerLine.substring(0, j);
//System.out.println(word);
}
}
doc.add(word);
}
}
docSet.add(doc);
}
}
//System.out.println(docSet);
return docSet;
}
}
class TFIDFword{
private String word;
private int occurrence;
private int fullOccurrence;
private double TFIDF;
TFIDFword(){
}
TFIDFword(String word, int occurence){
this.word = word;
this.occurrence = occurence;
}
void setWord(String word){
this.word = word;
}
String getWord() {
return this.word;
}
void setOccurrence(int occurrence) {
this.occurrence = occurrence;
}
int getOcurrence() {
return this.occurrence;
}
void addOneOccurrence() {
this.occurrence += 1;
}
void setFullOccurrence(int fullOccurrence) {
this.fullOccurrence = fullOccurrence;
}
void addOneFullOccurrence() {
this.fullOccurrence += 1;
}
int getFullOcurrence() {
return this.fullOccurrence;
}
void setTFIDF(double TFIDF) {
this.TFIDF = TFIDF;
}
double getTFIDF() {
return this.TFIDF;
}
public static ArrayList<TFIDFword> TF(ArrayList<String> doc, List<ArrayList<String>> list) {
ArrayList<TFIDFword> TFwords = new ArrayList<TFIDFword>();
ArrayList<String> searchedWords = new ArrayList<String>();
for(int i = 0; i < doc.size(); i++) {
String targetWord = doc.get(i);
if(!searchedWords.contains(targetWord)) {
int counter = 0;
for(int j = 0; j < doc.size(); j++) {
if(targetWord == doc.get(j)) {
counter++;
}
}
TFIDFword word = new TFIDFword(targetWord, counter / doc.size());
IDF(list, word);
if(word.getFullOcurrence() != -1) {
double TFIDF = Math.round(counter * Math.log(list.size() * 1.0 / word.getFullOcurrence()) * 100.0) / 100.0;
//System.out.println(TFIDF);
word.setTFIDF(TFIDF);
TFwords.add(word);
}
}
}
return TFwords;
}
public static void IDF(List<ArrayList<String>> list, TFIDFword targetWord){
int fullOccurrence = 0;
for(int docCounter = 0; docCounter < list.size(); docCounter++) {
ArrayList<String> eachDoc = list.get(docCounter);
int eachDocSize = eachDoc.size();
for(int wordCounter = 0; wordCounter < eachDocSize; wordCounter++) {
String currentWord = eachDoc.get(wordCounter);
if(currentWord.toLowerCase().equals(targetWord.getWord().toLowerCase())) {
fullOccurrence += 1;
break;
}
}
}
if(fullOccurrence == 0) {
targetWord.setFullOccurrence(-1);
}
else {
targetWord.setFullOccurrence(fullOccurrence);
}
}
}