Index: libs/bimap/doc/quick_tutorial.qbk
===================================================================
--- libs/bimap/doc/quick_tutorial.qbk	(revision 78428)
+++ libs/bimap/doc/quick_tutorial.qbk	(working copy)
@@ -80,7 +80,7 @@
 
 [import ../example/step_by_step.cpp]
 
-A convinience header is avaiable in the boost directory:
+A convenience header is available in the boost directory:
 
     #include <boost/bimap.hpp>
 
@@ -123,7 +123,7 @@
 
     bm.left.find(1)->second = "1"; // Compilation error
 
-If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situtions too. Lets see an example
+If you insert `(1,"one")` and `(1,"1")` in a `std::map<int,std::string>` the second insertion will have no effect. In a `bimap<X,Y>` both keys have to remain unique. The insertion may fail in other situations too. Lets see an example
 
     bm.clear();
 
Index: libs/bimap/doc/history.qbk
===================================================================
--- libs/bimap/doc/history.qbk	(revision 78428)
+++ libs/bimap/doc/history.qbk	(working copy)
@@ -51,7 +51,7 @@
 [
 Once in Boost, the library switched to the now familiar name
 "Boost.MultiIndex". Late in 2004, it formally became a member of Boost.
-Joaquin continued to enchance the library and added new features such as
+Joaquin continued to enhance the library and added new features such as
 composite keys and random-access indices.
 ]]
 
@@ -71,7 +71,7 @@
 
 [[2007 - Boost.Bimap]
 [
-The formal review took place at the beggining of the year and Boost.Bimap 
+The formal review took place at the beginning of the year and Boost.Bimap 
 was accepted in Boost.
 ]]
 ]
Index: libs/bimap/doc/compiler_specifics.qbk
===================================================================
--- libs/bimap/doc/compiler_specifics.qbk	(revision 78428)
+++ libs/bimap/doc/compiler_specifics.qbk	(working copy)
@@ -41,7 +41,7 @@
 
 [h2 VS 7.1]
 
-If a .cpp file uses more than four differents bimaps the compiler will run
+If a .cpp file uses more than four different bimaps the compiler will run
 out of symbols and issue an internal compiler error. The official solution
 in msdn is to split the .cpp in several files or upgrade your compiler.
 
Index: libs/bimap/doc/tutorial.qbk
===================================================================
--- libs/bimap/doc/tutorial.qbk	(revision 78428)
+++ libs/bimap/doc/tutorial.qbk	(working copy)
@@ -246,12 +246,12 @@
 [heading Countries Populations]
 
 We want to store countries populations.
-The requeriments are:
+The requirements are:
 
-# Get a list of countries in decresing order of their populations.
-# Given a countrie, get their population.
+# Get a list of countries in decreasing order of their populations.
+# Given a country, get their population.
 
-Lets create the appropiate bimap.
+Lets create the appropriate bimap.
 
     typedef bimap<
 
@@ -768,7 +768,7 @@
 [code_user_defined_names_untagged_version]
 
 In Boost.Bimap there is a better way to document the code and
-in the meantime helping you to write more mantainable and readable code.
+in the meantime helping you to write more maintainable and readable code.
 You can tag the two collections of the bimap so they can be 
 accessed by more descriptive names.
 
@@ -954,7 +954,7 @@
 Additionally, the type of this two parameters can be tagged to specify 
 user defined names instead of the usual `member_at::-Side-` tags. 
 
-The possibles way to use the first parameter are:
+The possible way to use the first parameter are:
 
     bimap< Type, R >
 
Index: libs/bimap/doc/bimap_and_boost.qbk
===================================================================
--- libs/bimap/doc/bimap_and_boost.qbk	(revision 78428)
+++ libs/bimap/doc/bimap_and_boost.qbk	(working copy)
@@ -36,7 +36,7 @@
 types can be used as key. There is a library in Boost that already
 allows the creation of this kind of container: Boost.MultiIndex. It
 offers great flexibility and lets you construct almost any container
-that you could dream of. The framework is very clean. You migh want to
+that you could dream of. The framework is very clean. You might want to
 read this library's tutorial to learn about the power that has been
 achieved.