diff --git a/docs/modules.html b/docs/modules.html
index 1d032bc..c63795f 100644
--- a/docs/modules.html
+++ b/docs/modules.html
@@ -93,7 +93,7 @@ <h1>Modules</h1>
 ghci&gt; transpose [[1,2,3],[4,5,6],[7,8,9]]
 [[1,4,7],[2,5,8],[3,6,9]]
 ghci&gt; transpose ["hey","there","folks"]
-["htg","ehu","yey","rs","e"]
+["htf","eho","yel","rk","es"]
 </pre>
 <p>Say we have the polynomials <i>3x<sup>2</sup> + 5x + 9</i>, <i>10x<sup>3</sup> + 9</i> and <i>8x<sup>3</sup> + 5x<sup>2</sup> + x - 1</i> and we want to add them together. We can use the lists <span class="fixed">[0,3,5,9]</span>, <span class="fixed">[10,0,0,9]</span> and <span class="fixed">[8,5,1,-1]</span> to represent them in Haskell. Now, to add them, all we have to do is this:</p>
 <pre name="code" class="haskell:ghci">
diff --git a/markdown/generated_html/making-our-own-types-and-typeclasses.html b/markdown/generated_html/making-our-own-types-and-typeclasses.html
index 8d1497e..f92ee5b 100644
--- a/markdown/generated_html/making-our-own-types-and-typeclasses.html
+++ b/markdown/generated_html/making-our-own-types-and-typeclasses.html
@@ -782,9 +782,9 @@ <h2 id="type-synonyms">Type synonyms</h2>
 <code>Map Int String</code> or if we’re dealin’ with one of them
 polymorphic functions, <code>[a]</code> or
 <code>(Ord a) =&gt; Maybe a</code> and stuff. And like, sometimes me and
-my buddies say that <code>Maybe</code> is a type, but we don’t mean that,
-cause every idiot knows <code>Maybe</code> is a type constructor. When I
-apply an extra type to <code>Maybe</code>, like
+my buddies say that <code>Maybe</code> is a type, but we don’t mean
+that, cause every idiot knows <code>Maybe</code> is a type constructor.
+When I apply an extra type to <code>Maybe</code>, like
 <code>Maybe String</code>, then I have a concrete type. You know, values
 can only have types that are concrete types! So in conclusion, live
 fast, love hard and don’t let anybody else use your comb!</p>
diff --git a/markdown/generated_html/modules.html b/markdown/generated_html/modules.html
index 0265bd5..80bdc9b 100644
--- a/markdown/generated_html/modules.html
+++ b/markdown/generated_html/modules.html
@@ -157,7 +157,7 @@ <h2 id="data-list">Data.List</h2>
 <pre class="haskell:ghci"><code>ghci&gt; transpose [[1,2,3],[4,5,6],[7,8,9]]
 [[1,4,7],[2,5,8],[3,6,9]]
 ghci&gt; transpose [&quot;hey&quot;,&quot;there&quot;,&quot;folks&quot;]
-[&quot;htg&quot;,&quot;ehu&quot;,&quot;yey&quot;,&quot;rs&quot;,&quot;e&quot;]</code></pre>
+[&quot;htf&quot;,&quot;eho&quot;,&quot;yel&quot;,&quot;rk&quot;,&quot;es&quot;]</code></pre>
 <p>Say we have the polynomials <em>3x<sup>2</sup> + 5x + 9</em>,
 <em>10x<sup>3</sup> + 9</em> and <em>8x<sup>3</sup> + 5x<sup>2</sup> + x
 - 1</em> and we want to add them together. We can use the lists
@@ -984,8 +984,8 @@ <h2 id="data-map">Data.Map</h2>
 <p><code class="label function">fromListWith</code> is a cool little
 function. It acts like <code>fromList</code>, only it doesn’t discard
 duplicate keys but it uses a function supplied to it to decide what to
-do with them. Let’s say that a friend can have several numbers and we have
-an association list set up like this.</p>
+do with them. Let’s say that a friend can have several numbers and we
+have an association list set up like this.</p>
 <pre class="haskell:hs"><code>phoneBook =
     [(&quot;amelia&quot;,&quot;555-2938&quot;)
     ,(&quot;amelia&quot;,&quot;342-2492&quot;)
diff --git a/markdown/source_md/modules.md b/markdown/source_md/modules.md
index afe40b9..55629c9 100644
--- a/markdown/source_md/modules.md
+++ b/markdown/source_md/modules.md
@@ -126,7 +126,7 @@ If you look at a list of lists as a 2D matrix, the columns become the rows and v
 ghci> transpose [[1,2,3],[4,5,6],[7,8,9]]
 [[1,4,7],[2,5,8],[3,6,9]]
 ghci> transpose ["hey","there","folks"]
-["htg","ehu","yey","rs","e"]
+["htf","eho","yel","rk","es"]
 ```
 
 Say we have the polynomials *3x^2^ + 5x + 9*, *10x^3^ + 9* and *8x^3^ + 5x^2^ + x - 1* and we want to add them together.