seanmacavaney Goto Github PK

abnirml

aclpub2

autoqrels

beir

A Heterogeneous Benchmark for Information Retrieval. Easy to use, evaluate your models across 15+ diverse IR datasets.

bert-axioms

Code for ECIR'20 paper Diagnosing BERT with Retrieval Heuristics

capreolus

A toolkit for end-to-end neural ad hoc retrieval

cedr

Code for CEDR: Contextualized Embeddings for Document Ranking, accepted at SIGIR 2019.

clefehealth2016task3

clpsych2021-shared-task

colbert

ColBERT: Contextualized Late Interaction over BERT (code for SIGIR'20 paper)

cosc280-demo

cpython

The Python programming language

csrankings

A web app for ranking computer science departments according to their research output in selective venues, and for finding active faculty across a wide range of areas.

cwl

An evaluation script based on the C/W/L framework that is TREC Compatible and provides a replacement for TREC_EVAL and independent scripts for INST, RBP, TBG and U-Measure, etc. All measurements are reported in the same units making all metrics directly comparable.

datasets

🤗 The largest hub of ready-to-use NLP datasets for ML models with fast, easy-to-use and efficient data manipulation tools

de2abade832c8e350a1bdc98cfcdb1e202ac4749c5fc51a4a970d41736b6df5c

dl-hard

Deep Learning Hard (DL-HARD) is a new annotated dataset extending TREC Deep Learning benchmark.

doctttttquery

docTTTTTquery document expansion model

dr

dummy-irds-ext

genderbias_ir

Tools and resources for measuring gender bias in Information Retrieval models

hpack-demo

ir-datasets.com

the documentation for the ir_datasets package (https://github.com/allenai/ir_datasets/)

ir_datasets

Provides a common interface to many IR ranking datasets.

irds-mirror

mirror for small files in the ir_datases package

irds-misc

miscelleanous files related to datasets in IR

irds_robust_anserini

learned-sparse-retrieval

Unified Learned Sparse Retrieval Framework

msmarco-passage-ranking

MS MARCO(Microsoft Machine Reading Comprehension) is a large scale dataset focused on machine reading comprehension, question answering, and passage ranking. A variant of this task will be the part of TREC and AFIRM 2019. For Updates about TREC 2019 please follow This Repository Passage Reranking task Task Given a query q and a the 1000 most relevant passages P = p1, p2, p3,... p1000, as retrieved by BM25 a succeful system is expected to rerank the most relevant passage as high as possible. For this task not all 1000 relevant items have a human labeled relevant passage. Evaluation will be done using MRR

msmarco-passage-ranking-submissions

Submission archive for the MS MARCO passage ranking leaderboard