Sökning: "Binär informationssökning"

Hittade 3 uppsatser innehållade orden Binär informationssökning.

  1. 1. Trade-offs between Quality and Efficiency in Multilingual Dense Retrieval

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Emma Schüldt; [2022]
    Nyckelord :Dense retrieval; Binary Retrieval; Semantic search; ColBERT; Multilingual; MSMarco; Tät informationssökning; Binär informationssökning; Semantisk sökning; ColBERT; Flerspråkig; MS Marco;

    Sammanfattning : As the amount of content online grows, information retrieval becomes increasingly crucial. Traditional information retrieval does not take the text order into account and is also dependent on exact text matching between the query and the document. LÄS MER

  3. 2. Automatic Podcast Chapter Segmentation : A Framework for Implementing and Evaluating Chapter Boundary Models for Transcribed Audio Documents

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Adam Feldstein Jacobs; [2022]
    Nyckelord :Machine Learning; Natural Language Processing; Speech Technology; Deep Learning; Podcast Segmentation; Maskininlärning; Språkteknologi; Djupinlärning; Podcast Segmentation;

    Sammanfattning : Podcasts are an exponentially growing audio medium where useful and relevant content should be served, which requires new methods of information sorting. This thesis is the first to look into the state-of-art problem of segmenting podcasts into chapters (structurally and topically coherent sections). LÄS MER

  4. 3. Investigating Search Algorithms for Shorter Documents : A study on how to search for titles

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Lara Rostami; [2022]
    Nyckelord :information retrieval; search engine; search algorithm; BM25; short documents; titles; title search; informationssökning; sökmotor; sökalgoritm; BM25; korta dokument; titlar; titelsökning;

    Sammanfattning : The objective of this thesis was to explore whether there are alternatives to the established search ranking algorithm Best Matching 25 (BM25) when searching for shorter documents, in particular for the search of titles. Five search engines were compared to BM25, three of them being variants of the BM25 algorithm and the other two being based on a binary independence model that does not take term frequency or length normalisation into account. LÄS MER