diff --git a/content/develop/data-types/probabilistic/hyperloglogs.md b/content/develop/data-types/probabilistic/hyperloglogs.md
index 7102cf9d69..20fd623272 100644
--- a/content/develop/data-types/probabilistic/hyperloglogs.md
+++ b/content/develop/data-types/probabilistic/hyperloglogs.md
@@ -18,9 +18,7 @@ title: HyperLogLog
 weight: 1
 ---
 
-HyperLogLog is a probabilistic data structure that estimates the cardinality of a set. As a probabilistic data structure, HyperLogLog trades perfect accuracy for efficient space utilization.
-
-The Redis HyperLogLog implementation uses up to 12 KB and provides a standard error of 0.81%.
+HyperLogLog trades perfect accuracy for efficient space utilization. The Redis implementation uses up to 12 KB and provides a standard error of 0.81%.
 
 Counting unique items usually requires an amount of memory
 proportional to the number of items you want to count, because you need