4 citations · 8 across the 5 of their papers we have counts for
7 papers
A Sensitivity Analysis of the MSMARCO Passage Collection
Joel Mackenzie, Matthias Petri, Alistair Moffat
The recent MSMARCO passage retrieval collection has allowed researchers to develop highly tuned retrieval systems. One aspect of this data set that makes it distinctive compared to…
Anytime Ranking on Document-Ordered Indexes
Joel Mackenzie, Matthias Petri, Alistair Moffat
Inverted indexes continue to be a mainstay of text search engines, allowing efficient querying of large document collections. While there are a number of possible organizations, do…
Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees
Ehsan Shareghi, Matthias Petri, Gholamreza Haffari +1
Efficient methods for storing and querying are critical for scaling high-order n-gram language models to large corpora. We propose a language model based on compressed suffix trees…
CSA++: Fast Pattern Search for Large Alphabets
Simon Gog, Alistair Moffat, Matthias Petri
Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance, in terms of both space required and search speed…
Access Time Tradeoffs in Archive Compression
Matthias Petri, Alistair Moffat, P. C. Nagesh +1
Web archives, query and proxy logs, and so on, can all be very large and highly repetitive; and are accessed only sporadically and partially, rather than continually and holistical…
Compact Indexes for Flexible Top-k Retrieval
Simon Gog, Matthias Petri
We engineer a self-index based retrieval system capable of rank-safe evaluation of top-k queries. The framework generalizes the GREEDY approach of Culpepper et al. (ESA 2010) to ha…