How to create Inverted Index using Java? information storage and retrieval Assignment.
Create and inverted index , below is the list of activities and code to be developed
1- make a document archive, copy paste text from any where you like and create four text files (.txt) name them as 1.txt, 2.txt,3.txt,4.txt
2- Perform clean up operations , remove all punctuation, remove all numbers, use a stop words to filter the files. There are many stop words lists https://gist.github.com/sebleier/554280 , select one and use it .
A-Question: Should you filter the actual files ?
3- Create a dictionary of all the words that you have selected in step-2 (this will be required later). You can develop a dictionary by using a simple text file
4- Create the inverted index in one pass or multiple pass, the steps have been discussed many times in the class. Kindly refer to lecture notes to review.
B-Question: How will you store the posting lists ?
Coding Requirements
Write your own code, do not copy paste the code, you can look into others code but should write your own code.
The code should have following properties
(a) Should be able to read files in a corpus by using corpus path
(b) Should be able to use provided stop word list.
(c) Should have the interface to output/return posting list of any given word/term
Submission
(a) Corpus i.e. the four text files you created
(b) A text file containing dictionary
(c) Answer of the questions A and B
(d) Code developed in any language
(e) How to use your code
Google Drive LINK
https://drive.google.com/drive/folders/1_gPeExb8jkm34XxFgQunxid-cFFuKY9f?usp=sharingSolution
To use my Code...
Call the function readfile(String file) and pass the file name. All of the process will be performed automatically.
Answer1
No we should not modify the actual files because when user will query our engine then we have to return the original documents by using the inverted index..
Answer2.
We can store the posting lists in JAVA.ARRAY.LIST..
Against each term there will be a list that will contain the inverted Index..It will form a bin..against each term..
My method..
I used 2D array for storage.. first element for the term and the second term for the postings...
Each of the term in postings is separated by the comma...So I can access it Readily..by traversing the second element
Call the function readfile(String file) and pass the file name. All of the process will be performed automatically.
Answer1
No we should not modify the actual files because when user will query our engine then we have to return the original documents by using the inverted index..
Answer2.
We can store the posting lists in JAVA.ARRAY.LIST..
Against each term there will be a list that will contain the inverted Index..It will form a bin..against each term..
My method..
I used 2D array for storage.. first element for the term and the second term for the postings...
Each of the term in postings is separated by the comma...So I can access it Readily..by traversing the second element
CodeFile1
MAIN FILE
package assignment2;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.regex.Pattern;
/**
*
* @author Real Man
*/
public class Assignment2 {
public static List<String> words = new ArrayList<String>();
public static int totalLines;
public static int slines;
public static String remove(String s){
String l = "";
// if(s.length()>0){
char[] c = s.toCharArray();
for(int loop=0;loop<c.length;loop++)
{
if(c[loop] =='$'||c[loop] =='\''||c[loop] =='"'||c[loop] =='/'||c[loop] =='/'||c[loop] =='?'||c[loop] ==';'||c[loop] ==':'||c[loop] =='-'||c[loop] ==','||c[loop] =='('||c[loop] ==')'||c[loop] =='1'||c[loop] =='2'||c[loop] =='3'||c[loop] =='4'||c[loop] =='5'||c[loop] =='6'||c[loop] =='7'||c[loop] =='8'||c[loop] =='9'||c[loop] =='0'||c[loop] =='.'){
c[loop] =' ';
}
l=l.concat(Character.toString(c[loop]));
}
//}
return l;
}
public static String stopwords(String s,String f){
//s=s.replaceAll("me"," ");
//s=s.replaceAll("myself"," ");
//
//s=s.replaceAll("my"," ");
//s=s.replaceAll("we"," ");
//s=s.replaceAll("our"," ");
//s=s.replaceAll("ourselves"," ");
//
//s=s.replaceAll("ours"," ");
//s=s.replaceAll("yourselves"," ");
//s=s.replaceAll("yourself"," ");
//s=s.replaceAll("yours"," ");
//s=s.replaceAll("your"," ");
//s=s.replaceAll("you"," ");
//s=s.replaceAll("he"," ");
//
//s=s.replaceAll("himself"," ");
//s=s.replaceAll("him"," ");
//s=s.replaceAll("his"," ");
//s=s.replaceAll("she"," ");
//
//s=s.replaceAll("herself"," ");
//s=s.replaceAll("her"," ");
//s=s.replaceAll("hers"," ");
//
//s=s.replaceAll("its"," ");
//s=s.replaceAll("it"," ");
//s=s.replaceAll("itself"," ");
//s=s.replaceAll("they"," ");
//s=s.replaceAll("them"," ");
//s=s.replaceAll("their"," ");
//s=s.replaceAll("theirs"," ");
//s=s.replaceAll("themselves"," ");
//s=s.replaceAll("what"," ");
//s=s.replaceAll("which"," ");
//s=s.replaceAll("who"," ");
//s=s.replaceAll("whom"," ");
//s=s.replaceAll("this"," ");
//s=s.replaceAll("that"," ");
//s=s.replaceAll("these"," ");
//s=s.replaceAll("those"," ");
//s=s.replaceAll("am"," ");
//s=s.replaceAll("is"," ");
//s=s.replaceAll("are"," ");
//s=s.replaceAll("was"," ");
//s=s.replaceAll("were"," ");
//s=s.replaceAll("be"," ");
//s=s.replaceAll("been"," ");
//s=s.replaceAll("being"," ");
//s=s.replaceAll("have"," ");
//s=s.replaceAll("has"," ");
//s=s.replaceAll("had"," ");
//s=s.replaceAll("having"," ");
//s=s.replaceAll("do"," ");
//s=s.replaceAll("does"," ");
//s=s.replaceAll("did"," ");
//s=s.replaceAll("doing"," ");
//s=s.replaceAll("a"," ");
//s=s.replaceAll("an"," ");
//s=s.replaceAll("the"," ");
//s=s.replaceAll("and"," ");
//s=s.replaceAll("but"," ");
//s=s.replaceAll("if"," ");
//s=s.replaceAll("or"," ");
//s=s.replaceAll("because"," ");
//s=s.replaceAll("as"," ");
//s=s.replaceAll("until"," ");
//s=s.replaceAll("while"," ");
//s=s.replaceAll("of"," ");
//s=s.replaceAll("at"," ");
//s=s.replaceAll("by"," ");
//s=s.replaceAll("for"," ");
//s=s.replaceAll("with"," ");
//s=s.replaceAll("about"," ");
//s=s.replaceAll("against"," ");
//s=s.replaceAll("between"," ");
//s=s.replaceAll("into"," ");
//s=s.replaceAll("through"," ");
//s=s.replaceAll("during"," ");
//s=s.replaceAll("before"," ");
//s=s.replaceAll("after"," ");
//s=s.replaceAll("above"," ");
//s=s.replaceAll("below"," ");
//s=s.replaceAll("to"," ");
//s=s.replaceAll("from"," ");
//s=s.replaceAll("up"," ");
//s=s.replaceAll("down"," ");
//s=s.replaceAll("in"," ");
//s=s.replaceAll("out"," ");
//s=s.replaceAll("on"," ");
//s=s.replaceAll("off"," ");
//s=s.replaceAll("over"," ");
//s=s.replaceAll("under"," ");
//s=s.replaceAll("again"," ");
//s=s.replaceAll("further"," ");
//s=s.replaceAll("then"," ");
//s=s.replaceAll("once"," ");
//s=s.replaceAll("here"," ");
//s=s.replaceAll("there"," ");
//s=s.replaceAll("when"," ");
//s=s.replaceAll("where"," ");
//s=s.replaceAll("why"," ");
//s=s.replaceAll("how"," ");
//s=s.replaceAll("all"," ");
//s=s.replaceAll("any"," ");
//s=s.replaceAll("both"," ");
//s=s.replaceAll("each"," ");
//s=s.replaceAll("few"," ");
//s=s.replaceAll("more"," ");
//s=s.replaceAll("most"," ");
//s=s.replaceAll("other"," ");
//s=s.replaceAll("some"," ");
//s=s.replaceAll("such"," ");
//s=s.replaceAll("no"," ");
//s=s.replaceAll("nor"," ");
//s=s.replaceAll("not"," ");
//s=s.replaceAll("only"," ");
//s=s.replaceAll("own"," ");
//s=s.replaceAll("same"," ");
//s=s.replaceAll("so"," ");
//s=s.replaceAll("than"," ");
//s=s.replaceAll("too"," ");
//s=s.replaceAll("very"," ");
//s=s.replaceAll("s"," ");
//s=s.replaceAll("t"," ");
//s=s.replaceAll("can"," ");
//s=s.replaceAll("will"," ");
//s=s.replaceAll("just"," ");
//s=s.replaceAll("don"," ");
//s=s.replaceAll("should"," ");
//s=s.replaceAll("now"," ");
String[] w = s.split("\\s");
// System.out.println(w);
for(int loop=0;loop<w.length;loop++){
//System.out.print(w[loop]);
BufferedReader reader;
try {
reader = new BufferedReader(new FileReader("stopwords.txt"));
String line = reader.readLine();
while (line != null) {
if(w[loop].equalsIgnoreCase(line))
{
w[loop]="" ;
}
line = reader.readLine();
}
reader.close();
} catch (IOException e) {
e.printStackTrace();
}
words.add(w[loop]);
words.add(f);
}
return words.toString();
}
public static String createD(String s,String f)
{
s= s.toLowerCase();
s=remove(s);
s=stopwords(s,f);
return words.toString();
}
public static String processD()
{
for(int loop=0;loop<words.size();loop++)
{
if(!words.get(loop).equalsIgnoreCase("")){
for(int loop2=0;loop2<words.size();loop2++)
{
if(loop2!=loop)
{
if(words.get(loop2).equalsIgnoreCase( words.get(loop))){
words.set(loop2, "0");
}
}
}
} else
{
words.set(loop,"40");
}
}
return words.toString();
}
public static void readfile(String s)
{
BufferedReader reader;
try {
reader = new BufferedReader(new FileReader(s));
String line = reader.readLine();
while (line != null) {
// System.out.println(line);
// System.out.println(
createD(line,s);
line = reader.readLine();
}
reader.close();
} catch (IOException e) {
e.printStackTrace();
}
}
public static int readLines(String s)
{
BufferedReader reader;
int count =0;
try {
reader = new BufferedReader(new FileReader(s));
String line = reader.readLine();
while (line != null) {
count++;
line = reader.readLine();
}
reader.close();
} catch (IOException e) {
e.printStackTrace();
}
return count;
}
public static void createPosting()
{
words table = new words(words.size()/2+1,2);
int insert=1;
for(int loop=0;loop<words.size();loop=loop+2)
{
table.insertTerms(words.get(loop), insert);
table.insertSoundex(words.get(loop+1), insert);
insert++;
}
table.sort();
table.removeal();
// table.displayTable();
words finaltable = new words(table.samesize()+1,2);
int loop2=1;
for(int loop=0 ;loop<table.x;loop++)
{
if(!table.data[loop][0].equalsIgnoreCase("same")){
finaltable.data[loop2][0]=table.data[loop][0];
finaltable.data[loop2][1]=table.data[loop][1];
loop2++;
}
}
for(int loop=0;loop<finaltable.x;loop++)
{for(int loop1=0;loop1<finaltable.x;loop1++)
{
if(loop1!=loop)
{
if(finaltable.data[loop][0].equalsIgnoreCase(finaltable.data[loop1][0]))
{
if(!finaltable.data[loop][1].contains(finaltable.data[loop1][1])){
if(!finaltable.data[loop1][1].contains(finaltable.data[loop][1])){
finaltable.data[loop][1]=finaltable.data[loop][1].concat(",");
finaltable.data[loop][1]=finaltable.data[loop][1].concat(finaltable.data[loop1][1]);
//break;
}}
}
}}
//Only keep the long posting list rather than the whole posting list
//Final Function
}
for(int loop=0;loop<finaltable.x;loop++)
{for(int loop1=0;loop1<finaltable.x;loop1++)
{
if(loop1!=loop)
{
if(finaltable.data[loop][0].equalsIgnoreCase(finaltable.data[loop1][0]))
{
if(finaltable.data[loop][1].length()>=finaltable.data[loop1][1].length())
{
finaltable.data[loop1][1]="";
}
else{
//finaltable.data[loop][1]="";
}
}}
}
}
finaltable.displayTable();
//table.displayTable();
}
public static void main(String[] args) {
//totalLines=readLines("1.txt");
//slines=readLines("stopwords.txt");
// System.out.println(totalLines);
readfile("1.txt");
readfile("2.txt");
readfile("3.txt");
readfile("4.txt");
//readfile("5.txt");
// System.out.println(processD());
createPosting();
}
}
WORDS file
/* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package assignment2; import java.io.BufferedWriter; import java.io.FileWriter; public class words { public String [][] data; public int x; public int y; public words(int l, int m) { x=l; y=m; data= new String[x][y]; data[0][0]="Terms"; data[0][1]="Postings"; } public void insertTerms(String word,int count) { data[count][0]=word; } public void insertSoundex(String soundex,int count) { data[count][1]=soundex; } public void displayTable() { int count =0 ; try{ BufferedWriter writer = new BufferedWriter(new FileWriter("InvertedIndex.txt")); // fw.close(); for(int loop=0;loop<x;loop++) { if(data[loop][1].length()>1){ count++; writer.write("_____________"); writer.newLine(); writer.write(count+" "+data[loop][0]+"<-->"+data[loop][1]); writer.newLine(); System.out.println(count+" "+data[loop][0]+"<-->"+data[loop][1]); } } writer.close(); }catch(Exception e){System.out.println(e);} } public void findsimilar() { String c=""; for(int loop=0;loop<x;loop++) { c=""; for(int loop2=0;loop2<x;loop2++){ if(loop!=loop2){ //System.out.println("same"); if(data[loop][1].equals(data[loop2][1])){ c="ssss"; } else { } } else { // c=""; } } // System.out.println("_____________"); // System.out.println(loop+c+" "+data[loop][0]+"<-->"+data[loop][1]); } } public void sort() { for(int loop=1;loop<x;loop++) { for(int loop2=1;loop2<x;loop2++) { if(loop!=loop2){ if(data[loop][0].compareToIgnoreCase(data[loop2][0])<0){ String s1 =data[loop][0]; String s2 =data[loop][1]; data[loop][0]=data[loop2][0]; data[loop][1]=data[loop2][1]; data[loop2][0]=s1; data[loop2][1]=s2; } } } } } public int samesize() { int count=0; for(int loop=1;loop<x;loop++) { if(data[loop][0].equalsIgnoreCase("same")){ count++; } } return x-count; } public void removeal() { for(int loop=1;loop<x;loop++) { for(int loop2=1;loop2<x;loop2++) { if(loop!=loop2){ if(data[loop][0].equalsIgnoreCase(data[loop2][0])&data[loop][1].equalsIgnoreCase(data[loop2][1])){ data[loop2][0]="same"; data[loop2][1]="same"; } } } } }}Results
_____________ 1 Terms<-->Postings _____________ 2 <-->1.txt,2.txt,3.txt,4.txt _____________ 3 abhilasha<-->3.txt _____________ 4 able<-->2.txt,1.txt _____________ 5 activities<-->1.txt,2.txt _____________ 6 actual<-->2.txt,1.txt _____________ 7 ahuja<-->3.txt _____________ 8 also<-->4.txt,3.txt _____________ 9 always<-->3.txt _____________ 10 angry<-->3.txt _____________ 11 ankita<-->3.txt _____________ 12 anoop<-->3.txt _____________ 13 answer<-->2.txt,1.txt _____________ 14 architecture<-->4.txt _____________ 15 archive<-->2.txt,1.txt _____________ 16 argue<-->3.txt _____________ 17 around<-->3.txt _____________ 18 assignment<-->2.txt,1.txt _____________ 19 attempt<-->3.txt _____________ 20 attempts<-->3.txt _____________ 21 authenticated<-->4.txt _____________ 22 available<-->4.txt _____________ 23 b<-->2.txt,1.txt _____________ 24 back<-->3.txt _____________ 25 bail<-->3.txt _____________ 26 based<-->4.txt _____________ 27 beats<-->4.txt _____________ 28 behaving<-->3.txt _____________ 29 behind<-->3.txt _____________ 30 believe<-->3.txt _____________ 31 breaks<-->3.txt _____________ 32 bring<-->3.txt _____________ 33 c<-->1.txt,2.txt _____________ 34 callings<-->3.txt _____________ 35 capable<-->4.txt _____________ 36 careful<-->3.txt _____________ 37 case<-->3.txt _____________ 38 checks<-->4.txt _____________ 39 class<-->2.txt,1.txt _____________ 40 clean<-->1.txt,2.txt _____________ 41 client<-->4.txt _____________ 42 closed<-->4.txt _____________ 43 code<-->1.txt,2.txt,4.txt _____________ 44 coding<-->1.txt,2.txt _____________ 45 com<-->1.txt,2.txt _____________ 46 come<-->3.txt _____________ 47 comes<-->3.txt _____________ 48 coming<-->3.txt _____________ 49 committed<-->3.txt _____________ 50 competitors<-->4.txt _____________ 51 comprehend<-->3.txt _____________ 52 constantly<-->4.txt _____________ 53 containing<-->2.txt,1.txt _____________ 54 continues<-->3.txt _____________ 55 copy<-->1.txt,2.txt _____________ 56 corpus<-->1.txt,2.txt _____________ 57 costs<-->4.txt _____________ 58 could<-->3.txt _____________ 59 country<-->3.txt _____________ 60 cracks<-->3.txt _____________ 61 crazy<-->3.txt _____________ 62 create<-->2.txt,1.txt _____________ 63 created<-->2.txt,1.txt _____________ 64 crime<-->3.txt _____________ 65 crimes<-->3.txt _____________ 66 criminals<-->3.txt _____________ 67 d<-->2.txt,1.txt _____________ 68 damage<-->3.txt _____________ 69 dastak<-->3.txt _____________ 70 deadline<-->2.txt,1.txt _____________ 71 develop<-->2.txt,1.txt _____________ 72 developed<-->2.txt,1.txt _____________ 73 dictionary<-->2.txt,1.txt _____________ 74 difficult<-->3.txt _____________ 75 discussed<-->2.txt,1.txt _____________ 76 distance<-->3.txt _____________ 77 document<-->1.txt,2.txt _____________ 78 e<-->2.txt,1.txt _____________ 79 ego<-->3.txt _____________ 80 either<-->3.txt _____________ 81 elected<-->3.txt _____________ 82 embedded<-->4.txt _____________ 83 enough<-->3.txt _____________ 84 ep<-->3.txt _____________ 85 episode<-->3.txt _____________ 86 every<-->3.txt _____________ 87 everything<-->3.txt _____________ 88 existing<-->4.txt _____________ 89 expressions<-->3.txt _____________ 90 favourite<-->3.txt _____________ 91 features<-->4.txt _____________ 92 feed<-->4.txt _____________ 93 feeling<-->3.txt _____________ 94 feelings<-->3.txt _____________ 95 fight<-->3.txt _____________ 96 file<-->2.txt,1.txt _____________ 97 files<-->1.txt,2.txt _____________ 98 filter<-->2.txt,1.txt _____________ 99 flying<-->3.txt _____________ 100 following<-->1.txt,2.txt _____________ 101 four<-->2.txt,1.txt _____________ 102 free<-->4.txt _____________ 103 friday<-->1.txt,2.txt _____________ 104 gaze<-->3.txt _____________ 105 get<-->3.txt _____________ 106 gets<-->3.txt _____________ 107 gist<-->2.txt,1.txt _____________ 108 github<-->2.txt,1.txt _____________ 109 given<-->1.txt,2.txt _____________ 110 glass<-->3.txt _____________ 111 gone<-->3.txt _____________ 112 growing<-->3.txt _____________ 113 happen<-->3.txt _____________ 114 happened<-->3.txt _____________ 115 happening<-->3.txt _____________ 116 hatred<-->3.txt _____________ 117 haunting<-->3.txt _____________ 118 hear<-->3.txt _____________ 119 heart<-->3.txt _____________ 120 help<-->3.txt _____________ 121 hints<-->3.txt _____________ 122 home<-->4.txt _____________ 123 home�<-->4.txt _____________ 124 house<-->3.txt _____________ 125 https<-->1.txt,2.txt _____________ 126 husband<-->3.txt _____________ 127 ignites<-->3.txt _____________ 128 include<-->4.txt _____________ 129 index<-->1.txt,2.txt _____________ 130 information<-->3.txt _____________ 131 initially<-->4.txt _____________ 132 instinct<-->3.txt _____________ 133 instincts<-->3.txt _____________ 134 intentions<-->3.txt _____________ 135 interface<-->1.txt,4.txt,2.txt _____________ 136 interrogates<-->3.txt _____________ 137 inverted<-->2.txt,1.txt _____________ 138 justice<-->3.txt _____________ 139 keeps<-->3.txt _____________ 140 key<-->4.txt _____________ 141 killed<-->3.txt _____________ 142 kindly<-->2.txt,1.txt _____________ 143 know<-->3.txt _____________ 144 knowing<-->3.txt _____________ 145 language<-->1.txt,2.txt,4.txt _____________ 146 later<-->1.txt,2.txt _____________ 147 lecture<-->1.txt,2.txt _____________ 148 licensed<-->4.txt _____________ 149 like<-->3.txt,2.txt,1.txt _____________ 150 limited<-->4.txt _____________ 151 list<-->2.txt,1.txt _____________ 152 lists<-->2.txt,1.txt _____________ 153 lives<-->3.txt _____________ 154 local<-->4.txt _____________ 155 location<-->3.txt _____________ 156 look<-->1.txt,2.txt,3.txt _____________ 157 looks<-->3.txt _____________ 158 maid<-->3.txt _____________ 159 make<-->1.txt,2.txt _____________ 160 many<-->2.txt,1.txt,4.txt _____________ 161 march<-->1.txt,2.txt _____________ 162 may<-->3.txt _____________ 163 megha<-->3.txt _____________ 164 mind<-->3.txt _____________ 165 mindless<-->3.txt _____________ 166 missed<-->3.txt _____________ 167 misunderstood<-->3.txt _____________ 168 mla<-->3.txt _____________ 169 multiple<-->2.txt,1.txt _____________ 170 name<-->1.txt,2.txt _____________ 171 need<-->3.txt _____________ 172 nessus<-->4.txt _____________ 173 network<-->4.txt _____________ 174 normal<-->3.txt _____________ 175 notes<-->1.txt,2.txt _____________ 176 now<-->4.txt _____________ 177 numbers<-->2.txt,1.txt _____________ 178 often<-->3.txt _____________ 179 one<-->2.txt,1.txt,4.txt _____________ 180 ones<-->4.txt _____________ 181 open<-->4.txt _____________ 182 operations<-->2.txt,1.txt _____________ 183 others<-->1.txt,2.txt _____________ 184 outcome<-->3.txt _____________ 185 output<-->2.txt,1.txt _____________ 186 particularly<-->4.txt _____________ 187 pass<-->2.txt,1.txt _____________ 188 paste<-->1.txt,2.txt _____________ 189 path<-->2.txt,1.txt _____________ 190 patrol<-->3.txt _____________ 191 per<-->4.txt _____________ 192 perform<-->2.txt,1.txt _____________ 193 persistent<-->3.txt _____________ 194 plugins<-->4.txt _____________ 195 police<-->3.txt _____________ 196 popular<-->4.txt _____________ 197 posting<-->2.txt,1.txt _____________ 198 properties<-->1.txt,2.txt _____________ 199 provided<-->2.txt,1.txt _____________ 200 punctuation<-->1.txt,2.txt _____________ 201 question<-->2.txt,1.txt _____________ 202 questions<-->3.txt,2.txt,1.txt _____________ 203 quirky<-->3.txt _____________ 204 raghunath<-->3.txt _____________ 205 read<-->1.txt,2.txt _____________ 206 refer<-->1.txt,2.txt _____________ 207 registered<-->4.txt _____________ 208 rejected<-->3.txt _____________ 209 remote<-->4.txt _____________ 210 remove<-->2.txt,1.txt _____________ 211 removed<-->4.txt _____________ 212 required<-->1.txt,2.txt _____________ 213 requirements<-->1.txt,2.txt _____________ 214 result<-->3.txt _____________ 215 return<-->1.txt,2.txt _____________ 216 review<-->2.txt,1.txt _____________ 217 saved<-->3.txt _____________ 218 scanners<-->4.txt _____________ 219 scares<-->3.txt _____________ 220 scripting<-->4.txt _____________ 221 season<-->3.txt _____________ 222 sebleier<-->1.txt,2.txt _____________ 223 security<-->4.txt _____________ 224 select<-->1.txt,2.txt _____________ 225 selected<-->1.txt,2.txt _____________ 226 server<-->4.txt _____________ 227 shanti<-->3.txt _____________ 228 show<-->3.txt _____________ 229 signal<-->3.txt _____________ 230 signals<-->3.txt _____________ 231 signs<-->3.txt _____________ 232 simple<-->2.txt,1.txt _____________ 233 smile<-->3.txt _____________ 234 soni<-->3.txt _____________ 235 source<-->4.txt _____________ 236 stare<-->3.txt _____________ 237 step<-->1.txt,2.txt _____________ 238 steps<-->1.txt,2.txt _____________ 239 still<-->4.txt _____________ 240 stop<-->1.txt,2.txt _____________ 241 stopping<-->3.txt _____________ 242 store<-->1.txt,2.txt _____________ 243 stories<-->3.txt _____________ 244 story<-->3.txt _____________ 245 submission<-->2.txt,1.txt _____________ 246 systems<-->4.txt _____________ 247 takes<-->3.txt _____________ 248 tell<-->3.txt _____________ 249 term<-->2.txt,1.txt _____________ 250 text<-->1.txt,2.txt _____________ 251 th<-->3.txt _____________ 252 think<-->3.txt _____________ 253 though<-->4.txt _____________ 254 thrilling<-->3.txt _____________ 255 times<-->1.txt,2.txt _____________ 256 tragedy<-->3.txt _____________ 257 txt<-->1.txt,2.txt _____________ 258 understand<-->3.txt _____________ 259 understanding<-->4.txt _____________ 260 unfortunately<-->3.txt _____________ 261 unix<-->4.txt _____________ 262 unnerves<-->3.txt _____________ 263 unresolved<-->3.txt _____________ 264 updated<-->4.txt _____________ 265 upset<-->3.txt _____________ 266 us<-->3.txt _____________ 267 use<-->4.txt,2.txt,1.txt _____________ 268 using<-->2.txt,1.txt _____________ 269 version<-->4.txt _____________ 270 vessel<-->3.txt _____________ 271 visit<-->3.txt _____________ 272 vulnerability<-->4.txt _____________ 273 warns<-->3.txt _____________ 274 watch<-->3.txt _____________ 275 watchful<-->3.txt _____________ 276 way<-->3.txt _____________ 277 web<-->4.txt _____________ 278 wide<-->3.txt _____________ 279 wife<-->3.txt _____________ 280 word<-->1.txt,2.txt _____________ 281 words<-->1.txt,2.txt _____________ 282 working<-->3.txt _____________ 283 would<-->3.txt _____________ 284 write<-->2.txt,1.txt _____________ 285 writing<-->4.txt _____________ 286 year<-->4.txt _____________ 287 yet<-->3.txt _____________ 288 �nessus<-->4.txt
No comments: