does this tell ?     much?  !  The Count's child thought
see nothing,       speak free.     man thought see
nothing.    man thought see nothing, till just now.

place common words that we remove

place common words that we remove

does this tell ?  much?  !  The Count's child thought
see nothing, speak free.  man thought see
nothing.  man thought see nothing, till just now.

?

does this tell ?  much?  !  The Count's child thought
see nothing, speak free.  man thought see
nothing.  man thought see nothing, till just now.

• therefore
• your
• what

etc.

No wonder it doesn't work.

I can spoon-feed you with ready-to-use code to solve your problem here, but it would be more useful for everybody if you participate in the process.

1. int nodeCount;
2. Node[] nodes = new Node[100];
3. HashMap nodeTable = new HashMap();
4. int edgeCount;
5. Edge[] edges = new Edge[500];
6. static final color nodeColor   = #F0C070;
7. static final color selectColor = #FF3030;
8. static final color fixedColor  = #FF8080;
9. static final color edgeColor   = #000000;
10. PFont font;
11. void setup() {
12.   size(600, 600); 
13.   loadData();
14.   font = createFont("SansSerif", 10);
15.   writeData();
16. }
17. void writeData() {
18.   PrintWriter writer = createWriter("output.dot");
19.   writer.println("digraph output {");
20.   for (int i = 0; i < edgeCount; i++) {
21.     String from = "\"" + edges[i].from.label + "\"";
22.     String to = "\"" + edges[i].to.label + "\"";
23.     writer.println(TAB + from + " -> " + to + ";");
24.   }
25.   writer.println("}");
26.   writer.flush();
27.   writer.close();
28. }
29. void loadData() {
30.   // change this if you have a file !!!!!!!!
31.   //String[] lines = loadStrings("input.txt");
32.   String[] lines =
33.   {
34.     "Computer science, hash table hash map data structure uses hash function. ",
35.     "Map identifying values, known  keys , associated values. ",
36.     "Hash table implements associative array. Hash function used transform key index array element. "
37.   };
38.   // Make the text into a single String object
39.   String line = join(lines, " ");
40.   // Replace -- with an actual em dash
41.   line = line.replaceAll("--", "—");
42.   // Split into phrases using any of the provided tokens
43.   String[] phrases = splitTokens(line, ".,;:?!—\"");
44.   //println(phrases);
45.   for (int i = 0; i < phrases.length; i++) {
46.     // Make this phrase lowercase
47.     String phrase = phrases[i].toLowerCase();
48.     // Split each phrase into individual words at one or more spaces
49.     String[] words = splitTokens(phrase, " ");
50.     for (int w = 0; w < words.length-1; w++)
51.     {
52.       addEdge(words[w], words[w+1]);
53.     }
54.   } // for
55. } // func
56. void addEdge(String fromLabel, String toLabel) {
57.   Node from = findNode(fromLabel);
58.   Node to = findNode(toLabel);
59.   from.increment();
60.   to.increment();
61.   //
62.   for (int i = 0; i < edgeCount; i++) {
63.     if (edges[i].from == from && edges[i].to == to) {
64.       edges[i].increment();
65.       return;
66.     }
67.   }
68.   //
69.   Edge e = new Edge(from, to);
70.   e.increment();
71.   if (edgeCount == edges.length) {
72.     edges = (Edge[]) expand(edges);
73.   }
74.   edges[edgeCount++] = e;
75. } // func
76. Node findNode(String label) {
77.   label = label.toLowerCase();
78.   Node n = (Node) nodeTable.get(label);
79.   if (n == null) {
80.     return addNode(label);
81.   }
82.   return n;
83. } // func
84. Node addNode(String label) {
85.   Node n = new Node(label); 
86.   if (nodeCount == nodes.length) {
87.     nodes = (Node[]) expand(nodes);
88.   }
89.   nodeTable.put(label, n);
90.   nodes[nodeCount++] = n; 
91.   return n;
92. } // func
93. void draw() {
94.   if (record) {
95.     beginRecord(PDF, "output.pdf");
96.   }
97.   background(255);
98.   textFont(font); 
99.   smooth(); 
100.   for (int i = 0 ; i < edgeCount ; i++) {
101.     edges[i].relax();
102.   }
103.   for (int i = 0; i < nodeCount; i++) {
104.     nodes[i].relax();
105.   }
106.   for (int i = 0; i < nodeCount; i++) {
107.     nodes[i].update();
108.   }
109.   for (int i = 0 ; i < edgeCount ; i++) {
110.     edges[i].draw();
111.   }
112.   for (int i = 0 ; i < nodeCount ; i++) {
113.     nodes[i].draw();
114.   }
115.   if (record) {
116.     endRecord();
117.     record = false;
118.   }
119. } // func
120. boolean record;
121. void keyPressed() {
122.   if (key == 'r') {
123.     record = true;
124.   }
125. }
126. Node selection;
127. //
128. void mousePressed() {
129.   // Ignore anything greater than this distance
130.   float closest = 20;
131.   for (int i = 0; i < nodeCount; i++) {
132.     Node n = nodes[i];
133.     float d = dist(mouseX, mouseY, n.x, n.y);
134.     if (d < closest) {
135.       selection = n;
136.       closest = d;
137.     }
138.   }
139.   if (selection != null) {
140.     if (mouseButton == LEFT) {
141.       selection.fixed = true;
142.     }
143.     else if (mouseButton == RIGHT) {
144.       selection.fixed = false;
145.     }
146.   }
147. } // func
148. void mouseDragged() {
149.   if (selection != null) {
150.     selection.x = mouseX;
151.     selection.y = mouseY;
152.   }
153. }
154. void mouseReleased() {
155.   selection = null;
156. }
157. //
158. // ==================================================
159. //
160. class Edge {
161.   Node from;
162.   Node to;
163.   float len;
164.   int count;
165.   Edge(Node from, Node to) {
166.     this.from = from;
167.     this.to = to;
168.     this.len = 50;
169.   }
170.   void increment() {
171.     count++;
172.   }
173.   void relax() {
174.     float vx = to.x - from.x;
175.     float vy = to.y - from.y;
176.     float d = mag(vx, vy);
177.     if (d > 0) {
178.       float f = (len - d) / (d * 3);
179.       float dx = f * vx;
180.       float dy = f * vy;
181.       to.dx += dx;
182.       to.dy += dy;
183.       from.dx -= dx;
184.       from.dy -= dy;
185.     }
186.   }
187.   void draw() {
188.     stroke(edgeColor);
189.     strokeWeight(0.35);
190.     line(from.x, from.y, to.x, to.y);
191.   } // func
192. } // class
193. //
194. //
195. class Node {
196.   float x, y;
197.   float dx, dy;
198.   boolean fixed;
199.   String label;
200.   int count;
201.   Node(String _label) {
202.     label = _label;
203.     x = random(width);
204.     y = random(height);
205.   }
206.   void increment() {
207.     count++;
208.   }
209.   void relax() {
210.     float ddx = 0;
211.     float ddy = 0;
212.     for (int j = 0; j < nodeCount; j++) {
213.       Node n = nodes[j];
214.       if (n != this) {
215.         float vx = x - n.x;
216.         float vy = y - n.y;
217.         float lensq = vx * vx + vy * vy;
218.         if (lensq == 0) {
219.           ddx += random(1);
220.           ddy += random(1);
221.         }
222.         else if (lensq < 100*100) {
223.           ddx += vx / lensq;
224.           ddy += vy / lensq;
225.         }
226.       }
227.     }
228.     float dlen = mag(ddx, ddy) / 2;
229.     if (dlen > 0) {
230.       dx += ddx / dlen;
231.       dy += ddy / dlen;
232.     }
233.   } // func
234.   void update() {
235.     if (!fixed) {     
236.       x += constrain(dx, -5, 5);
237.       y += constrain(dy, -5, 5);
238.       x = constrain(x, 0, width);
239.       y = constrain(y, 0, height);
240.     }
241.     dx /= 2;
242.     dy /= 2;
243.   }
244.   void draw() {
245.     fill(nodeColor);
246.     stroke(0);
247.     strokeWeight(10);
248.     ellipse(x, y, count, count);
249.     float w = textWidth(label);
250.     textSize((count+1)*7);
251.     //if (count > w+2) {
252.     fill(111);
253.     textAlign(CENTER, CENTER);
254.     // println(label);
255.     text(label, x, y);
256.     //}
257.   } // func
258.   //
259. } // class
260. //

