diff --git a/doc/comparison.qbk b/doc/comparison.qbk
index d995e16c..3cea831e 100644
--- a/doc/comparison.qbk
+++ b/doc/comparison.qbk
@@ -72,7 +72,7 @@
     [
         [Can be compared using the `==`, `!=`, `<`, `<=`, `>`, `>=` operators.]
         [No comparison operators are defined in the standard, although
-            [link unordered.rationale.equality_operator
+            [link unordered.rationale.equality_operators
             implementations might extend the containers to support `==` and
             `!=`].]
     ]
diff --git a/doc/rationale.qbk b/doc/rationale.qbk
index 63ca6441..62774a66 100644
--- a/doc/rationale.qbk
+++ b/doc/rationale.qbk
@@ -96,7 +96,7 @@ efficiency advantage of power of 2 hash tables.
 
 So, this implementation uses a prime number for the hash table size.
 
-[h2 Equality operators and hash functions]
+[h2 Equality operators]
 
 `operator==` and `operator!=` are not included in the standard, but I've
 added them as I think they could be useful and can be efficiently