Nama : - Ahmad Yunus

- Ikhsan Fadly
Kelas : 01 MKMI 002
Mata Kuliah : Information Retrieval
Nama Dosen : Dr. Sudarno, DEA
1. Try the the following queries on at least three search engines here, and answer the
questions.
 Search for 'krombi'.
- How many documents have you found?
- Is there a ranking of the documents retrieved?

Compare the different search engines.

- Which differences have you found in the results?
- What is the best search engine based on your retrieval results?

Jawaban :
Mencari krombi dengan menggunakan tiga search engines :
Search Banyak Global Rank
No. Top Result
Engine Dokumen (Alexa Rank)
1 Google 63.600 https://alatmusikindonesia.com/alat- 492.876
musik-tradisional-papua
2 Yahoo 45.300 www.youtube.com/watch?v=KYbP9 2
01iq5Q
3 Bing 13.500 kekunaan.blogspot.com/2012/08/alat- 4.256.914
musik-tradisional-papua.html

Perbedaan hasil pencarian dari google, yahoo dan bing :

Google Yahoo Bing
- Mengakses sebuah - Akses lebih mudah - Pencarian gambar dan
informasi dengan cepat - Memuat informasi video di filter secara
- Fitur canggih lebih lama detail
- Terdapat cache - Fitur tidak selengkap
google dan yahoo

Menurut kami, search engine yang paling baik adalah google karena :
- Mengakses sebuah informasi dengan cepat
- Fitur canggih
- Terdapat cache
2. Consider these documents:
Doc 1 : breakthrough drug for schizophrenia
Doc 2 : new schizophrenia drug
Doc 3 : new approach for treatment of schizophrenia
Doc 4 : new hopes for schizophrenia patients
1. Draw the term-document incidence matrix for this document collection.
2. Draw the inverted index representation for this collection.
3. what are the returned results for these queries:
- schizophrenia AND drug
- for schizophrenia AND NOT(drug OR approach)

Jawaban :
1. Menggambar term-document incidence matrix
DOC 1 DOC 2 DOC 3 DOC 4
Approach 0 0 1 0
Breakthrough 1 0 0 0
Drug 1 1 0 0
For 1 0 1 1
Hopes 0 0 0 1
New 0 1 1 1
Of 0 0 1 0
Patients 0 0 0 1
Schizophrenia 1 1 1 1
Treatment 0 0 1 0

2. Menggambar inverted index representasion

Approach → 3
Breakthrough → 1
Drug → 1 2
For → 1 3 4
Hopes → 4
New → 2 3 4
Of → 3
Patients → 4
Schizophrenia → 1 2 3 4
Treatment → 3
3. Return result untuk query :
- schizophrenia AND drug
1111 ^ 1100
1100
DOC 1, DOC 2

- for schizophrenia AND NOT(drug OR approach)

1111 ^ (1100 + 0010)
1111 ^ 1110
0001
DOC 4
3. Shown below is a portion of a positional index in the format:
term: doc1:<position1, position2, . . . >; doc2: <position1, position2, . . . >; etc.

angels : 2: <36,174,252,651>; 4: <12,22,102,432>; 7: <17>;

fools : 2: <1,17,74,222>; 4: <8,78,108,458>; 7: <3,13,23,193>;
fear : 2: <87,704,722,901>; 4: <13,43,113,433>; 7: <18,328,528>;
in : 2: <3,37,76,444,851>; 4: <10,20,110,470,500>; 7: <5,15,25,195>;
rush : 2: <2,66,194,321,702>; 4: <9,69,149,429,569>; 7: <4,14,404>;
to : 2: <47,86,234,999>; 4: <14,24,774,944>; 7: <199,319,599,709>;
tread : 2: <57,94,333>; 4: <15,35,155>; 7: <20,320>;
where : 2: <67,124,393,1001>; 4: <11,41,101,421,431>; 7: <15,35,735>;

Which document(s) (if any) match each of the following queries where each expression
within quotes is a phrase query?
“fools rush in”

Jawaban :

Lihat interval kata diatas, karena hanya satu interval, maka kita cari pada setiap dokumen
yang katanya berurut :

fools : 2: <1,17,74,222>; 4: <8,78,108,458>; 7: <3,13,23,193>;

in : 2: <3,37,76,444,851>; 4: <10,20,110,470,500>; 7: <5,15,25,195>;
rush : 2: <2,66,194,321,702>; 4: <9,69,149,429,569>; 7: <4,14,404>;

DOC 2 : Position 1
DOC 4 : Position 8
DOC 7 : Position 3 dan Position 13
4. Compute the Levenshtein matrix for the distance between the strings “apoemfel” and
“poems” .

Jawaban :

NULL P O E M S

NULL 0 1 2 3 4 5

A 1 1 2 3 4 5

P 2 1 2 3 4 5

O 3 2 1 2 3 4

E 4 3 2 1 2 3

M 5 4 3 2 1 2

F 6 5 4 3 2 2

E 7 6 5 4 3 3

L 8 7 6 5 4 4

Diperlukan 4 operasi untuk merubah kata APOEMFEL menjadi POEMS

Operation Input Output
REMOVE A *
REMOVE F *
REMOVE E *
REPLACE L S

Remove Remove Remove

A P O E M F E L

Replace
P O E M S
5. What key(s) would one do the lookup on, if you wanted to search for these words s*ng in
a permuterm wildcard index?
a. Spe*
b. *ful
c. s*ng

Jawaban :
Putar wildcard query sehingga * ada di ujung string
a. spe*
pe*$s
e*$sp
*$spe
$spe*
b. *ful
ful$*
c. s*ng
*ng$s
Ng$s*