--- a/spec/latest/json-ld-api/index.html Fri Mar 29 11:06:27 2013 +0100
+++ b/spec/latest/json-ld-api/index.html Fri Mar 29 12:28:53 2013 +0100
@@ -202,9 +202,9 @@
transform JSON-LD documents so that they may be more easily consumed by
specific applications.</p>
- <p>The way JSON-LD allows Linked Data to be expressed in a way that is
- specifically tailored to a particular person or application is by
- providing a <tref>context</tref>. By providing a <tref>context</tref>,
+ <p>JSON-LD uses <tref title="context">contexts</tref> to allow Linked Data
+ to be expressed in a way that is specifically tailored to a particular
+ person or application. By providing a <tref>context</tref>,
JSON data can be expressed in a way that is a natural fit for a particular
person or application whilst also indicating how the data should be
understood at a global scale. In order for people or applications to
@@ -228,8 +228,8 @@
<p>The algorithm that removes <tref>context</tref> is
called <tdef>expansion</tdef>. Before performing any other
transformations on a JSON-LD document, it is easiest to
- remove any <tref>context</tref> from it, localizing all information,
- and to make data structures more regular.</p>
+ remove any <tref>context</tref> from it and to make data structures
+ more regular.</p>
<p>To get an idea of how context and data structuring affects the same data,
here is an example of JSON-LD that uses only <tref title="term">terms</tref>
@@ -402,7 +402,7 @@
useful to humans, it is also used to generate structures that are easy to
program against. Compaction enables developers to map any expanded document
into an application-specific compacted document. While the context provided
- above mapped <code>http://xmlns.com/foaf/0.1/nam</code> to <code>name</code>, it
+ above mapped <code>http://xmlns.com/foaf/0.1/name</code> to <code>name</code>, it
could also have been mapped to any other term provided by the developer.</p>
</section> <!-- end of Compaction -->
@@ -501,9 +501,9 @@
-->
</pre>
- <p>Please note that the flattened and compacted result always explicitly
- designates the default graph by the <code>@graph</code> member in the
- top-level <tref>JSON object</tref>.</p>
+ <p>Please note that the result of flattening and compacting a document
+ is always a <tref>JSON object</tref> which contains an <code>@graph</code>
+ member that represents the <tref>default graph</tref>.</p>
</section> <!-- end of Flattening -->
<section class="informative">
@@ -609,12 +609,14 @@
in JSON-LD the keys in an object must be unique.</dd>
<dt><tdef>array</tdef></dt>
<dd>An array structure is represented as square brackets surrounding zero
- or more values (or elements). Elements are separated by commas.
+ or more values. Values are separated by commas.
In JSON, an array is an <em>ordered</em> sequence of zero or more values.
While JSON-LD uses the same array representation as JSON,
the collection is <em>unordered</em> by default. While order is
preserved in regular JSON arrays, it is not in regular JSON-LD arrays
- unless specific markup is provided (see <a href="#sets-and-lists"></a>).</dd>
+ unless specifically defined (see
+ <cite><a href="../json-ld/#sets-and-lists">Sets and Lists</a></cite> in
+ the JSON-LD specification [[JSON-LD]]).</dd>
<dt><tdef>string</tdef></dt>
<dd>A string is a sequence of zero or more Unicode characters,
wrapped in double quotes, using backslash escapes (if necessary). A
@@ -640,11 +642,11 @@
<dl>
<dt><tdef>keyword</tdef></dt>
- <dd>A JSON key that is specific to JSON-LD, specified in the JSON-LD Syntax specification [[!JSON-LD]]
+ <dd>A JSON key that is specific to JSON-LD, specified in the JSON-LD specification [[!JSON-LD]]
in the section titled
<cite><a href="../json-ld/#syntax-tokens-and-keywords">Syntax Tokens and Keywords</a></cite>.</dd>
<dt><tdef>context</tdef></dt>
- <dd>A set of rules for interpreting a JSON-LD document as specified in
+ <dd>A set of rules for interpreting a JSON-LD document as specified in the section
<cite><a href="../json-ld/#the-context">The Context</a></cite> of the
[[!JSON-LD]] specification.</dd>
<dt><tdef>JSON-LD document</tdef></dt>
@@ -679,9 +681,8 @@
<dd>A relative IRI is an IRI that is relative some other <tref>absolute IRI</tref>;
in the case of JSON-LD this is the base location of the document.</dd>
<dt><tdef>blank node</tdef></dt>
- <dd>A <tref>node</tref> in a <tref>JSON-LD graph</tref> that does not contain a de-referenceable
- identifier because it is either ephemeral in nature or does not contain information that needs to be
- linked to from outside of the JSON-LD graph.</dd>
+ <dd>A <tref>node</tref> in a <tref>JSON-LD graph</tref> that is neither an
+ <tref>IRI</tref>, nor a <tref>JSON-LD value</tref>, nor a <tref>list</tref>.</dd>
<dt><tdef>blank node identifier</tdef></dt>
<dd>A blank node identifier is a string that can be used as an identifier for a
<tref>blank node</tref> within the scope of a JSON-LD document. Blank node identifiers
@@ -3269,13 +3270,7 @@
<p>This algorithm converts an <tref>RDF dataset</tref> consisting of a
<tref>default graph</tref> and zero or more
- <tref title="named graph">named graphs</tref> into a JSON-LD document.</p>
-
- <p>In some cases, data exists natively in the form of triples or
- <tref title="triple">triples</tref>; for example, if the data was
- originally represented in an <tref>RDF dataset</tref>. This algorithm is
- designed to simply translate an array of <tref title="triple">triples</tref>
- into a JSON-LD document.</p>
+ <tref title="named graph">named graphs</tref> into a JSON-LD document.</p>
<p class="note">This algorithm does not support lists containing lists.</p>
@@ -4021,7 +4016,7 @@
Bradley P. Allen, Kingsley Idehen, Glenn McDonald, Alexandre Passant,
Danny Ayers, Ted Thibodeau Jr., Olivier Grisel, Josh Mandel, Eric Prud'hommeaux,
David Wood, Guus Schreiber, Pat Hayes, Sandro Hawke, and Richard Cyganiak
- or their input on the specification.</p>
+ for their input on the specification.</p>
</section>
</body>