Search Results for author:
Found 9 papers, 6 papers with code
Supporting Interoperability Between Open-Source Search Engines with the Common Index File Format
There exists a natural tension between encouraging a diverse ecosystem of open-source search engines and supporting fair, replicable comparisons across those systems.
Exploring the Representation Power of SPLADE Models
The SPLADE (SParse Lexical AnD Expansion) model is a highly effective approach to learned sparse retrieval, where documents are represented by term impact scores derived from large language models.
Anytime Ranking on Document-Ordered Indexes
Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections.
Faster Learned Sparse Retrieval with Guided Traversal
Neural information retrieval architectures based on transformers such as BERT are able to significantly improve system effectiveness over traditional sparse models such as BM25.
Boosting Search Performance Using Query Variations
Rank fusion is a powerful technique that allows multiple sources of information to be combined into a single result set.
How Much Freedom Does An Effectiveness Metric Really Have?
It is tempting to assume that because effectiveness metrics have free choice to assign scores to search engine result pages (SERPs) there must thus be a similar degree of freedom as to the relative order that SERP pairs can be put into.
Wacky Weights in Learned Sparse Representations and the Revenge of Score-at-a-Time Query Evaluation
Recent advances in retrieval models based on learned sparse representations generated by transformers have led us to, once again, consider score-at-a-time query evaluation techniques for the top-k retrieval problem.
A Sensitivity Analysis of the MSMARCO Passage Collection
The recent MSMARCO passage retrieval collection has allowed researchers to develop highly tuned retrieval systems.
Efficient Immediate-Access Dynamic Indexing
In a dynamic retrieval system, documents must be ingested as they arrive, and be immediately findable by queries.
