16.2: Information retrieval

Think Data Structures - Algorithms and Information Retrieval in Java · LibreTexts

0%

Contents

    Text

    Size
    100%
    Theme
    Typeface
    Line length
    Spacing

    From LibreTexts, under CC BY-NC-SA 3.0, as the source states it; its equations are written in TeX, which the PDF shows typeset. This page at LibreTexts.

    The next phase of this project is to implement a search tool. The pieces we’ll need include:

    1. An interface where users can provide search terms and view results.
    2. A lookup mechanism that takes each search term and returns the pages that contain it.
    3. Mechanisms for combining search results from multiple search terms.
    4. Algorithms for ranking and sorting search results.

    The general term for processes like this is “information retrieval”, which you can read more about at thinkdast.com/infret.

    In this exercise, we’ll focus on steps 3 and 4. We’ve already built a simple version of 2. If you are interested in building Web applications, you might consider working on step 1.

    This page titled 16.2: Information retrieval was last modified on Tue, 01 Dec 2020 03:50:45 GMT and is shared under a CC BY-NC-SA 3.0 license and was authored, remixed, and/or curated by Allen B. Downey (Green Tea Press) .