--- a/model/releases/WD-prov-dm-20120503/Overview.html Tue Apr 24 17:26:44 2012 +0200
+++ b/model/releases/WD-prov-dm-20120503/Overview.html Tue Apr 24 17:28:38 2012 +0200
@@ -2563,7 +2563,7 @@
<h3><span class="secno">4.5 </span>Component 5: Collections</h3>
<p>The fifth component of PROV-DM is concerned with the notion of collections.
-A collection is an entity that has some members. The members are themselves entities, and therefore their provenance can be expressed. Some applications need to be able to express the provenance of the collection itself: e.g. who maintains the collection, which members it contains as it evolves, and how it was assembled. The purpose of Component 5 is to define the types and relations that are useful to express the provenance of collections. In PROV, the concept of Collection is implemented by means of dictionaries. </p>
+A collection is an entity that has some members. The members are themselves entities, and therefore their provenance can be expressed. Some applications need to be able to express the provenance of the collection itself: e.g. who maintains the collection, which members it contains as it evolves, and how it was assembled. The purpose of Component 5 is to define the types and relations that are useful to express the provenance of collections. In PROV, the concept of Collection is implemented by means of dictionaries, which we introduce in this section. </p>
<p>Figure <a href="#figure-component5">figure-component5</a> depicts
the fifth component with four new classes and three associations.
@@ -2578,9 +2578,9 @@
</div>
-<p>The intent of these relations and types is to express the <em>history of changes that occurred to a dictionary</em>.
-Changes to dictionaries are about the insertion of entities in dictionaries and the removal of members from dictionaries.
-Indirectly, such history provides a way to reconstruct the contents of a dictionary.</p>
+<p>The intent of these relations and types is to express the <em>history of changes that occurred to a collection</em>.
+Changes to collections are about the insertion of entities in collections and the removal of members from collections.
+Indirectly, such history provides a way to reconstruct the contents of a collection.</p>
<div id="term-collection" class="section">
<h4><span class="secno">4.5.1 </span>Collection</h4>
@@ -2598,7 +2598,7 @@
<p>PROV-DM defines a specific type of collection: a dictionary, specified as follows.</p>
-<span class="glossary-ref"> A <dfn id="concept-dictionary">dictionary</dfn> is a collection whose members are indexed by a key. </span>
+<span class="glossary-ref"> A <dfn id="concept-dictionary">dictionary</dfn> is a collection whose members are indexed by keys. </span>
<p>Conceptually, a dictionary has a logical structure consisting of key-entity pairs. This structure is often referred to as a <em>map</em>, and is a generic indexing mechanism that can abstract commonly used data structures, including associative lists (also known as "dictionaries" in some programming languages), relational tables, ordered lists, and more. The specification of such specialized structures in terms of key-value pairs is out of the scope of this document.</p>
@@ -2636,7 +2636,7 @@
<div id="term-dictionary-insertion" class="section">
<h4><span class="secno">4.5.3 </span>Insertion</h4>
-<span class="glossary-ref"> <dfn id="concept-insertion">Insertion</dfn> is a derivation that transforms a collection into another, by insertion of one or more key-entity pairs. </span>
+<span class="glossary-ref"> <dfn id="concept-insertion">Insertion</dfn> is a derivation that transforms a dictionary into another, by insertion of one or more key-entity pairs. </span>
@@ -2712,7 +2712,7 @@
<div id="term-dictionary-removal" class="section">
<h4><span class="secno">4.5.4 </span>Removal</h4>
-<span class="glossary-ref"> <dfn id="concept-removal">Removal</dfn> is a derivation that transforms a collection into another, by removing one or more key-entity pairs. </span>
+<span class="glossary-ref"> <dfn id="concept-removal">Removal</dfn> is a derivation that transforms a dictionary into another, by removing one or more key-entity pairs. </span>
@@ -2761,7 +2761,7 @@
<h4><span class="secno">4.5.5 </span>Membership</h4>
-<span class="glossary-ref"> <dfn id="concept-membership">Membership</dfn> is the belonging of a key-entity pair to collection. </span>
+<span class="glossary-ref"> <dfn id="concept-membership">Membership</dfn> is the belonging of a key-entity pair to dictionary. </span>
<p>
The insertion and removal relations make insertions and removals explicit as part of the history of a dictionary. This, however, requires explicit mention of the state of the dictionary prior to each operation. The membership relation removes this needs, allowing the state of a dictionary <span class="name">c</span> to be expressed without having to introduce a prior state.</p>
@@ -3334,3 +3334,4 @@
</dd><dt id="bib-PROV-PRIMER">[PROV-PRIMER]</dt><dd>Yolanda Gil and Simon Miles (eds.) Khalid Belhajjame, Helena Deus, Daniel Garijo, Graham Klyne, Paolo Missier, Stian Soiland-Reyes, and Stephan Zednik <a href="http://www.w3.org/TR/prov-primer/"><cite>Prov Model Primer</cite></a>. 2011, Working Draft. URL: <a href="http://www.w3.org/TR/prov-primer/">http://www.w3.org/TR/prov-primer/</a>
</dd><dt id="bib-PROV-SEM">[PROV-SEM]</dt><dd>James Cheney <a href="http://www.w3.org/2011/prov/wiki/FormalSemanticsStrawman"><cite>Formal Semantics Strawman</cite></a>. 2011, Work in progress. URL: <a href="http://www.w3.org/2011/prov/wiki/FormalSemanticsStrawman">http://www.w3.org/2011/prov/wiki/FormalSemanticsStrawman</a>
</dd></dl></div></div></body></html>
+