1. int nodeCount;
2. Node[] nodes = new Node[100];
3. HashMap nodeTable = new HashMap();
4. int edgeCount;
5. Edge[] edges = new Edge[500];
6. static final color nodeColor   = #F0C070;
7. static final color selectColor = #FF3030;
8. static final color fixedColor  = #FF8080;
9. static final color edgeColor   = #000000;
10. PFont font;
11. void setup() {
12.   size(600, 600); 
13.   loadData();
14.   font = createFont("SansSerif", 10);
15.   writeData();
16. }
17. void writeData() {
18.   PrintWriter writer = createWriter("output.dot");
19.   writer.println("digraph output {");
20.   for (int i = 0; i < edgeCount; i++) {
21.     String from = "\"" + edges[i].from.label + "\"";
22.     String to = "\"" + edges[i].to.label + "\"";
23.     writer.println(TAB + from + " -> " + to + ";");
24.   }
25.   writer.println("}");
26.   writer.flush();
27.   writer.close();
28. }
29. void loadData() {
30.   // change this if you have a file !!!!!!!!
31.   //String[] lines = loadStrings("input.txt");
32.   String[] lines =
33.   {
34.     "Computer science, hash table hash map data structure uses hash function. ",
35.     "Map identifying values, known  keys , associated values. ",
36.     "Hash table implements associative array. Hash function used transform key index array element. "
37.   };
38.   // Make the text into a single String object
39.   String line = join(lines, " ");
40.   // Replace -- with an actual em dash
41.   line = line.replaceAll("--", "—");
42.   // Split into phrases using any of the provided tokens
43.   String[] phrases = splitTokens(line, ".,;:?!—\"");
44.   //println(phrases);
45.   String result = "";
46.   for (int i = 0; i < phrases.length; i++) {
47.     // Make this phrase lowercase
48.     String phrase = phrases[i].toLowerCase();
49.     phrase = trim(phrase);
50.     result += phrase + " ";
51.   }
52.   //
53.   println("result: " + result);
54.   // Split each phrase into individual words at one or more spaces
55.   String[] words = splitTokens(result, " ");
56.   // println(words);
57.   for (int w = 0; w < words.length-1; w++)
58.   {
59.     addEdge(words[w], words[w+1]);
60.   } // for
61. } // func
62. void addEdge(String fromLabel, String toLabel) {
63.   Node from = findNode(fromLabel);
64.   Node to = findNode(toLabel);
65.   from.increment();
66.   to.increment();
67.   //
68.   for (int i = 0; i < edgeCount; i++) {
69.     if (edges[i].from == from && edges[i].to == to) {
70.       edges[i].increment();
71.       return;
72.     }
73.   }
74.   //
75.   Edge e = new Edge(from, to);
76.   e.increment();
77.   if (edgeCount == edges.length) {
78.     edges = (Edge[]) expand(edges);
79.   }
80.   edges[edgeCount++] = e;
81. } // func
82. Node findNode(String label) {
83.   label = label.toLowerCase();
84.   Node n = (Node) nodeTable.get(label);
85.   if (n == null) {
86.     return addNode(label);
87.   }
88.   return n;
89. } // func
90. Node addNode(String label) {
91.   Node n = new Node(label); 
92.   if (nodeCount == nodes.length) {
93.     nodes = (Node[]) expand(nodes);
94.   }
95.   nodeTable.put(label, n);
96.   nodes[nodeCount++] = n; 
97.   return n;
98. } // func
99. void draw() {
100.   if (record) {
101.     beginRecord(PDF, "output.pdf");
102.   }
103.   background(255);
104.   textFont(font); 
105.   smooth(); 
106.   for (int i = 0 ; i < edgeCount ; i++) {
107.     edges[i].relax();
108.   }
109.   for (int i = 0; i < nodeCount; i++) {
110.     nodes[i].relax();
111.   }
112.   for (int i = 0; i < nodeCount; i++) {
113.     nodes[i].update();
114.   }
115.   for (int i = 0 ; i < edgeCount ; i++) {
116.     edges[i].draw();
117.   }
118.   for (int i = 0 ; i < nodeCount ; i++) {
119.     nodes[i].draw();
120.   }
121.   if (record) {
122.     endRecord();
123.     record = false;
124.   }
125. } // func
126. boolean record;
127. void keyPressed() {
128.   if (key == 'r') {
129.     record = true;
130.   }
131. }
132. Node selection;
133. //
134. void mousePressed() {
135.   // Ignore anything greater than this distance
136.   float closest = 20;
137.   for (int i = 0; i < nodeCount; i++) {
138.     Node n = nodes[i];
139.     float d = dist(mouseX, mouseY, n.x, n.y);
140.     if (d < closest) {
141.       selection = n;
142.       closest = d;
143.     }
144.   }
145.   if (selection != null) {
146.     if (mouseButton == LEFT) {
147.       selection.fixed = true;
148.     }
149.     else if (mouseButton == RIGHT) {
150.       selection.fixed = false;
151.     }
152.   }
153. } // func
154. void mouseDragged() {
155.   if (selection != null) {
156.     selection.x = mouseX;
157.     selection.y = mouseY;
158.   }
159. }
160. void mouseReleased() {
161.   selection = null;
162. }
163. //
164. // ==================================================
165. //
166. class Edge {
167.   Node from;
168.   Node to;
169.   float len;
170.   int count;
171.   Edge(Node from, Node to) {
172.     this.from = from;
173.     this.to = to;
174.     this.len = 50;
175.   }
176.   void increment() {
177.     count++;
178.   }
179.   void relax() {
180.     float vx = to.x - from.x;
181.     float vy = to.y - from.y;
182.     float d = mag(vx, vy);
183.     if (d > 0) {
184.       float f = (len - d) / (d * 3);
185.       float dx = f * vx;
186.       float dy = f * vy;
187.       to.dx += dx;
188.       to.dy += dy;
189.       from.dx -= dx;
190.       from.dy -= dy;
191.     }
192.   }
193.   void draw() {
194.     stroke(edgeColor);
195.     strokeWeight(0.35);
196.     line(from.x, from.y, to.x, to.y);
197.   } // func
198. } // class
199. //
200. //
201. class Node {
202.   float x, y;
203.   float dx, dy;
204.   boolean fixed;
205.   String label;
206.   int count;
207.   Node(String _label) {
208.     label = _label;
209.     x = random(width);
210.     y = random(height);
211.   }
212.   void increment() {
213.     count++;
214.   }
215.   void relax() {
216.     float ddx = 0;
217.     float ddy = 0;
218.     for (int j = 0; j < nodeCount; j++) {
219.       Node n = nodes[j];
220.       if (n != this) {
221.         float vx = x - n.x;
222.         float vy = y - n.y;
223.         float lensq = vx * vx + vy * vy;
224.         if (lensq == 0) {
225.           ddx += random(1);
226.           ddy += random(1);
227.         }
228.         else if (lensq < 100*100) {
229.           ddx += vx / lensq;
230.           ddy += vy / lensq;
231.         }
232.       }
233.     }
234.     float dlen = mag(ddx, ddy) / 2;
235.     if (dlen > 0) {
236.       dx += ddx / dlen;
237.       dy += ddy / dlen;
238.     }
239.   } // func
240.   void update() {
241.     if (!fixed) {     
242.       x += constrain(dx, -5, 5);
243.       y += constrain(dy, -5, 5);
244.       x = constrain(x, 0, width);
245.       y = constrain(y, 0, height);
246.     }
247.     dx /= 2;
248.     dy /= 2;
249.   }
250.   void draw() {
251.     fill(nodeColor);
252.     stroke(0);
253.     strokeWeight(10);
254.     ellipse(x, y, count, count);
255.     float w = textWidth(label);
256.     textSize((count+1)*7);
257.     //if (count > w+2) {
258.     fill(111);
259.     textAlign(CENTER, CENTER);
260.     // println(label);
261.     text(label, x, y);
262.     //}
263.   } // func
264.   //
265. } // class
266. //

