diff --git a/include/boost/algorithm/string/case_conv.hpp b/include/boost/algorithm/string/case_conv.hpp
index b252b80..9c72e31 100644
--- a/include/boost/algorithm/string/case_conv.hpp
+++ b/include/boost/algorithm/string/case_conv.hpp
@@ -41,9 +41,9 @@ namespace boost {
                 An output iterator pointing just after last inserted character or
                 a copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT>
         inline OutputIteratorT 
@@ -116,9 +116,9 @@ namespace boost {
                 An output iterator pointing just after last inserted character or
                 a copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT>
         inline OutputIteratorT 
diff --git a/include/boost/algorithm/string/collection_traits.hpp b/include/boost/algorithm/string/collection_traits.hpp
index 3a780bb..b582146 100644
--- a/include/boost/algorithm/string/collection_traits.hpp
+++ b/include/boost/algorithm/string/collection_traits.hpp
@@ -17,8 +17,8 @@
 // "as is" without express or implied warranty, and with no claim as
 // to its suitability for any purpose.
 
-//  Orignal idea of container traits was proposed by Jeremy Siek and
-//  Thorsten Ottosen. This implemenetation is lightweighted version
+//  Original idea of container traits was proposed by Jeremy Siek and
+//  Thorsten Ottosen. This implementation is lightweighted version
 //  of container_traits adapter for usage with string_algo library
 
 #ifndef BOOST_STRING_COLLECTION_TRAITS_HPP
@@ -104,7 +104,7 @@ namespace boost {
             //! Const iterator type
             typedef BOOST_STRING_TYPENAME 
                 container_helper_type::const_iterator const_iterator;
-            //! Result iterator type ( iterator of const_iterator, depending on the constness of the conainer )
+            //! Result iterator type ( iterator of const_iterator, depending on the constness of the container )
             typedef BOOST_STRING_TYPENAME 
                 container_helper_type::result_iterator result_iterator;
             //! Difference type
@@ -117,7 +117,7 @@ namespace boost {
 
         //! Container value_type trait
         /*!
-            Extract the type of elements conained in a container
+            Extract the type of elements contained in a container
         */
         template< typename C >
         struct value_type_of
diff --git a/include/boost/algorithm/string/erase.hpp b/include/boost/algorithm/string/erase.hpp
index 615b5f6..17f1c9f 100644
--- a/include/boost/algorithm/string/erase.hpp
+++ b/include/boost/algorithm/string/erase.hpp
@@ -19,7 +19,7 @@
 
 /*! \file
     Defines various erase algorithms. Each algorithm removes
-    a part(s) of the input according to a searching criterium.
+    a part(s) of the input according to a searching criteria.
 */
 
 namespace boost {
@@ -38,9 +38,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT>
         inline OutputIteratorT erase_range_copy(
@@ -109,9 +109,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
 
         */
         template<
@@ -180,9 +180,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -252,9 +252,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
 
         */
         template<
@@ -323,9 +323,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
 
         */
         template<
@@ -398,9 +398,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -473,9 +473,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -551,9 +551,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.            
+                exception guarantee.            
         */
         template<
             typename OutputIteratorT,
@@ -621,9 +621,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -695,9 +695,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -765,9 +765,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
             
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
diff --git a/include/boost/algorithm/string/find.hpp b/include/boost/algorithm/string/find.hpp
index 88acb13..12f9404 100644
--- a/include/boost/algorithm/string/find.hpp
+++ b/include/boost/algorithm/string/find.hpp
@@ -64,9 +64,9 @@ namespace boost {
                 \c CollectionT::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline iterator_range< 
@@ -93,9 +93,9 @@ namespace boost {
                 \c Collection1T::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline iterator_range< 
@@ -123,9 +123,9 @@ namespace boost {
                 \c Collection1T::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline iterator_range< 
@@ -152,9 +152,9 @@ namespace boost {
                 \c Collection1T::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline iterator_range< 
@@ -212,9 +212,9 @@ namespace boost {
                 the input parameter.
 
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline iterator_range< 
@@ -245,9 +245,9 @@ namespace boost {
                 \c Collection1T::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename CollectionT>
         inline iterator_range< 
@@ -277,9 +277,9 @@ namespace boost {
                 the input parameter.
 
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename CollectionT>
         inline iterator_range< 
@@ -309,9 +309,9 @@ namespace boost {
                 \c CollectionT::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename CollectionT, typename PredicateT>
         inline iterator_range< 
diff --git a/include/boost/algorithm/string/find_format.hpp b/include/boost/algorithm/string/find_format.hpp
index 5363f57..21d931f 100644
--- a/include/boost/algorithm/string/find_format.hpp
+++ b/include/boost/algorithm/string/find_format.hpp
@@ -43,9 +43,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename OutputIteratorT,
@@ -156,9 +156,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename OutputIteratorT,
diff --git a/include/boost/algorithm/string/finder.hpp b/include/boost/algorithm/string/finder.hpp
index acbee49..f4298f6 100644
--- a/include/boost/algorithm/string/finder.hpp
+++ b/include/boost/algorithm/string/finder.hpp
@@ -19,7 +19,7 @@
 
 /*! \file
     Defines Finder generators. Finder object is a functor which is able to 
-    find a substring matching a specific criterium in the input.
+    find a substring matching a specific criteria in the input.
     Finders are used as a pluggable components for replace, find 
     and split facilities. This header contains generator functions 
     for finders provided in this library.
diff --git a/include/boost/algorithm/string/iter_find.hpp b/include/boost/algorithm/string/iter_find.hpp
index 32f4ced..6d23b6b 100644
--- a/include/boost/algorithm/string/iter_find.hpp
+++ b/include/boost/algorithm/string/iter_find.hpp
@@ -23,7 +23,7 @@
 /*! \file
     Defines generic split algorithms. Split algorithms can be 
     used to divide a sequence into several part according 
-    to a given criterium. Result is given as a 'container 
+    to a given criteria. Result is given as a 'container 
     of containers' where elements are copies or references 
     to extracted parts.
 
diff --git a/include/boost/algorithm/string/predicate.hpp b/include/boost/algorithm/string/predicate.hpp
index 3d05b71..8a3bc85 100644
--- a/include/boost/algorithm/string/predicate.hpp
+++ b/include/boost/algorithm/string/predicate.hpp
@@ -24,7 +24,7 @@
     In addition the algorithm \c all() checks all elements of a container to satisfy a 
     condition.
 
-    All predicates provide strong exception guarantie if input parameters satisfy
+    All predicates provide strong exception guarantee if input parameters satisfy
     second assumption about exception safety.
 */
 
@@ -45,9 +45,9 @@ namespace boost {
             \param Comp An element comparison predicate
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T, typename PredicateT>
             inline bool starts_with( 
@@ -99,9 +99,9 @@ namespace boost {
             \param Loc a locale used for case insensitive comparison
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline bool istarts_with( 
@@ -128,9 +128,9 @@ namespace boost {
             \param Comp An element comparison predicate
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T, typename PredicateT>
         inline bool ends_with( 
@@ -177,9 +177,9 @@ namespace boost {
             \param Loc a locale used for case insensitive comparison
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline bool iends_with( 
@@ -203,9 +203,9 @@ namespace boost {
             \param Comp An element comparison predicate
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T, typename PredicateT>
         inline bool contains( 
@@ -244,9 +244,9 @@ namespace boost {
             \param Loc a locale used for case insensitive comparison
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline bool icontains( 
@@ -273,9 +273,9 @@ namespace boost {
 
             \note This is two-way version of \c std::equal algorithm
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T, typename PredicateT>
         inline bool equals( 
@@ -329,9 +329,9 @@ namespace boost {
 
             \note This is two-way version of \c std::equal algorithm
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename Collection1T, typename Collection2T>
         inline bool iequals( 
@@ -353,9 +353,9 @@ namespace boost {
             \param Pred A predicate
             \return A result of the test
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename CollectionT, typename PredicateT>
         inline bool all( 
diff --git a/include/boost/algorithm/string/regex.hpp b/include/boost/algorithm/string/regex.hpp
index 54f1b60..4028e95 100644
--- a/include/boost/algorithm/string/regex.hpp
+++ b/include/boost/algorithm/string/regex.hpp
@@ -41,9 +41,9 @@ namespace boost {
                 \c InputContainerT::const_iterator, depending on the constness of 
                 the input parameter.
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename CollectionT, 
@@ -77,9 +77,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input   
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename OutputIteratorT,
@@ -165,9 +165,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input     
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename OutputIteratorT,
@@ -252,9 +252,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                        a modified copy of the input    
 
-           \note If the input paramters satisfy the second assumption
+           \note If the input parameters satisfy the second assumption
                about exception safety, second variant of this function provides strong
-               exception guarantie.
+               exception guarantee.
        */
         template< 
             typename OutputIteratorT,
@@ -333,9 +333,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input                        
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template< 
             typename OutputIteratorT,
@@ -420,9 +420,9 @@ namespace boost {
 
             \note Prior content of the result will be overridden.
 
-            \note If the input paramters satisfy the second assumption
-                about exception safety and result's container swap() method have strong exception guarantie, 
-                this function provides strong exception guarantie.
+            \note If the input parameters satisfy the second assumption
+                about exception safety and result's container swap() method have strong exception guarantee, 
+                this function provides strong exception guarantee.
         */
         template< 
             typename SequenceSequenceT, 
@@ -463,9 +463,9 @@ namespace boost {
 
             \note Prior content of the result will be overridden.
 
-            \note If the input paramters satisfy the second assumption
-                about exception safety and result's container swap() method have strong exception guarantie, 
-                this function provides strong exception guarantie.
+            \note If the input parameters satisfy the second assumption
+                about exception safety and result's container swap() method have strong exception guarantee, 
+                this function provides strong exception guarantee.
         */
         template< 
             typename SequenceSequenceT, 
diff --git a/include/boost/algorithm/string/replace.hpp b/include/boost/algorithm/string/replace.hpp
index 223458b..cd72ce5 100644
--- a/include/boost/algorithm/string/replace.hpp
+++ b/include/boost/algorithm/string/replace.hpp
@@ -20,7 +20,7 @@
 
 /*! \file
     Defines various replace algorithms. Each algorithm replaces
-    a part(s) of the input according to a searching and a replace criterium.
+    a part(s) of the input according to a searching and a replace criteria.
 */
 
 namespace boost {
@@ -41,9 +41,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -121,9 +121,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -198,9 +198,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
 
         */
         template<
@@ -279,9 +279,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input            
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -356,9 +356,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input  
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -438,9 +438,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -520,9 +520,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input            
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
        */
         template<
             typename OutputIteratorT,
@@ -604,9 +604,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input 
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -682,9 +682,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input 
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -764,9 +764,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                 a modified copy of the input  
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
@@ -842,9 +842,9 @@ namespace boost {
             \return An output iterator pointing just after last inserted character or
                     a modified copy of the input   
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<
             typename OutputIteratorT,
diff --git a/include/boost/algorithm/string/sequence_traits.hpp b/include/boost/algorithm/string/sequence_traits.hpp
index d6875b2..a8e8901 100644
--- a/include/boost/algorithm/string/sequence_traits.hpp
+++ b/include/boost/algorithm/string/sequence_traits.hpp
@@ -23,7 +23,7 @@
     function.
 
     Due to language restriction, it is not currently possible to define specialization for
-    stl containers without including the coresponding header. To decrease the overhead
+    stl containers without including the corresponding header. To decrease the overhead
     needed by this inclusion, user can selectively include specialization 
     header for a specific container. They are located in boost/algorithm/string/stl
     directory. Alternatively she can include boost/algorithm/string/std_collection_traits.hpp
@@ -52,7 +52,7 @@ namespace boost {
             Declare an override of this tester function with return 
             type boost::string_algo::yes_type for a sequence with this property.
 
-            \return yes_type if the seqeunce's insert/replace/erase methods do not invalidate
+            \return yes_type if the sequence's insert/replace/erase methods do not invalidate
             existing iterators.
         */
         no_type has_stable_iterators_tester(...);                     
diff --git a/include/boost/algorithm/string/split.hpp b/include/boost/algorithm/string/split.hpp
index aeb2dc0..653008b 100644
--- a/include/boost/algorithm/string/split.hpp
+++ b/include/boost/algorithm/string/split.hpp
@@ -20,7 +20,7 @@
 /*! \file
     Defines basic split algorithms. 
     Split algorithms can be used to divide a string
-    into several parts according to a given criterium.
+    into several parts according to a given criteria.
     
     Each part is copied and added as a new element to the
     output container.
@@ -56,9 +56,9 @@ namespace boost {
 
             \note Prior content of the result will be overridden.
 
-            \note If the input paramters satisfy the second assumption
-                about exception safety and result's container swap method have strong exception guarantie, 
-                this function provides strong exception guarantie.
+            \note If the input parameters satisfy the second assumption
+                about exception safety and result's container swap method have strong exception guarantee, 
+                this function provides strong exception guarantee.
         */
         template< typename SequenceSequenceT, typename Collection1T, typename Collection2T >
         inline SequenceSequenceT& find_all(
@@ -93,9 +93,9 @@ namespace boost {
 
             \note Prior content of the result will be overridden.
 
-            \note If the input paramters satisfy the second assumption
-                about exception safety and result's container swap method have strong exception guarantie, 
-                this function provides strong exception guarantie.
+            \note If the input parameters satisfy the second assumption
+                about exception safety and result's container swap method have strong exception guarantee, 
+                this function provides strong exception guarantee.
         */
         template< typename SequenceSequenceT, typename Collection1T, typename Collection2T >
         inline SequenceSequenceT& ifind_all(
@@ -138,9 +138,9 @@ namespace boost {
 
             \note Prior content of the result will be overridden.
 
-            \note If the input paramters satisfy the second assumption
-                about exception safety and result's container swap() method have strong exception guarantie, 
-                this function provides strong exception guarantie.
+            \note If the input parameters satisfy the second assumption
+                about exception safety and result's container swap() method have strong exception guarantee, 
+                this function provides strong exception guarantee.
         */
         template< typename SequenceSequenceT, typename CollectionT, typename PredicateT >
         inline SequenceSequenceT& split(
diff --git a/include/boost/algorithm/string/trim.hpp b/include/boost/algorithm/string/trim.hpp
index 8813aaf..e1f4365 100644
--- a/include/boost/algorithm/string/trim.hpp
+++ b/include/boost/algorithm/string/trim.hpp
@@ -48,9 +48,9 @@ namespace boost {
                 An output iterator pointing just after last inserted character or
                 a copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, the second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
         inline OutputIteratorT trim_left_copy_if( 
@@ -93,9 +93,9 @@ namespace boost {
             \param Loc a locale used for 'space' classification
             \return A trimmed copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename SequenceT>
         inline SequenceT trim_left_copy(const SequenceT& Input, const std::locale& Loc=std::locale())
@@ -158,9 +158,9 @@ namespace boost {
                 An output iterator pointing just after last inserted character or
                 a copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, the second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
         inline OutputIteratorT trim_right_copy_if( 
@@ -204,9 +204,9 @@ namespace boost {
             \param Loc A locale used for 'space' classification
             \return A trimmed copy of the input
 
-            \note If the input paramters satisfy second assumption
+            \note If the input parameters satisfy second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */  
         template<typename SequenceT>
         inline SequenceT trim_right_copy(const SequenceT& Input, const std::locale& Loc=std::locale())
@@ -272,9 +272,9 @@ namespace boost {
                 An output iterator pointing just after last inserted character or
                 a copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, the second variant of this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename OutputIteratorT, typename CollectionT, typename PredicateT>
         inline OutputIteratorT trim_copy_if( 
@@ -331,9 +331,9 @@ namespace boost {
             \param Loc A locale used for 'space' classification
             \return A trimmed copy of the input
 
-            \note If the input paramters satisfy the second assumption
+            \note If the input parameters satisfy the second assumption
                 about exception safety, this function provides strong
-                exception guarantie.
+                exception guarantee.
         */
         template<typename SequenceT>
         inline SequenceT trim_copy( const SequenceT& Input, const std::locale& Loc=std::locale() )
diff --git a/include/boost/algorithm/string/yes_no_type.hpp b/include/boost/algorithm/string/yes_no_type.hpp
index 89a89dc..dc3da7a 100644
--- a/include/boost/algorithm/string/yes_no_type.hpp
+++ b/include/boost/algorithm/string/yes_no_type.hpp
@@ -14,7 +14,7 @@ namespace boost {
     namespace algorithm {
 
         // taken from boost mailing-list
-        // when yes_no_type will become officialy
+        // when yes_no_type will become officially
         // a part of boost distribution, this header
         // will be deprecated
         template<int I> struct size_descriptor