Index: libs/algorithm/doc/equal.qbk
===================================================================
--- libs/algorithm/doc/equal.qbk	(revision 86541)
+++ libs/algorithm/doc/equal.qbk	(working copy)
@@ -49,7 +49,7 @@
 ``
 equal ( c1.begin (),     c1.end (),       c2.begin (), c2.end ()) --> false
 equal ( c1.begin () + 1, c1.begin () + 3, c2.begin (), c2.end ()) --> true
-equal ( c1.end (),       c1.end (),       c2.end (),   c2.end ()) --> true  // empty sequences are alway equal to each other
+equal ( c1.end (),       c1.end (),       c2.end (),   c2.end ()) --> true  // empty sequences are always equal to each other
 ``
 
 [heading Iterator Requirements]
Index: libs/algorithm/doc/ordered-hpp.qbk
===================================================================
--- libs/algorithm/doc/ordered-hpp.qbk	(revision 86541)
+++ libs/algorithm/doc/ordered-hpp.qbk	(working copy)
@@ -45,7 +45,7 @@
 ``
 namespace boost { namespace algorithm {
 	template <typename ForwardIterator, typename Pred>
-	FI is_sorted_until ( ForwardIterator first, ForwardIterator last, Pred p );
+	ForwardIterator is_sorted_until ( ForwardIterator first, ForwardIterator last, Pred p );
 	
 	template <typename ForwardIterator>
 	ForwardIterator is_sorted_until ( ForwardIterator first, ForwardIterator last );