diff --git a/doc/unordered/buckets.adoc b/doc/unordered/buckets.adoc
index 01839c5d..027afaca 100644
--- a/doc/unordered/buckets.adoc
+++ b/doc/unordered/buckets.adoc
@@ -86,7 +86,7 @@ influence it:
 * Suggest a maximum load factor by calling `max_load_factor`.
 
 `max_load_factor` doesn't let you set the maximum load factor yourself, it just
-lets you give a _hint_. And even then, the draft standard doesn't actually
+lets you give a _hint_. And even then, the standard doesn't actually
 require the container to pay much attention to this value. The only time the
 load factor is _required_ to be less than the maximum is following a call to
 `rehash`. But most implementations will try to keep the number of elements
diff --git a/doc/unordered/hash_equality.adoc b/doc/unordered/hash_equality.adoc
index 5d2bdd76..dd6b2844 100644
--- a/doc/unordered/hash_equality.adoc
+++ b/doc/unordered/hash_equality.adoc
@@ -131,7 +131,7 @@ boost::unordered_multiset<point> points;
 ```
 
 See the link:../../../container_hash/index.html[Boost.Hash documentation^] for more detail on how to
-do this. Remember that it relies on extensions to the draft standard - so it
+do this. Remember that it relies on extensions to the standard - so it
 won't work for other implementations of the unordered associative containers,
 you'll need to explicitly use Boost.Hash.
 
diff --git a/doc/unordered/rationale.adoc b/doc/unordered/rationale.adoc
index 50a88096..fe4a7707 100644
--- a/doc/unordered/rationale.adoc
+++ b/doc/unordered/rationale.adoc
@@ -5,7 +5,7 @@
 = Implementation Rationale
 
 The intent of this library is to implement the unordered
-containers in the draft standard, so the interface was fixed. But there are
+containers in the standard, so the interface was fixed. But there are
 still some implementation decisions to make. The priorities are
 conformance to the standard and portability.
 
@@ -21,7 +21,7 @@ It would be conceivable to write a hash table that uses another method. For
 example, it could use open addressing, and use the lookup chain to act as a
 bucket but there are some serious problems with this:
 
-* The draft standard requires that pointers to elements aren't invalidated, so
+* The standard requires that pointers to elements aren't invalidated, so
   the elements can't be stored in one array, but will need a layer of
   indirection instead - losing the efficiency and most of the memory gain,
   the main advantages of open addressing.