1 / 16

INFORMATION RETRIEVAL TECHNIQUES BY DR. ADNAN ABID

INFORMATION RETRIEVAL TECHNIQUES BY DR. ADNAN ABID. Lecture # 19 Permuterm index k -gram. ACKNOWLEDGEMENTS. The presentation of this lecture has been taken from the underline sources

deirdra
Télécharger la présentation

INFORMATION RETRIEVAL TECHNIQUES BY DR. ADNAN ABID

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. INFORMATION RETRIEVAL TECHNIQUESBYDR. ADNAN ABID Lecture # 19 Permuterm index k-gram

  2. ACKNOWLEDGEMENTS The presentation of this lecture has been taken from the underline sources • “Introduction to information retrieval” by PrabhakarRaghavan, Christopher D. Manning, and HinrichSchütze • “Managing gigabytes” by Ian H. Witten, ‎Alistair Moffat, ‎Timothy C. Bell • “Modern information retrieval” by Baeza-Yates Ricardo, ‎ • “Web Information Retrieval” by Stefano Ceri, ‎Alessandro Bozzon, ‎Marco Brambilla

  3. Outline • Permutermindex • k-gram • Soundex

  4. Query = hel*o X=hel, Y=o Lookup o$hel* Permuterm index a*e*i*o*u  a * u  u$a*  look up B tree • For term hello, index under: • hello$, ello$h, llo$he, lo$hel, o$hell where $ is a special symbol. • Queries: • X lookup on X$ X* lookup on $X* • *X lookup on X$**X* lookup on X* • X*Y lookup on Y$X*X*Y*Z ??? Exercise! X, X*, *X are all simple and can be handled without permuterm. X*Y and X*Y*Z can be handled with permuterm. Permuterm index increases the size of dictionary 4 times FOR ENGLINSH Depends on average length of a word

  5. Bigram (k-gram) indexes • Enumerate all k-grams (sequence of k chars) occurring in any term • e.g., from text “April is the cruelest month” we get the 2-grams (bigrams) • $ is a special word boundary symbol • Maintain a second inverted indexfrom bigrams todictionary terms that match each bigram. $a,ap,pr,ri,il,l$,$i,is,s$,$t,th,he,e$,$c,cr,ru, ue,el,le,es,st,t$, $m,mo,on,nt,h$

  6. Bigram index example • The k-gram index finds terms based on a query consisting of k-grams (here k=2). $m mace madden mo among amortize on along among

  7. Processing wild-cards • Query mon* can now be run as • $m AND mo AND on • Gets terms that match AND version of our wildcard query. • But we’d enumerate moon. • Must post-filter these terms against query. • Surviving enumerated terms are then looked up in the term-document inverted index. • Fast, space efficient (compared to permuterm).

  8. K-gram Index • Larger k-grams would be lesser flexibility in query processing. • Normally bi and tri k-gram proffered.

  9. Processing wild-card queries • As before, we must execute a Boolean query for each enumerated, filtered term. • Wild-cards can result in expensive query execution (very large disjunctions…) • pyth* AND prog* • If you encourage “laziness” people will respond! • Which web search engines allow wildcard queries? Search Type your search terms, use ‘*’ if you need to. E.g., Alex* will match Alexander.

  10. Soundex

  11. Soundex • Class of heuristics to expand a query into phonetic equivalents • Language specific – mainly for names • E.g., chebyshev tchebycheff • Invented for the U.S. census … in 1918

  12. Soundex – typical algorithm • Retain the first letter of the word. • Change all occurrences of the following letters to '0' (zero):  'A', E', 'I', 'O', 'U', 'H', 'W', 'Y'. • Change letters to digits as follows: • B, F, P, V  1 • C, G, J, K, Q, S, X, Z  2 • D,T  3 • L  4 • M, N  5 • R  6 e.g. Herman H0rm0n H0r505 H06505

  13. Soundex continued • Remove all pairs of consecutive digits. • Remove all zeros from the resulting string. • Pad the resulting string with trailing zeros and return the first four positions, which will be of the form <uppercase letter> <digit> <digit> <digit>. E.g., Herman becomes H655. Will hermann generate the same code?

  14. Soundex • Soundex is the classic algorithm, provided by most databases (Oracle, Microsoft, …) • How useful is soundex? • Generally used for Proper Nouns. • Database systems also provide soundex option. • Get names whose last name is same as soundex(SMITH) • We may get Lindsay and William • It lowers precision. • But increases Recall. • Can be used by Interpol to check names. • Generally such algorithm are tailored according to European names. • There are other variants which work well for IR.

  15. Resources • IIR 3, MG 4.2 • Efficient spell retrieval: • K. Kukich. Techniques for automatically correcting words in text. ACM Computing Surveys 24(4), Dec 1992. • J. Zobel and P. Dart.  Finding approximate matches in large lexicons.  Software - practice and experience 25(3), March 1995. http://citeseer.ist.psu.edu/zobel95finding.html • Mikael Tillenius: Efficient Generation and Ranking of Spelling Error Corrections. Master’s thesis at Sweden’s Royal Institute of Technology. http://citeseer.ist.psu.edu/179155.html • Nice, easy reading on spell correction: • Peter Norvig: How to write a spelling corrector http://norvig.com/spell-correct.html

More Related