4 citations · 8 across the 5 of their papers we have counts for
3 papers · 1 filter
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…