Boolean retrieval search engine with SPIMI indexing and BM25 ranking
-
Updated
Sep 1, 2021 - Python
8000
Boolean retrieval search engine with SPIMI indexing and BM25 ranking
SPIMI Ranked Retrieval Implementation and API
A full-text search engine built using inverted indices for efficient retrieval of text documents from the arXiv dataset
Single Pass In Memory Indexer and document retrieval based on ranking (Using BM25 and TF-IDF)
Ranked Information Retrieval: an indexation and ranked retrieval system for textual information.
Databases 2 - Project 2: Single-Pass In-Memory Indexing for information search and recovery
Build index using SPIMI(single pass in memory indexing) algorithm with BM25 ranking algorithm.
Creates naive and SPIMI indexes for the Reuters 21578 corpus. Ranks results, including BM25
Практические задания по дисциплине "Информационный поиск", 1 курс магистратуры, Матмех, СПбГУ
Индексатор и поисковик по коллекции текстов песен с Genius.com
A C++ implementation of the Single-Pass In-Memory Indexing (SPIMI) algorithm to build an inverted index from a collection of documents.
Add a description, image, and links to the spimi topic page so that developers can more easily learn about it.
To associate your repository with the spimi topic, visit your repo's landing page and select "manage topics."