-
Notifications
You must be signed in to change notification settings - Fork 1
/
analysis.js
253 lines (183 loc) · 7.35 KB
/
analysis.js
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
/////////////////////////////
// Libraries
/////////////////////////////
const combinatorics = require('js-combinatorics')
const fs = require('fs')
const natural = require('natural')
const accents = require('remove-accents')
sw = require('stopword')
/////////////////////////////
// Reading dics.json
/////////////////////////////
///data/docs-DH2019.json
fs.readFile(__dirname + '/data/docs.json', (err, data) => {
//
// Set data
//
if (err) throw err
docs = JSON.parse(data)
//
// Assemble by author
//
let authors = []
for (let doc of docs) {
for (let author of doc.authors) {
const existence = authors.some(a => a.id === author)
const text = doc.title.toLowerCase() + ' ' + doc.body.toLowerCase() + ' '
if (existence) {
let _author = authors.filter(a => a.id === author)
_author[0].docs++
_author[0].text += text
} else {
authors.push({
id: author,
docs: 1,
text: text
})
console.log('Created author #', authors.length)
}
}
}
//
// Merging authors
//
let table_merging_authors = []
for (let i = 0; i < authors.length - 1; i++) {
for (let j = i + 1; j < authors.length; j++) {
const equal = accents.remove(authors[i].id) === accents.remove(authors[j].id) // Check accents
const similar = natural.DiceCoefficient(authors[i].id, authors[j].id) > .8 // Check similarity
if (equal || similar) {
// Push elements for checking
table_merging_authors.push([authors[i].id, authors[j].id])
// Increase counter
authors[i].docs += authors[j].docs
// Merge texts
authors[i].text += ' ' + authors[j].text
// Remove second author
authors = authors.slice(0, j).concat(authors.slice(j + 1, authors.length))
// Reset j position
j = j - 1
}
}
}
console.table(table_merging_authors)
//
// Remove authors with a few documents
//
// for (let i = 0; i < authors.length; i++) {
// if ( authors[i].docs < 2 )
// authors = authors.slice(0, i).concat(authors.slice(i + 1, authors.length))
// }
//
// Set items
//
const items = authors
//
// Text Analysis
//
// Tokenizer
const tokenizer = new natural.WordTokenizer()
items.forEach((item, i) => {
console.log('Computing token for author #', i)
item.tokens = tokenizer.tokenize(item.text)
})
// Singularize
const inflector = new natural.NounInflector()
const safeList = ['humanities', 'corpus', 'cervantes', 'apparatus', 'analysis', 'politics']
items.forEach(item => item.tokens = item.tokens.map(t =>
safeList.includes(t) ? t : inflector.singularize(t)
))
// Cleaning
const stopWords = ['thi', 'div', 'allora', '000', 'ved', 'thu', 'not', 'mos', 'will', 'attraverso', 'let', 'its', 'when', 'kaplan', 'vari', 'etc', 'http', 'org', 'exclusively', 'two', 'one', 'rodighiero', 'within', 'figure', 'high', 'figura', 'usati', 'proprio', 'qui', 'ogni', 'allowed', 'used', 'section', 'example', 'marginally', 'appear', 'quindi', 'qualit', 'use']
items.forEach(item => item.tokens = item.tokens.filter(token => token.length > 2))
items.forEach(item => item.tokens = item.tokens.filter(token => !stopWords.includes(token)))
items.forEach(item => item.tokens = item.tokens.filter(token => !parseInt(token)))
items.forEach(item => item.tokens = sw.removeStopwords(item.tokens))
// items.forEach(item => item.tokens = sw.removeStopwords(item.tokens, sw.br))
// items.forEach(item => item.tokens = sw.removeStopwords(item.tokens, sw.de))
// items.forEach(item => item.tokens = sw.removeStopwords(item.tokens, sw.fr))
items.forEach(item => item.tokens = sw.removeStopwords(item.tokens, sw.it))
// items.forEach(item => item.tokens = sw.removeStopwords(item.tokens, sw.pt))
// TF-IDF
const tokenFrequency = new natural.TfIdf()
items.forEach((item, i) => {
console.log('Computing token frequency for author #', i)
tokenFrequency.addDocument(item.tokens)
})
// 15 is a good value for final version; it can be lowered for testing
const tfidfLimit = 200
items.forEach((item, i) => {
console.log('Reducing tokens for author #', i)
item.tokens = tokenFrequency.listTerms(i)
// .filter(el => el.tfidf > tfidfLimit) // On threshold
.slice(0, tfidfLimit) // On top elements
.reduce((obj, el) => {
obj[el.term] = el.tfidf
return obj
}, {})
})
// Delete text from items to lighten the file
items.forEach(item => delete item.text)
//
// Set network
//
const pairs = combinatorics.bigCombination(items, 2) // Set pairs
const nodes = items // Set node object
const links = [] // Set link object
let i = pairs.length
let maxCommonTokens = 0
pairs.forEach(pair => {
const p1 = pair[0],
p2 = pair[1]
const t1 = p1.tokens,
t2 = p2.tokens
const tokens = Object.keys(p1.tokens).filter(n => Object.keys(p2.tokens).includes(n))
maxCommonTokens = maxCommonTokens > tokens.length ? maxCommonTokens : tokens.length
console.log('#' + i--, '|', tokens.length, 'terms between', p2.id, 'and', p1.id)
tokens.forEach(token => {
const link = links.find(link => link.source === p1.id && link.target === p2.id)
const value = t1[token] + t2[token]
if (link) {
link.value += value
link.tokens[token] = value
} else {
links.push({
source: p1.id,
target: p2.id,
value: value,
tokens: {
[token]: value,
}
})
}
})
})
// Normalizing values between [0,1]
const maxLinkValue = links.reduce((max, link) => max > link.value ? max : link.value, 0)
const minLinkValue = links.reduce((min, link) => min < link.value ? min : link.value, 100000)
links.forEach(link => link.value = link.value / maxLinkValue)
//
// Report and file writing
//
const format = x => JSON.stringify(x).length.toString().replace(/\B(?=(\d{3})+(?!\d))/g, ',')
console.log(` nodes.json : ${format(nodes)}kb for ${nodes.length} authors`)
console.log(` links.json : ${format(links)}kb for ${links.length} links`)
console.log(` maxLinkValue : ${maxLinkValue}`)
console.log(` minLinkValue : ${minLinkValue}`)
console.log(`maxCommonTokens : ${maxCommonTokens}`)
fs.writeFile('./src/data/nodes.json', JSON.stringify(nodes), err => {
if (err) throw err
})
fs.writeFile('./src/data/links.json', JSON.stringify(links), err => {
if (err) throw err
})
fs.writeFile('./data/nodes.json', JSON.stringify(nodes, null, '\t'), err => {
if (err) throw err
})
fs.writeFile('./data/links.json', JSON.stringify(links, null, '\t'), err => {
if (err) throw err
})
//
// END
//
})