final read-through, small errors corrected
authorGuus Schreiber <guus.schreiber@vu.nl>
Mon, 24 Feb 2014 12:26:32 +0100
changeset 2006 6597dc9da577
parent 2005 2eb717e55295
child 2007 13b151a0b771
final read-through, small errors corrected
rdf-primer/index.html
--- a/rdf-primer/index.html	Mon Feb 24 10:56:42 2014 +0100
+++ b/rdf-primer/index.html	Mon Feb 24 12:26:32 2014 +0100
@@ -401,10 +401,10 @@
       to be able to talk about resources without bothering to use a global
       identifier.  For example, we might want to state that the Mona
       Lisa painting has in its background an unidentified tree which
-      we know to be a cypress tree. Resources without identifiers such as the 
-      painting's cypress tree can be represented by <a 
-      href="http://www.w3.org/TR/2014/REC-rdf11-concepts-20140225/#section-blank-nodes">"blank 
-      nodes"</a> in RDF. Blank nodes are like simple
+      we know to be a cypress tree. A resource without a global identifier, such as the 
+      painting's cypress tree, can be represented in RDF by a <a 
+      href="http://www.w3.org/TR/2014/REC-rdf11-concepts-20140225/#section-blank-nodes">blank 
+      nodes</a>. Blank nodes are like simple
       variables in algebra; they represent some thing without saying
       what their value is.
       </p>
@@ -429,7 +429,7 @@
       <h3>Multiple graphs</h3>
 
       <p>RDF provides a mechanism to group RDF statements in multiple
-      graphs and associate graphs with an IRI . Multiple graphs are a recent extension of the RDF
+      graphs and associate such graphs with an IRI . Multiple graphs are a recent extension of the RDF
       data model. In practice, RDF tool builders and data managers
       needed a mechanism to talk about subsets of a collection of
       triples. Multiple graphs were first introduced in the RDF query
@@ -443,7 +443,7 @@
       at most one unnamed ("default") graph. </p><p> 
 
       <p>For example, the
-      statements in the <a href="#example1">Example&nbsp;1</a>
+      statements in <a href="#example1">Example&nbsp;1</a>
       could be grouped in two named
       graphs. A first graph could be provided by a social networking
       site and identified by <code>http://example.org/bob</code>:</p> 
@@ -519,7 +519,7 @@
     resources. </p>
 
     <p>To support the definition of vocabularies RDF provides
-    the RDF-Schema language
+    the RDF Schema language
     [[RDF11-SCHEMA]]. This language allows one to define semantic
     characteristics of
     RDF data. For example, one can state that the IRI 
@@ -530,13 +530,13 @@
     <p>RDF Schema uses the notion of <strong>class</strong> to
     specify categories that can be used to classify resources. The
     relation between an instance and its class is stated through the
-    <strong>type</strong> property. One can create create hierarchies
+    <strong>type</strong> property. With RDF Schema one can create hierarchies
     of classes and sub-classes and of
     properties and sub-properties. Type restrictions on the subjects
     and objects of particular triples can be defined through
     <strong>domain</strong> and <strong>range</strong>
     restrictions. An example of a domain restriction was given above:
-    subjects of "friendOf"  triples should be ofn class "Person".</p>
+    subjects of "friendOf"  triples should be of class "Person".</p>
 
     <p>The main modeling
     constructs provided by RDF Schema are summarized in the table below:</p>
@@ -612,13 +612,13 @@
 <a href="#example1">Example&nbsp;1</a>), properties like this are themselves resources that can be 
 described by triples or provide values in the descriptions of other 
 resources. In this example, <code>&lt;is a friend of&gt;</code> is the subject of triples 
-that assign type, domain, and range values to it, and it's the object of 
+that assign type, domain, and range values to it, and it is the object of 
 a triple that describes something about the <code>&lt;is a good friend of&gt;</code> 
 property.
 
-<p>One of first RDF vocabularies used worldwide was the
+<p>One of the first RDF vocabularies used worldwide was the
 <a href="http://www.foaf-project.org/">"Friend of a Friend"</a> (FOAF)
-vocabulary for describing social networks. Other typical examples of RDF
+vocabulary for describing social networks. Other examples of RDF
 vocabularies are:</p>
 
 <dl>
@@ -678,7 +678,7 @@
 
 <p class="note">
 Reading tip: Sec. 5.1 (Turtle <em>et al.</em>) discusses all
-basic ooncepts for serializing RDF. We suggest you
+basic concepts for serializing RDF. We suggest you
 read the sections on JSON-LD, RDFa and RDF/XML only if you are
 interested in that particular usage of RDF. </p>
 
@@ -735,7 +735,7 @@
 <p>The figure below shows the triples resulting from the example:</p>
 
     <figure id="fig4">
-      <img class="graph" src="example-graph-iris.jpg" 
+      <img style="width: 75%" src="example-graph-iris.jpg" 
                 alt="Graph of the sample triples">
       <figcaption>RDF graph resulting from the N-Triples example</figcaption>
     </figure>
@@ -811,7 +811,7 @@
 
 <h5>Representation of blank nodes</h5>
 
-<p>Below is syntactic variants for writing down blank nodes, using the
+<p>Below we see two syntactic variants for writing down blank nodes, using the
 earlier cypress tree example:</p>  
 
 <pre class="example" title="Blank node">
@@ -828,7 +828,7 @@
 for the informal graph in <a href="#fig2">Fig.&nbsp;2</a>.</p>
 
 <p>Turtle also has an alternative notation for blank nodes, which