1.   // Add a word
2.   void add(String w)
3.   {
4.     if (w.length() < 2)
5.       return; // Exclude 0 or 1 sized words
6.     if (stopWords.contains(w))
7.       return; // Exclude known stop words
8. // etc.

1.   WordList wordList = new WordList();
2.    
3.  String[] stopWordList = { "many", "require", "a", "that", "only", "the", "and", "For", "example","in", "which,",
4.   "of", "are", "to", "for", "Although", "can", "take", "as long as", "well", "or", "our", "me", "my", "no", "not", "on",
5.   "she", "so", "that", "the", "there", "they", "this", "to", "too", "you", "your"
6. };
   

1. int nodeCount;
   Node[] nodes = new Node[100];
   HashMap nodeTable = new HashMap();
   int edgeCount;
   Edge[] edges = new Edge[100];
   static final color nodeColor   = #F0C070;
   static final color selectColor = #FF3030;
   static final color fixedColor  = #FF8080;
   static final color edgeColor   = #000000;
   PFont font;
   void setup() {
     size(1000, 800); 
     loadData();
     font = createFont("SansSerif", 10);
   }
   
   
   void loadData() {
     // change this if you have a file !!!!!!!!
     //String[] lines = loadStrings("input.txt");
     String[] lines =
     {
       "In de Syrische stad Aleppo, de tweede stad van het land, woedde vanmiddag voor de vierde dag op rij een hevige strijd tussen het Syrische regeringsleger en rebellen van de oppositie. Het Syrische regime meldde intussen dat het weer de volledige controle heeft over hoofdstad Damascus.  Aleppo is het economische hart van Syrië en was tot nu toe relatief rustig gedurende de zeventien maanden die de volksopstand tegen het regime van president Assad nu duurt. Er woont net als in Damascus een elite die geprofiteerd heeft van banden met het regime. Afgelopen weekend braken er hevige gevechten uit uit. De opstandelingen kondigden toen een operatie aan die tot doel heeft Aleppo te “bevrijden”. Volgens activisten van de oppositie werd er vandaag vooral gevochten in wijken aan de rand van de stad. De strijd zou nog niet zijn doorgedrongen tot het centrum van Aleppo. Het Syrische staatspersbureau SANA beweerde dat het leger de rebellen zware verliezen heeft toegebracht. Volgens inwoners heeft het leger beschietingen en bombardementen uitgevoerd op verschillende delen van de stad.  Niet alleen in Aleppo, maar ook in de rest van Syrië houdt het geweld aan. Het aan de oppositie gelieerde Syrisch Observatorium voor Mensenrechten schat dat bij gevechten in het land gisteren meer dan 116 mensen om het leven kwam. Aan het begin van de middag meldde de organisatie dat bij het geweld van vandaag al zeker 33 mensen waren gedood."
     };
     // Make the text into a single String object
     String line = join(lines, " ");
     // Replace -- with an actual em dash
     line = line.replaceAll("--", "—");
     // Split into phrases using any of the provided tokens
     String[] phrases = splitTokens(line, ".,;:?!—\"");
     //println(phrases);
     for (int i = 0; i < phrases.length; i++) {
       // Make this phrase lowercase
       String phrase = phrases[i].toLowerCase();
       // Split each phrase into individual words at one or more spaces
       String[] words = splitTokens(phrase, " ");
       for (int w = 0; w < words.length-1; w++)
       {
         addEdge(words[w], words[w+1]);
       }
     } // for
   } // func
   void addEdge(String fromLabel, String toLabel) {
     Node from = findNode(fromLabel);
     Node to = findNode(toLabel);
     from.increment();
     to.increment();
   
   
     for (int i = 0; i < edgeCount; i++) {
       if (edges[i].from == from && edges[i].to == to) {
         edges[i].increment();
         return;
       }
     }
     //
     Edge e = new Edge(from, to);
     e.increment();
     if (edgeCount == edges.length) {
       edges = (Edge[]) expand(edges);
     }
     edges[edgeCount++] = e;
   } // func
   Node findNode(String label) {
     label = label.toLowerCase();
     Node n = (Node) nodeTable.get(label);
     if (n == null) {
       return addNode(label);
     }
     return n;
   } // func
   Node addNode(String label) {
     Node n = new Node(label); 
     if (nodeCount == nodes.length) {
       nodes = (Node[]) expand(nodes);
     }
     nodeTable.put(label, n);
     nodes[nodeCount++] = n; 
     return n;
   } // func
   void draw() {
   
   
     background(255);
     textFont(font); 
     smooth(); 
   
   
   
   
     for (int i = 0 ; i < edgeCount ; i++) {
       edges[i].relax();
     }
     for (int i = 0; i < nodeCount; i++) {
       nodes[i].relax();
     }
     for (int i = 0; i < nodeCount; i++) {
       nodes[i].update();
     }
     for (int i = 0 ; i < edgeCount ; i++) {
       edges[i].draw();
     }
     for (int i = 0 ; i < nodeCount ; i++) {
       nodes[i].draw();
   
       // stop after 900
   
       if (frameCount % 900 == 0) {
   
         nodes[i].fixed = true;
       }
     }
   } // func
   
   
   Node selection;
   //
   void mousePressed() {
     // Ignore anything greater than this distance
     float closest = 10;
     for (int i = 0; i < nodeCount; i++) {
       Node n = nodes[i];
       float d = dist(mouseX, mouseY, n.x, n.y);
       if (d < closest) {
         selection = n;
         closest = d;
       }
     }
     if (selection != null) {
       if (mouseButton == LEFT) {
         selection.fixed = true;
       }
       else if (mouseButton == RIGHT) {
         selection.fixed = false;
       }
     }
   } // func
   void mouseDragged() {
     if (selection != null) {
       selection.x = mouseX;
       selection.y = mouseY;
     }
   }
   void mouseReleased() {
     selection = null;
   }
   //
   // ==================================================
   //
   class Edge {
     Node from;
     Node to;
     float len;
     int count;
     Edge(Node from, Node to) {
       this.from = from;
       this.to = to;
       this.len = 100;
     }
     void increment() {
       count++;
     }
     void relax() {
       float vx = to.x - from.x;
       float vy = to.y - from.y;
       float d = mag(vx, vy);
       if (d > 0) {
         float f = (len - d) / (d * 6);
         float dx = f * vx;
         float dy = f * vy;
         to.dx += dx;
         to.dy += dy;
         from.dx -= dx;
         from.dy -= dy;
       }
     }
     void draw() {
       stroke(edgeColor);
       strokeWeight(0.35);
       line(from.x, from.y, to.x, to.y);
     } // func
   } // class
   //
   //
   class Node {
     float x, y;
     float dx, dy;
     boolean fixed;
     String label;
     int count;
     Node(String _label) {
       label = _label;
   
   
       x = random(width-30);
       y = random(height-30);
     }
     void increment() {
       count++;
     }
     void relax() {
       float ddx = 0;
       float ddy = 0;
       for (int j = 0; j < nodeCount; j++) {
         Node n = nodes[j];
   
   
         if (n != this) {
           float vx = x - n.x;
           float vy = y - n.y;
           float lensq = vx * vx + vy * vy;
           if (lensq == 0) {
             ddx += random(1);
             ddy += random(1);
           }
           else if (lensq < 100*100) {
             ddx += vx / lensq;
             ddy += vy / lensq;
           }
         }
       }
       float dlen = mag(ddx, ddy) / 2;
       if (dlen > 0) {
         dx += ddx / dlen;
         dy += ddy / dlen;
       }
     } // func
     void update() {
       if (!fixed) {     
         x += constrain(dx, -5, 5);
         y += constrain(dy, -5, 5);
         x = constrain(x, 40, width-40);
         y = constrain(y, 40, height-40);
       }
   
   
   
       dx /= 2;
       dy /= 2;
     }
     void draw() {
       fill(nodeColor);
       stroke(0);
       strokeWeight(10);
       ellipse(x, y, count, count);
       float w = textWidth(label);
   
   
       fill(0);
       textAlign(LEFT, CENTER);
       // println(label);
       text(label, x+5, y);
   
       textSize(9);
       // textSize((count+1)*7);
       if (count > 5) {
         fill(0, 0, 250);
         textSize(20);
   
   
         textAlign(LEFT, CENTER);
         // println(label);
         text(label, x+5, y);
       }
     } // func
     //
   } // class
   //
   
   

1.       float f = (len - d) / (d * 6);