--- a/spec/latest/json-ld-api/alternate2.html	Mon Feb 11 15:38:22 2013 -0500
+++ b/spec/latest/json-ld-api/alternate2.html	Mon Feb 11 16:00:55 2013 -0500
@@ -2314,14 +2314,9 @@
 </p>
 
 <p>
-The algorithm takes two required inputs and one optional input. The
-required inputs are: an <tref>active context</tref>,
+The algorithm takes two required inputs: an <tref>active context</tref>,
 and an <em>element</em> to be labeled with
-<tref title="blank node identifier">blank node identifiers</tref>. The
-optional input is a flag <em>isId</em> that indicates whether or not
-<em>element</em> represents a value that is either an <tref>IRI</tref> or
-a <tref>blank node identifier</tref>. The <em>isId</em> flag defaults to
-<tref>false</tref>.
+<tref title="blank node identifier">blank node identifiers</tref>.
 </p>
 
 <ol class="algorithm">
@@ -2331,8 +2326,8 @@
     <ol class="algorithm">
       <li>
         Replace <em>item</em> with the result of using this algorithm
-        recursively, passing <tref>active context</tref>, <em>item</em>
-        for <em>element</em>, and <em>isId</em>.
+        recursively, passing <tref>active context</tref> and <em>item</em>
+        for <em>element</em>.
       </li>
     </ol>
   </li>
@@ -2340,8 +2335,8 @@
     Otherwise, if <em>element</em> is a <tref>list object</tref>, then
     replace the value of the <code>@list</code> key in <em>element</em>
     with the result of using this algorithm recursively, passing
-    <tref>active context</tref>, the value of the <code>@list</code> key
-    for <em>element</em>, and <em>isId</em>.
+    <tref>active context</tref> and the value of the <code>@list</code> key
+    for <em>element</em>.
   </li>
   <li>
     Otherwise, if <em>element</em> is a <tref>JSON object</tref>:
@@ -2361,10 +2356,8 @@
           <li>
             If <em>key</em> does not equal <code>@id</code>, then replace
             <em>value</em> in <em>element</em> with the result of using
-            this algorithm recursively, passing <tref>active context</tref>,
-            <em>value</em> for <em>element</em>, and <tref>true</tref>
-            for <em>isId</em> if <em>key</em> equals <code>@type</code>,
-            otherwise <tref>false</tref> for <em>isId</em>.
+            this algorithm recursively, passing <tref>active context</tref>
+            and <em>value</em> for <em>element</em>.
           </li>
         </ol>
       </li>
@@ -2626,10 +2619,9 @@
                   <a href="#iri-compaction-algorithm">IRI Compaction</a>
                   algorithm, passing <tref>active context</tref>,
                   <em>expanded value</em> for <em>iri</em>,
-                  <tref>true</tref> for <em>vocabRelative</em> if
+                  and <tref>true</tref> for <em>vocabRelative</em> if
                   <em>expanded property</em> equals <code>@type</code>,
-                  <tref>false</tref> otherwise, and <tref>true</tref>
-                  for <em>documentRelative</em>.
+                  <tref>false</tref> otherwise.
                 </li>
                 <li>
                   Otherwise, <em>expanded value</em> must be a
@@ -2645,9 +2637,8 @@
                       of using the
                       <a href="#iri-compaction-algorithm">IRI Compaction</a>
                       algorithm, passing <tref>active context</tref>,
-                      <em>expanded type</em> for <em>iri</em>,
+                      <em>expanded type</em> for <em>iri</em>, and
                       <tref>true</tref> for <em>vocabRelative</em>,
-                      and <tref>true</tref> for <em>documentRelative</em>,
                       to <em>compacted value</em>.
                     </li>
                     <li>