--- a/dictionary/Overview.html	Wed Apr 10 11:20:04 2013 +0200
+++ b/dictionary/Overview.html	Wed Apr 10 11:45:02 2013 +0200
@@ -866,7 +866,7 @@
 
 <p>
 An Insertion relation <span class="name">prov:derivedByInsertionFrom(id; d2, d1,  {(key_1, e_1), ..., (key_n, e_n)})</span> states that  <span class="name">d2</span> is the dictionary
-following the insertion of key-entity pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span> into dictionary  <span class="name">d1</span>. In other words, the set of key-entity pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span> is to be seen as the difference between <span class="name">d1</span> and <span class="name">d2</span>.
+following the insertion of key-entity pairs <span class="name">(key_1, e_1)</span>, ..., <span class="name">(key_n, e_n)</span> into dictionary  <span class="name">d1</span>. In other words, the set of key-entity pairs <span class="name">{(key_1, e_1), ...,(key_n, e_n)}</span> is to be seen as the difference between <span class="name">d1</span> and <span class="name">d2</span>.
 Note that this key-entity-set is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary derived by an insertion relation. This is formalized in <a href="#insertion-removal-membership-inference">Inference D8</a>.</p>
 
 <div class="anexample">
@@ -933,7 +933,7 @@
 </div>
 
 <p>A Removal relation <span class="name">prov:derivedByRemovalFrom(id; d2,d1, {key_1, ..., key_n})</span> states that  <span class="name">d2</span> is  the  dictionary following the removal of the set of pairs corresponding to keys  <span class="name">key_1...key_n</span> from  <span class="name">d1</span>. If a key that is not present in the dictionary is removed, the dictionary remains unchanged.
-  Note that removal and the specified key-set are considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary after a removal. This is formalized in <a href="#insertion-removal-membership-inference">Inference D8</a>.
+  In other words, the key-set <span class="name">{key_1,...,key_n}</span> is to be seen as the difference in keys and corresponding entities between <span class="name">d1</span> and <span class="name">d2</span>. Note that this key-set is considered to be complete. This means that we assume that no unknown keys were inserted in or removed from a dictionary derived by a removal relation. This is formalized in <a href="#insertion-removal-membership-inference">Inference D8</a>.
 </p>
 
 <div class="anexample">