Fixed two typos. Reverted some line breaks introduced inadvertently in the last commit.
authorMarkus Lanthaler <mark_lanthaler@gmx.net>
Tue, 30 Aug 2011 16:33:38 +0300
changeset 180 aff1a0812d3f
parent 179 989b47590876
child 189 fcf9f97177b5
Fixed two typos. Reverted some line breaks introduced inadvertently in the last commit.
spec/latest/index.html
--- a/spec/latest/index.html	Tue Aug 30 15:59:18 2011 +0300
+++ b/spec/latest/index.html	Tue Aug 30 16:33:38 2011 +0300
@@ -293,9 +293,7 @@
 JSON, as specified in [[!RFC4627]], is a simple language for representing 
 data on the Web. Linked Data is a technique for creating a graph of interlinked data across 
 different 
-documents or Web sites. Data entities are described using 
-  <tref>IRI</tref>
-  s, 
+documents or Web sites. Data entities are described using <tref>IRI</tref>s, 
 which are typically dereferencable and thus may be used to find more 
 information about an entity, creating a "Web of Knowledge". JSON-LD is intended to be a simple 
 publishing method for expressing not only Linked Data in JSON, but also for adding
@@ -309,14 +307,14 @@
 useful when building interoperable Web services and when storing Linked 
 Data in JSON-based document storage engines. It is practical and designed 
 to be as simple as possible, utilizing the large number of JSON parsers 
-and librariers available today. It is designed to be able to 
+and libraries available today. It is designed to be able to 
 express key-value pairs, RDF data, RDFa [[RDFA-CORE]] data, Microformats 
 [[MICROFORMATS]] data, and Microdata [[MICRODATA]]. That is, it supports 
 every major Web-based structured data model in use today. 
 </p>
 
 <p>
-The syntax does not necessarily require  applications to change their JSON, but 
+The syntax does not necessarily require applications to change their JSON, but 
 allows to easily add meaning by adding context in a way that is either in-band or 
 out-of-band. The syntax is designed to not disturb already deployed systems 
 running on JSON, but provide a smooth upgrade path from JSON to JSON with 
@@ -377,9 +375,7 @@
     <dd>
       An array is an ordered collection of values. An array structure is represented as square brackets surrounding zero or more values (or elements). Elements are separated by commas.  Within JSON-LD, array order is not preserved by default, unless
       specific markup is provided (see <a href="#lists">Lists</a>). This is because the basic data model of JSON-LD
-      is a 
-      directed
-      <tref>graph</tref>, which is inherently unordered.
+      is a directed <tref>graph</tref>, which is inherently unordered.
     </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. A
@@ -387,7 +383,7 @@
     </dd>
     <dt><tdef>number</tdef></dt>
     <dd>
-      A number is is similar to that used in most     programming languages, except that the octal and hexadecimal formats are not used and that leading zeros are not allowed.</dd>
+      A number is is similar to that used in most programming languages, except that the octal and hexadecimal formats are not used and that leading zeros are not allowed.</dd>
     <dt><tdef>true</tdef> and <tdef>false</tdef></dt><dd>
       Boolean values.
     </dd>
@@ -596,9 +592,7 @@
 expressing the same concept. This allows both developers to re-use each others
 data without having to agree to how their data will inter-operate on a 
 site-by-site basis. Contexts may also contain datatype information
-for certain 
-<tref>term</tref>
-s as well as other processing instructions for
+for certain <tref>term</tref>s as well as other processing instructions for
 the JSON-LD processor.</p>
 <p>Contexts may be specified in-line. This ensures that JSON-LD documents
 can be processed when a JSON-LD processor does not have access to the Web.</p>
@@ -625,15 +619,11 @@
 
 <p>
   The semantic web uses a special type of document called a 
-  <em>Web Vocabulary</em> to define <tref>term</tref>
-  s. Typically, these Web Vocabulary documents have 
-  <tref>prefix</tref>es associated
+  <em>Web Vocabulary</em> to define <tref>term</tref>s.
+  Typically, these Web Vocabulary documents have <tref>prefix</tref>es associated
   with them and contain a number of <tref>term</tref> declarations. A
-  <tdef>prefix</tdef>, like a <tref>term</tref>
-  , is a short word that expands
-  to a Web Vocabulary base IRI. 
-  <tref>Prefix</tref>
-  es are helpful when a developer
+  <tdef>prefix</tdef>, like a <tref>term</tref>, is a short word that expands
+  to a Web Vocabulary base IRI. <tref>Prefix</tref>es are helpful when a developer
   wants to mix multiple vocabularies together in a context, but does not want
   to go to the trouble of defining every single term in every single vocabulary.
   Some Web Vocabularies may have dozens of terms defined. If a developer wants to use 
@@ -764,7 +754,7 @@
 <pre class="example" data-transform="updateExample">
 <!--
 {
-  "****@context****": {"****foag****": "****http://xmlns.com/foaf/0.1/****"},
+  "****@context****": {"****foaf****": "****http://xmlns.com/foaf/0.1/****"},
 ...
   "****foaf:name****": "Manu Sporny",
 ...
@@ -935,9 +925,8 @@
 
 <p>
   A value with an associated datatype, also known as a 
-  <tdef>typed literal</tdef>
-  , is indicated by associating a literal with
-  an IRI which indicates the  literal's datatype. Typed literals may be 
+  <tdef>typed literal</tdef>, is indicated by associating a literal with
+  an IRI which indicates the literal's datatype. Typed literals may be 
   expressed in JSON-LD in three ways:
 </p>
 
@@ -2050,9 +2039,7 @@
   <h2>IRI Expansion</h2>
   <p>Keys and some values are evaluated to produce an IRI. This section defines an algorithm for
     transforming a value representing an IRI into an actual IRI.</p>
-  <p>IRIs may be represented as an explicit string, as a 
-    <tref>CURIE</tref>
-    , or as a value relative to <code>@base</code>
+  <p>IRIs may be represented as an explicit string, as a <tref>CURIE</tref>, or as a value relative to <code>@base</code>
     or <code>@vocab</code>.</p>
   <p>The algorithm for generating an IRI is:
     <ol class="algorithm">
@@ -2061,8 +2048,7 @@
       <li>If the <tref>active context</tref> contains a mapping for <em>prefix</em>, generate an IRI
         by prepending the mapped prefix to the (possibly empty) suffix using textual concatenation. Note that an empty
         suffix and no suffix (meaning the value contains no ':' string at all) are treated equivalently.</li>
-      <li>If the IRI being processed is for a property (i.e., a key's value in a 
-        <tref>JSON object</tref>, or a
+      <li>If the IRI being processed is for a property (i.e., a key's value in a <tref>JSON object</tref>, or a
         value in a <code>@coerce</code> mapping) and the active context has a <code>@vocab</code> mapping,
         join the mapped value to the suffix using textual concatenation.</li>
       <li>If the IRI being processed is for a subject or object (i.e., not a property) and the active context has a <code>@base</code> mapping,
@@ -2089,8 +2075,7 @@
       <li>If a complete match is not found, search for a partial match from
         the beginning of the IRI. For all matches that are found, the resulting
         compacted IRI is the <tref>prefix</tref> associated with the partially
-        matched IRI in the <tref>active context</tref> 
-        concatenated with a 
+        matched IRI in the <tref>active context</tref> concatenated with a 
         colon (:) character and the unmatched part of the string. If there is
         more than one compacted IRI produced, the final value is the 
         shortest and lexicographically least value of the entire set of compacted IRIs.</li>