--- a/spec/latest/json-ld-api/index.html	Mon Aug 12 14:39:44 2013 -0400
+++ b/spec/latest/json-ld-api/index.html	Mon Aug 12 14:40:51 2013 -0400
@@ -2967,7 +2967,7 @@
               <code>@list</code> member for <i>element</i>, <tref>active graph</tref>,
               <tref>active subject</tref>, <tref>active property</tref>, and
               <i>result</i> for <i>list</i>.</li>
-            <li>Append <i>result</i> to the the value of the <tref>active property</tref> member
+            <li>Append <i>result</i> to the value of the <tref>active property</tref> member
               of <i>node</i>.</li>
           </ol>
         </li>
@@ -3356,7 +3356,7 @@
       <p>For each element of the <tref>list</tref> a new <tref>blank node identifier</tref>
         is allocated which is used to generate <code>rdf:first</code> and
         <code>rdf:rest</code> <tref title="RDF triple">triples</tref>. The
-        algorithm returns the list head, which is either the the first allocated
+        algorithm returns the list head, which is either the first allocated
         <tref>blank node identifier</tref> or <code>rdf:nil</code> if the
         <tref>list</tref> is empty.</p>
     </section>
@@ -3555,7 +3555,7 @@
                       member of <i>head</i>.</li>
                     <li>Set <i>head</i> to the value of the <i>head id</i> member of
                       <i>graph object</i> so that all it's properties can be accessed.</li>
-                    <li>Then, set <i>head</i> to the the only item in the value of the
+                    <li>Then, set <i>head</i> to the only item in the value of the
                       <code>rdf:rest</code> member of <i>head</i>.</li>
                     <li>Finally, remove the last item of the <i>list</i> <tref>array</tref>
                       and the last item of the <i>list nodes</i> <tref>array</tref>.</li>
@@ -3564,7 +3564,7 @@
                 <li>Remove the <code>@id</code> member from <i>head</i>.</li>
                 <li>Reverse the order of the <i>list</i> <tref>array</tref>.</li>
                 <li>Add a <code>@list</code> member to <i>head</i> and initialize
-                  its value to the the <i>list</i> <tref>array</tref>.</li>
+                  its value to the <i>list</i> <tref>array</tref>.</li>
                 <li>For each item <i>node id</i> in <i>list nodes</i>, remove the
                   <i>node id</i> member from <i>graph object</i>.</li>
               </ol>
@@ -3579,7 +3579,7 @@
               <ol class="algorithm">
                 <li>Add a <code>@graph</code> member to <i>node</i> and initialize
                   its value to an empty <tref>array</tref>.</li>
-                <li>For each key-value pair <i>s</i>-<i>n</i> in the the <i>subject</i>
+                <li>For each key-value pair <i>s</i>-<i>n</i> in the <i>subject</i>
                   member of <i>graph map</i> ordered by <i>s</i>, append <i>n</i>
                   to the <code>@graph</code> member of <i>node</i> after
                   removing its <code>usages</code> member, unless the only
@@ -3629,7 +3629,7 @@
         to a <tref>JSON object</tref> and a flag <i>use native types</i>.</p>
 
       <ol class="algorithm">
-        <li>If <i>value</i> is an an <tref>IRI</tref> or a
+        <li>If <i>value</i> is an <tref>IRI</tref> or a
           <tref>blank node identifier</tref>, return a new <tref>JSON object</tref>
           consisting of a single member <code>@id</code> whose value is set to
           <i>value</i>.</li>
@@ -4230,7 +4230,7 @@
           <tref>null</tref> and thus invalid.</dd>
         <dt>colliding keywords</dt>
         <dd>Two properties which expand to the same keyword have been detected.
-          This might occur if a <tref>keyword</tref> and an an alias thereof
+          This might occur if a <tref>keyword</tref> and an alias thereof
           are used at the same time.</dd>
         <dt>invalid container mapping</dt>
         <dd>An <code>@container</code> member was encountered whose value was