-does not require the use of the syntax like <code>_:x</code>: </p> 
+does not require the use of syntax like <code>_:x</code>: </p> 
 
 <pre class="example" title="Blank nodes (alternative notation)">
 @prefix foaf: &lt;http://xmlns.com/foaf/0.1/&gt; .
@@ -841,7 +841,7 @@
           dcterms:creator &lt;http://dbpedia.org/resource/Leonardo_da_Vinci&gt; ] .
 </pre>
 
-<p>Square brackets represent a blank node. Predicate-object pairs within
+<p>Square brackets represent here a blank node. Predicate-object pairs within
 the square brackets are interpreted as triples with the blank node as
 subject. Lines starting with '#' represent
 comments. </p>
@@ -915,7 +915,7 @@
     <p>The figure below shows the triples resulting from this example.</p>
 
     <figure id="fig5">
-      <img class="graph" src="example-multiple-graphs-iris.jpg" 
+      <img style="width: 75%" src="example-multiple-graphs-iris.jpg" 
                 alt="Triples resulting from the TriG example">
       <figcaption>Triples resulting from the TriG example</figcaption>
     </figure>
@@ -1039,7 +1039,7 @@
 </pre>
 
       <p>This context describes how a JSON-LD document can be mapped
-      to an RDF graph. On lines 4 to 9 it will describe how to map
+      to an RDF graph. Lines 4 to 9 specify how to map
       <code>Person</code>, <code>interest</code> and <code>knows</code>
       to types and properties in the FOAF namespace defined
       on line 3. We also specify on line 8 that the <code>knows</code>
@@ -1052,10 +1052,10 @@
 
       <p>From line 16 to line 23 we describe how to map
       <code>title</code>, <code>creator</code> and <code>subject_of</code>
-      to Dublin Core property IRIs. In particular the <code>@reverse</code>
-      keyword on line 21 means that whenever we
+      to Dublin Core property IRIs. The <code>@reverse</code>
+      keyword on line 21 is used to specify that, whenever we
       encounter <code>"subject_of": "x"</code> in a JSON-LD document using this
-      context we will map it to an RDF triple which subject is the <code>x</code>
+      context, we should map it to an RDF triple which subject is the <code>x</code>
       IRI, which property is <code>dcterms:subject</code> and
       which object is the resource corresponding to the parent JSON object.</p>
 
@@ -1165,7 +1165,7 @@
 <h3>RDF/XML</h3>
 
 <p>RDF/XML [[RDF-SYNTAX-GRAMMAR]] provides an XML syntax for RDF
-graphs. When RDF was original developed in the late 1990s, this was its 
+graphs. When RDF was originally developed in the late 1990s, this was its 
 only syntax, and some people still call this syntax "RDF". In 2001, a 
 precursor to Turtle called "N3" was proposed, and gradually the other 
 languages listed here have been adopted and standardized. </p>
@@ -1253,7 +1253,7 @@
       <li>The IRIs used to name the subject, predicate, and object are "global" in scope,
     naming the same thing each time they are used.</li>
       <li>Each triple is "true" exactly when the predicate relation actually exists between
-    the subject and the predicate.</li>
+    the subject and the object.</li>
       <li>An RDF graph is "true" exactly when all the triples in it are "true".</li>
     </ol>
     <p>These notions,
@@ -1265,7 +1265,7 @@
     certain set of input triples which they accept as true, systems
     can in some circumstances deduce that other triples must,
     logically, also be true. We say the first set of triples "entails"
-    the additional triples. These systems, called Reasoners, can also
+    the additional triples. These systems, called "reasoners", can also
     sometimes deduce that the given input triples contradict each
     other. </p> 
 
@@ -1274,13 +1274,13 @@
     different kinds of reasoning one might want to do.  When a
     specific kind of reasoning seems to be useful in many different
     applications, it can be documented as an <a
-    href="http://www.w3.org/TR/rdf11-mt/#semantic-extensions-and-entailment-regimes">"entailment regime"</a>.
+    href="http://www.w3.org/TR/rdf11-mt/#semantic-extensions-and-entailment-regimes">entailment regime</a>.
     Several entailment regimes are specified in RDF Semantics.     For
-    technical description of some other entailment regimes and how to
-    use them with SPARQL, see [[SPARQL11-ENTAILMENT]]. 
+    technical descriptions of some other entailment regimes and how to
+    use these with SPARQL, see [[SPARQL11-ENTAILMENT]]. 
     Note that some 
     entailment regimes are fairly easy to implement and reasoning can
-    be done quickly, while others require a very sophistical
+    be done quickly, while others require sophisticated
     techniques to implement efficiently. </p> 
    
     <p>As a sample entailment, consider the following two statements:</p>
@@ -1351,7 +1351,7 @@
 
       <li><a href="http://www.w3.org/2006/03/wn/wn20/">WordNet</a>, 
       a lexical database of English terms, grouped in sets
-      of synonyms, with a range of semantic interrelations.Similar
+      of synonyms, with a range of semantic interrelations. Similar
       databases exist for other languages.</li> 
   
       <li><a href="http://www.europeana.eu/">Europeana</a>, publishing
@@ -1411,7 +1411,7 @@
     Hayes, Ivan Herman, Kingsley Idehen, Antoine Isaac, Markus Lanthaler, and David Wood. </p>
  
 
-<p>The introduction contains a number of sentences from the
+<p>The introduction of this document contains a number of sentences from the
    2004 Primer [[RDF-PRIMER]]. For the rest the RDF 1.1 Primer is a completely
    new document.</p>