diff --git a/doc/unordered/concurrent.adoc b/doc/unordered/concurrent.adoc
index 9026b31e..3410570a 100644
--- a/doc/unordered/concurrent.adoc
+++ b/doc/unordered/concurrent.adoc
@@ -132,7 +132,7 @@ by using `cvisit` overloads (for instance, `insert_or_cvisit`) and may result
 in higher parallelization. Consult the xref:#concurrent_flat_map[reference]
 for a complete list of available operations.
 
-== Whole-table Visitation
+== Whole-Table Visitation
 
 In the absence of iterators, `boost::concurrent_flat_map` provides `visit_all`
 as an alternative way to process all the elements in the map:
diff --git a/doc/unordered/intro.adoc b/doc/unordered/intro.adoc
index 0a8a14a9..46bc899c 100644
--- a/doc/unordered/intro.adoc
+++ b/doc/unordered/intro.adoc
@@ -34,7 +34,7 @@ boost::unordered_set +
 boost::unordered_map +
 boost::unordered_multiset +
 boost::unordered_multimap
-^| N/A
+^|
 
 ^.^h|*Open addressing*
 ^m| boost::unordered_node_set + 
@@ -85,7 +85,7 @@ namespace boost {
 }
 ----
 
-To store an object in an unordered associative container requires both a
+Storing an object in an unordered associative container requires both a
 key equality function and a hash function. The default function objects in
 the standard containers support a few basic types including integer types,
 floating point types, pointer types, and the standard strings. Since