--- a/doc/distributions/hyperexponential.qbk	2014-11-23 10:41:50.000000000 +0900
+++ b/doc/distributions/hyperexponential.qbk	2014-11-25 11:40:27.000000000 +0900
@@ -111 +111 @@
-Similarly, if a product manufactured in several parallel assemply lines and the outputs are merged, the failure density of the overall product is likely to be hyperexponential (Trivedi,2002).
+Similarly, if a product manufactured in several parallel assembly lines and the outputs are merged, the failure density of the overall product is likely to be hyperexponential (Trivedi,2002).
@@ -289 +289 @@
-disambiguage between this and other 2-argument constructors.  Refer to the source code for more details.]
+disambiguate between this and other 2-argument constructors.  Refer to the source code for more details.]
@@ -305 +305 @@
-[h4 Construction with rates-iterators (and all phase probablities equal)]
+[h4 Construction with rates-iterators (and all phase probabilities equal)]
@@ -317 +317 @@
-disambiguage between this and other 2-argument constructors.  Refer to the source code for more details.]
+disambiguate between this and other 2-argument constructors.  Refer to the source code for more details.]
--- a/doc/distributions/hypergeometric.qbk	2014-11-23 10:41:50.000000000 +0900
+++ b/doc/distributions/hypergeometric.qbk	2014-11-25 11:38:02.000000000 +0900
@@ -61 +61 @@
-Constructs a hypergeometric distribution with with a population of /N/ objects,
+Constructs a hypergeometric distribution with a population of /N/ objects,
@@ -128 +128 @@
-In general for very large N, the user should expect to loose log[sub 10]N
+In general for very large N, the user should expect to lose log[sub 10]N
@@ -198 +198 @@
-to loose around log[sub 10]N decimal digits during the calculation in
+to lose around log[sub 10]N decimal digits during the calculation in
--- a/doc/sf/bernoulli_numbers.qbk	2014-11-23 10:41:50.000000000 +0900
+++ b/doc/sf/bernoulli_numbers.qbk	2014-11-25 11:37:10.000000000 +0900
@@ -66 +66 @@
-It is implemented as a direct (and very fast) table lookup, and while not recomended for general use it can be useful
+It is implemented as a direct (and very fast) table lookup, and while not recommended for general use it can be useful
@@ -77 +77 @@
-larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then then you loose fast table lookup (i.e. values may need to be calculated).
+larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then you lose fast table lookup (i.e. values may need to be calculated).
@@ -157,2 +157,2 @@
-free programming), this imparts a much lower overhead on access to cached values than might overwise be expected - 
-typically for multiprecision types the cost of thread synchronisation is negligable, while for built in types
+free programming), this imparts a much lower overhead on access to cached values than might otherwise be expected - 
+typically for multiprecision types the cost of thread synchronisation is negligible, while for built in types
--- a/doc/sf/number_series.qbk	2014-11-23 10:41:50.000000000 +0900
+++ b/doc/sf/number_series.qbk	2014-11-25 11:35:22.000000000 +0900
@@ -68 +68 @@
-It is implemented as a direct (and very fast) table lookup, and while not recomended for general use it can be useful
+It is implemented as a direct (and very fast) table lookup, and while not recommended for general use it can be useful
@@ -79 +79 @@
-larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then then you loose fast table lookup (i.e. values may need to be calculated).
+larger indexes can be passed to `bernoulli_b2n<T>(n)`, but then you lose fast table lookup (i.e. values may need to be calculated).
@@ -159,2 +159,2 @@
-free programming), this imparts a much lower overhead on access to cached values than might overwise be expected - 
-typically for multiprecision types the cost of thread synchronisation is negligable, while for built in types
+free programming), this imparts a much lower overhead on access to cached values than might otherwise be expected - 
+typically for multiprecision types the cost of thread synchronisation is negligible, while for built in types