--- a/ldpatch.html	Fri Nov 21 15:17:52 2014 -0500
+++ b/ldpatch.html	Fri Nov 21 15:26:18 2014 -0500
@@ -446,13 +446,13 @@
       <section id="path-expression">
         <h2><dfn>Path Expression</dfn></h2>
         <p>
-            A path expression can be used to locate RDF nodes within the <a>target graph</a>. A path expression consists of a series of one or more <a>Step</a>s or <a>Constraint</a>s, separated by "<code>/</code>", and optionally beginning with "<code>/</code>". The main goal is to allow addressing a blank node by “walking” the arcs of the graph from an already identified node. 
+            A <a>Path expression</a> can be used to locate RDF nodes within the <a>target graph</a>. A path expression consists of a series of one or more <a>Step</a>s or <a>Constraint</a>s, separated by "<code>/</code>", and optionally beginning with "<code>/</code>". The main goal is to allow addressing a blank node by “walking” the arcs of the graph from an already identified node. 
         </p>
         <p>
             A <dfn>Step</dfn> can be of three kinds:
         </p>
         <ul>
-          <li>A <dfn>StepForward</dfn> is defined by an IRI <var>p</var>, and consists in following the corresponding outgoing arcs: <var>N</var> is replaced by the set of the objects of all triples from the <a>target graph</a> with predicate <var>p</a> and their subject in <var>N</var>.</li>
+            <li>A <dfn>StepForward</dfn> is defined by an IRI <var>p</var>, and consists in following the corresponding outgoing arcs: <var>N</var> is replaced by the set of the objects of all triples from the <a>target graph</a> with predicate <var>p</var> and their subject in <var>N</var>.</li>
           <li>A <dfn>StepBackward</dfn> is defined by an IRI <var>p</var> preceded with the caret ("<code>^</code>") sign, and consists in following the corresponding incoming arcs: <var>N</var> is replaced by the set of the subjects of all triples from the <a>target graph</a> with predicate <var>p</var> and their object in <var>N</var>.</li>
           <li>A <dfn>StepAt</dfn> is defined by an integer <i>n</i>, and consists in following <var>n</var> <code>rdf:rest</code> arcs and one <code>rdf:first</code> arc in order to reach the corresponding member of an RDF collection. It is equivalent to a sequence of <var>n</var>+1 <a>StepForward</a>s with the corresponding IRIs.</li>
         </ul>
@@ -530,7 +530,7 @@
 The <a>Delete</a> operation is used to remove RDF triples from the <a>target graph</a>.
           </p>
           <p>
-It has a single argument: an <a>argument graph</a> <var>g</var>. All triples in <var>g</var> must be removed from the <var>target graph</var>. It MUST fail if one of those triples does not exists in the <a>target graph</a>. Blank nodes identifiers are allowed in <a>Delete</a> statements but <a href="#blank-node-scoping">they remain scoped to the LD Patch document</a>, so they can only match a blank node previously added by the same LD Patch document.
+It has a single argument: an <a>argument graph</a> <var>g</var>. All triples in <var>g</var> must be removed from the <var>target graph</var>. It fails if one of those triples does not exist in the <a>target graph</a>. Blank nodes identifiers are allowed in <a>Delete</a> statements but <a href="#blank-node-scoping">they remain scoped to the LD Patch document</a>, so they can only match a blank node previously added by the same LD Patch document.
           </p>
           <pre class='example'>
 Delete { &lt;#&gt; profile:first_name "Tim" } .
@@ -543,7 +543,7 @@
         <section id="cut-statement">
           <h2><dfn>Cut</dfn></h2>
           <p>
-            The <a>Cut</a> operation is used to remove one or more triples connected to a specific blank node <var>b</var>. More precisely, it removes from the <a>target graph</a> all the outgoing arcs of <var>b</var>, and does the same recursively for all objects of those triples being blank nodes. Finally, it removes all incoming arcs of <var>b</var>.
+            The <a>Cut</a> operation is used to remove one or more triples connected to a specific blank node <var>b</var>. More precisely, it removes all the outgoing arcs for <var>b</var> from the <a>target graph</a>, and does the same recursively for all objects of those triples being blank nodes. Finally, it removes all incoming arcs of <var>b</var>.
           <pre class='example'>
 Cut ?workLocation .
           </pre>
@@ -561,7 +561,7 @@
           </p>
 
           <p>
-              The <dfn>Slice expression</dfn> is composed of two optional positive integers <var>i<sub>min</sub></var> and <var>i<sub>max</sub></var> separated by "<code>..</code>". An omitted value is interpreted as the length of the collection. The <a>Slice expression</a> will denote the slice of the list being preceded by <var>i<sub>min</sub></var> elements, and spanning over (<var>i<sub>max</sub></var>-<var>i<sub>min</sub></var>) elements.
+              The <dfn>Slice expression</dfn> is composed of two optional positive integers <var>i<sub>min</sub></var> and <var>i<sub>max</sub></var> separated by "<code>..</code>". An omitted value is interpreted as the end of the collection. The <a>Slice expression</a> will denote the slice of the list being preceded by <var>i<sub>min</sub></var> elements, and spanning over (<var>i<sub>max</sub></var>-<var>i<sub>min</sub></var>) elements.
          </p>
          <p>
              For example, here are some <a>Slice expression</a>s for the list <code>( "lorem" "ipsum" "dolor" "sit" "amet" )</code>: