diff --git a/doc/unordered/buckets.adoc b/doc/unordered/buckets.adoc
index e4a8fe3c..ed5f15dc 100644
--- a/doc/unordered/buckets.adoc
+++ b/doc/unordered/buckets.adoc
@@ -361,3 +361,6 @@ to be started over if some other thread interferes in the process by
 performing a succesful insertion beginning at the same group. In
 practice, the start-over frequency is extremely small, measured in the range
 of parts per million for some of our benchmarks.
+
+For more information on implementation rationale, read the
+xref:#rationale_concurrent_hashmap[corresponding section].
diff --git a/doc/unordered/compliance.adoc b/doc/unordered/compliance.adoc
index cd93770b..71768b26 100644
--- a/doc/unordered/compliance.adoc
+++ b/doc/unordered/compliance.adoc
@@ -188,7 +188,7 @@ is served by:
 template<class F> size_t visit_all(F f);
 ----
 
-of which there are parallelized version in C++17 compilers with parallel
+of which there are parallelized versions in C++17 compilers with parallel
 algorithm support. In general, the interface of `boost::concurrent_flat_map`
 is derived from that of `boost::unordered_flat_map` by a fairly straightforward
 process of replacing iterators with visitation where applicable. If
diff --git a/doc/unordered/rationale.adoc b/doc/unordered/rationale.adoc
index 15a6aa9d..e63459dd 100644
--- a/doc/unordered/rationale.adoc
+++ b/doc/unordered/rationale.adoc
@@ -132,7 +132,7 @@ lookup that are lock-free up to the last step of actual element comparison.
 of all elements between `boost::concurrent_flat_map` and `boost::unordered_flat_map`.
 (This feature has not been implemented yet.)
 
-=== Hash function and platform interopersability
+=== Hash function and platform interoperability
 
 `boost::concurrent_flat_map` makes the same decisions and provides the same guarantees
 as Boost.Unordered open-addressing containers with regards to