Information Technology > Study Notes > Carnegie Mellon University - CS 1164103-IntroToSearch (All)
Carnegie Mellon University - CS 1164103-IntroToSearch
Document Content and Description Below
11-442 / 11-642: Search Engines Two Lecture Outline 50 © 2019, Jamie Callan A quick introduction to… • Ad-hoc retrieval • Information needs & queries • Document representation • Exa... ct match retrieval – Unranked Boolean – Ranked Boolean • Indexes – Inverted lists – Term dictionary • Document retrieval – TAAT – DAAT • Query operators Goal: Provide an overview of search (“the Big Picture”) • Later lectures explore these topics in greater detail 2 Page 2 Document Retrieval: Document-at-a-Time (DAAT) Query Evaluation Key idea • Compute a complete score for doci before proceeding to doci+1 The following example assumes an unranked Boolean model. • All scores are 1 • The same architecture can be used for ranked Boolean 51 © 2019, Jamie Callan Document Retrieval: Document-at-a-Time (DAAT) Query Evaluation Starting condition: • The query is #OR (a b c) 52 © 2019, Jamie Callan 3 Page 3 Document Retrieval: Document-at-a-Time (DAAT) Query Evaluation Starting condition: • The query is #OR (a b c) • Parse the query 53 © 2019, Jamie Callan abc OR Document Retrieval: Document-at-a-Time (DAAT) Query Evaluation Starting condition: • The query is #OR (a b c) • Parse the query • Retrieve the inverted list for each term [Show More]
Last updated: 2 years ago
Preview 1 out of 43 pages
Buy this document to get the full access instantly
Instant Download Access after purchase
Buy NowInstant download
We Accept:
Reviews( 0 )
$7.00
Can't find what you want? Try our AI powered Search
Document information
Connected school, study & course
About the document
Uploaded On
Apr 17, 2021
Number of pages
43
Written in
Additional information
This document has been written for:
Uploaded
Apr 17, 2021
Downloads
0
Views
83
.png)
