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
|
"use strict"
var typeindex = 0;
var nodetypes = ["person", "project", "skill", "deliverable", "objective"];
var suggestionChange=false;
var sentenceStack = [];
var typeStack = [];
var ExecutionStack = [];
var lastnode;
var sugg = {}; // suggestions for autocompletion of node names
var ANALYSIS_NODE_START = 'ANALYSIS_NODE_START';
var ANALYSIS_LINK = 'ANALYSIS_LINK';
function autoSuggestAddName(name)
{
console.log('adding suggestion ' + name);
/* note that name can contain spaces - this is ok. We might want to limit this though? */
if(name.split(" ").length > 1) {
sugg['"'+newnodes[n]+'"'] = 1;
} else {
sugg[name] = 1;
}
}
function autocompleteCallback(request, response_callback)
{
console.log('autocompleteCallback: ' + request.term);
var ret = [];
if (request.term === "" || request.term) {
for (var name in sugg) {
if (name.indexOf(request.term) == 0) {
ret.push(name);
}
}
}
response_callback(ret);
}
function TextAnalyser2(newtext, finalize) {
var segment = [],
subsegment = [],
sentence = [];
var newlinks = [];
var newnodes = [];
var linkindex = 0;
var nodeindex = 0;
var orderStack = [];
var quoteword = "";
var ANDcase = false;
var ANDcount = 0;
var prefix = "";
var ret = {'nodes': [], 'links': []};
function addNode(id, type, state) {
ret.nodes.push({'id':id, 'type':type, 'state':state});
}
function addLink(src, dst, name, state) {
ret.links.push({'sourceId':src, 'targetId':dst, 'name':name, 'state':state});
}
//Sentence Sequencing
//Build the words and cuts the main elements
segment = newtext.split("#");
for (var j = 0; j < segment.length; j++) {
if (j !== 0) sentence.push("#");
subsegment = segment[j].split(" ");
if (subsegment.length === 0) {
sentence.push(" ");
}
for (var k = 0; k < subsegment.length; k++) {
if (subsegment[k] !== " " && subsegment[k] !== "") {
if (subsegment[k].charAt(0) === '"') {
quoteword = "";
do {
quoteword += subsegment[k] + " ";
if(subsegment[k].charAt(subsegment[k].length-1) !== '"')k++;
} while (k < subsegment.length && subsegment[k].charAt(subsegment[k].length - 1) !== '"');
if(subsegment[k])if(subsegment[k]!==quoteword.replace(/ /g, ""))quoteword += subsegment[k];
sentence.push(quoteword.replace(/"/g, ""));
} else {
sentence.push(subsegment[k]);
}
}
}
}
//BUILD NEW NODE AND LINK ARRAYS WITH ORDER OF APPEARENCE
for (var m = 0; m < sentence.length; m++) {
switch (sentence[m]) {
case "#":
orderStack.push("START");
break;
case "and":
case "+":
case ",":
case "&":
sentence[m]=" and ";
ANDcount++;
//orderStack.push("AND");
default:
if (orderStack[orderStack.length - 1] === "START") {
orderStack.push("NODE");
newnodes.push(sentence[m]);
linkindex++;
} else if (orderStack[orderStack.length - 1] === "NODE") {
orderStack.push("LINK");
if (!newlinks[linkindex]) {
newlinks[linkindex] = sentence[m] + " ";
} else {
newlinks[linkindex] += sentence[m] + " ";
}
} else {
if (!newlinks[linkindex]) {
newlinks[linkindex] = sentence[m] + " ";
} else {
newlinks[linkindex] += sentence[m] + " ";
}
}
if (newnodes.length === 0) prefix += sentence[m] + " ";
break;
}
}
//ATTACH SENTENCE PREFIX
if (prefix) newlinks[1] += "(" + prefix + ")";
//WRITE COMPLETE SENTENCE
linkindex = 0;
nodeindex = 0;
var word = "";
var completeSentence = "";
for (var m = 0; m < orderStack.length; m++) {
if (orderStack[m] === "NODE") {
word += " (" + newnodes[nodeindex] + ") ";
if(newnodes[nodeindex].split(" ").length>1){
completeSentence += '"'+newnodes[nodeindex]+'"' + " ";
}else{
completeSentence += newnodes[nodeindex] + " ";
}
nodeindex++;
} else if (orderStack[m] === "LINK") {
linkindex++;
word += " -->" + newlinks[linkindex] + " --> ";
completeSentence += newlinks[linkindex];
}
}
//REBUILD GRAPH
linkindex = 0;
nodeindex = 0;
//CHANGE TO PERMANENT STATE AND UPDATE SUGGESTIONLIST
var typesetter = "";
if (finalize === true) {
typesetter = "perm";
for (var n = 0; n < newnodes.length; n++) {
autoSuggestAddName(newnodes[n]);
}
} else {
typesetter = "temp";
}
//ADD SURROUNDING BUBBLE
if (orderStack.length > 0) {
addNode("", "bubble","temp");
}
var abnormalGraph = (newlinks.length - ANDcount) >= 3;
//0-N ORDER STACK
for (var m = 0; m < orderStack.length - 1; m++) {
switch (orderStack[m]) {
case "START":
if (!typeStack[nodeindex]) {
typeStack[nodeindex] = nodetypes[typeindex];
}
break;
case "NODE":
addNode(newnodes[nodeindex], typeStack[nodeindex], typesetter);
if (!abnormalGraph) {
addLink(newnodes[nodeindex - 1], newnodes[nodeindex], newlinks[linkindex], typesetter);
}
nodeindex++;
break;
case "LINK":
linkindex++;
break;
}
}
//FINAL N ORDER
switch (orderStack[orderStack.length - 1]) {
case "START":
typeStack[nodeindex]=nodetypes[typeindex];
addNode("new node", typeStack[nodeindex], "temp");
if (!abnormalGraph) {
addLink(newnodes[nodeindex - 1], "new node", newlinks[linkindex], "temp");
ANDconnect("new node");}
ret.state = ANALYSIS_NODE_START;
break;
case "NODE":
typeStack[nodeindex]=nodetypes[typeindex];
addNode(newnodes[nodeindex], typeStack[nodeindex], typesetter);
if (!abnormalGraph) {
addLink(newnodes[nodeindex - 1], newnodes[nodeindex], newlinks[linkindex], typesetter);
ANDconnect(newnodes[nodeindex]);
}
break;
case "LINK":
linkindex++;
addNode("new node", "empty", "temp");
if (!abnormalGraph) {
addLink(newnodes[nodeindex - 1], "new node", newlinks[linkindex], "temp");
ANDconnect("new node");
}
ret.state = ANALYSIS_LINK;
break;
}
//EXTERNAL AND CONNECTION CHECKING
var verb = "";
function ANDconnect(node) {
for(var x=0;x<newlinks.length;x++){
if(newlinks[x])if(newlinks[x].replace(/ /g,"")!=="and"){
verb=newlinks[x];
for(var y=0; y<x ;y++){
addLink(newnodes[y], node, verb, typesetter);
for(var z=x; z<newnodes.length ;z++){
addLink(newnodes[y], newnodes[z], verb, typesetter);
}
}
}
}
}
/*console.log(sentence);
console.log(completeSentence);
console.log(orderStack);*/
//STAR CASE
verb = "";
if (abnormalGraph) {
for (var l = 1; l < newlinks.length; l++) {
if (newlinks[l])
if (newlinks[l].replace(/ /g, "") !== "and") {
verb = newlinks[l];
}
}
addNode(completeSentence, "chainlink", typesetter);
for (var n = 0; n < newnodes.length; n++) {
addLink(newnodes[n], completeSentence, "", typesetter);
}
}
//FOR THE EXTERNAL ARROW-TYPE CHANGER
lastnode = newnodes[nodeindex];
return ret;
}
|
