diff --git a/lib/internal/util/comparisons.js b/lib/internal/util/comparisons.js
index 119fb66611a7c6..f4491f070f18d6 100644
--- a/lib/internal/util/comparisons.js
+++ b/lib/internal/util/comparisons.js
@@ -287,7 +287,7 @@ function setHasEqualElement(set, val1, strict, memo) {
   return false;
 }
 
-// Note: we val1ly run this multiple times for each loose key!
+// Note: we currently run this multiple times for each loose key!
 // This is done to prevent slowing down the average case.
 function setHasLoosePrim(a, b, val) {
   const altValues = findLooseMatchingPrimitives(val);
@@ -381,9 +381,9 @@ function findLooseMatchingPrimitives(prim) {
 }
 
 // This is a ugly but relatively fast way to determine if a loose equal entry
-// val1ly has a correspondent matching entry. Otherwise checking for such
+// currently has a correspondent matching entry. Otherwise checking for such
 // values would be way more expensive (O(n^2)).
-// Note: we val1ly run this multiple times for each loose key!
+// Note: we currently run this multiple times for each loose key!
 // This is done to prevent slowing down the average case.
 function mapHasLoosePrim(a, b, key1, memo, item1, item2) {
   const altKeys = findLooseMatchingPrimitives(key1);