---
title: "Probabilistic Counting with Randomized Storage"
authors:
  - "Benjamin Van Durme"
  - "Ashwin Lall"
doi: ""
url: "https://ijcai.org/proceedings/2009/263"
pdf: "https://ijcai.org/proceedings/2009/0263.pdf"
venue: "Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence"
year: 2009
pages: "1574-1578"
track: ""
keywords:
---

# Probabilistic Counting with Randomized Storage

Benjamin Van Durme, Ashwin Lall

*Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence*, pages 1574-1578.

## Abstract

Previous work by Talbot and Osborne [2007] explored the use of randomized storage mechanisms in language modeling. These structures trade a small amount of error for significant space savings, enabling the use of larger language models on relatively modest hardware. Going beyond space efficient count storage, here we present the Talbot Osborne Morris Bloom (TOMB) Counter, an extended model for performing space efficient counting over streams of finite length. Theoretical and experimental results are given, showing the promise of approximate counting over large vocabularies in the context of limited space.Benjamin Van Durme, Ashwin Lall