piskvorky/bounter
View on GitHub ↗ ★ 930 Python
Efficient Counter that uses a limited (bounded) amount of memory regardless of data size.
6 mentions on Hacker News by 1 person: 2 stories, 4 comments · first 2017-10-20 · latest 2021-05-24
20082026
-
…"Efficient Counter that uses a limited (bounded) amount of memory regardless of data size." https://github.com/RaRe-Technologies/bounter Apart from HyperLogLog, Bounter implements a bunch of other nifty (fast) approximate counting…
comment by Radim · 2021-05-24 · in Counting Billion Distinct Objects Using Only 1.5KB of Memory (2012) -
…(HyperLogLog) and item counting (Count-min sketch, Bloom filters, hash tables), check out Bounter: https://github.com/RaRe-Technologies/bounter/ (Pythonic interface on top of highly optimized algorithms, faster than dict but using limited…
comment by Radim · 2018-05-24 · in On Counting (2017) -
Case in point, collocation detection over very large corpora: https://github.com/RaRe-Technologies/bounter#example-on-the-... Reduces RAM requirements some 31x times when automatically detecting common multiword expressions (e.g. "New…
comment by Radim · 2018-02-22 · in Scalable Bloom Filters (2007) [pdf] -
…Python's built-in Counter), small memory footprint & high performance (optimized C underneath). [0] https://github.com/RaRe-Technologies/bounter
comment by Radim · 2018-02-02 · in Quickly counting lots of stuff in little RAM: CountMinSketch in Python -
▲ 156
Bounter: A Python counter that uses limited memory regardless of data sizestory by Radim · 2017-10-21 · 17 comments
-
▲ 1
Bounter: super fast and memory-bounded count estimation in Pythonstory by Radim · 2017-10-20 · 0 comments