Search Engines:
11-442 / 11-642
 
CMU logo
 

HW1: Lexical Retrieval Design Guide

HW1 requires you to understand and make several extensions to the QryEval search engine architecture. It can be a little difficult to know where to start. We recommend the following path.

Your Unranked Boolean retrieval model supports the #OR operator. Extend it to cover the #AND operator. There are four main steps.

Unranked Boolean is now finished.

Implement the Ranked Boolean retrieval model. There are four main steps.

Ranked Boolean is now finished.

Implement BM25. There are five main steps, but it is similar to what you did for RankedBoolean.

BM25 is now finished.

Finally, implement the #NEAR operator. There are three main steps.

If you have done it correctly, #NEAR works for all three retrieval models.

 

FAQ

If you have questions not answered here, see the HW1 FAQ.


Copyright 2025, Carnegie Mellon University.
Updated on January 20, 2025

Jamie Callan