--- a/glossary/index.html Tue Mar 26 15:31:12 2013 -0400
+++ b/glossary/index.html Tue Mar 26 15:49:28 2013 -0400
@@ -18,7 +18,7 @@
<section id="abstract">
-<p> This document is a glossary of terms defined and used to describe Linked Data, and its associated vocabularies and <a href="https://dvcs.w3.org/hg/gld/raw-file/default/bp/index.html">Best Practices</a>. This document published by the <a href="http://www.w3.org/2011/gld/charter">W3C Government Linked Data Working Group</a> as a Working Group Note, is intended to help information management professionals, Web developers, scientists and the general public better understand publishing structured data using <a href="#linked-data-principles">Linked Data Principles</a>.
+<p> This document is a glossary of terms defined and used to describe Linked Data, and its associated vocabularies and <a href="https://dvcs.w3.org/hg/gld/raw-file/default/bp/index.html" target="_blank">Best Practices</a>. This document published by the <a href="http://www.w3.org/2011/gld/charter" target="_blank">W3C Government Linked Data Working Group</a> as a Working Group Note, is intended to help information management professionals, Web developers, scientists and the general public better understand publishing structured data using <a href="#linked-data-principles">Linked Data Principles</a>.
</section>
<section id="sotd">
@@ -32,7 +32,7 @@
<section>
<h4>5 Star Linked Data</h4>
-5 Star Linked Data refers to an incremental framework for deploying data. Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://linkeddata.org">Linked Data project</a>, suggested a 5 star deployment scheme for Linked Data. The 5 Star Linked Data system is cumulative. Each additional star presumes the data meets the criteria of the previous step(s).
+5 Star Linked Data refers to an incremental framework for deploying data. Tim Berners-Lee, the inventor of the Web and initiator of the <a href="http://linkeddata.org" target="_blank">Linked Data project</a>, suggested a 5 star deployment scheme for Linked Data. The 5 Star Linked Data system is cumulative. Each additional star presumes the data meets the criteria of the previous step(s).
<p class="highlight">☆ <b>Data is available on the Web, in whatever format.</b>
</p>
@@ -49,7 +49,7 @@
<p class="highlight">☆☆☆☆☆ <b>All of the above and links to other Linked Open Data.</b>
</p>
<p>
-An easy to read graphic for explaining the 5 Star Linked Data model may be seen on the <a href="http://www.cafepress.com/w3c_shop">5 Star Linked Open Data mug</a>. One reads both green labels for <a href="#linked-open-data">Linked Open Data</a>, or neither green label for <a href="#linked-data">Linked Data</a>. The <a href="http://5stardata.info/" target="_blank">5 Open Data diagram</a> is a graphical representation of each of the 5 Star techniques as described by Tim Berners-Lee.
+An easy to read graphic for explaining the 5 Star Linked Data model may be seen on the <a href="http://www.cafepress.com/w3c_shop" target="_blank">5 Star Linked Open Data mug</a>. One reads both green labels for <a href="#linked-open-data">Linked Open Data</a>, or neither green label for <a href="#linked-data">Linked Data</a>. The <a href="http://5stardata.info/" target="_blank">5 Open Data diagram</a> is a graphical representation of each of the 5 Star techniques as described by Tim Berners-Lee.
</section>
<section>
@@ -69,12 +69,12 @@
<section>
<h4>Creative Commons Licenses</h4>
-Creative Commons copyright licenses and tools aim to forge a balance inside the traditional “all rights reserved” setting that copyright law creates. Creative Commons licenses and tools provide a simple, standardized way to grant copyright permissions to their creative work. The combination of our tools and our users is a vast and growing digital commons, a pool of content that can be copied, distributed, edited, remixed, and built upon, all within the boundaries of copyright law. See also <a href="http://creativecommons.org/licenses/" taget="blank">About Creative Commons Licenses</a>.
+Creative Commons copyright licenses and tools aim to forge a balance inside the traditional “all rights reserved” setting that copyright law creates. Creative Commons licenses and tools provide a simple, standardized way to grant copyright permissions to their creative work. The combination of our tools and our users is a vast and growing digital commons, a pool of content that can be copied, distributed, edited, remixed, and built upon, all within the boundaries of copyright law. See also <a href="http://creativecommons.org/licenses/" target="_blank">About Creative Commons Licenses</a>.
</section>
<section>
<h4>CC-BY-SA License</h4>
-CC-BY-SA is a form of Creative Commons license for resources released online. Work available under a <a href="http://creativecommons.org/licenses/by-sa/3.0/" taget="blank">CC-BY-SA license</a> means you can include it in any other work under the condition that you give proper attribution. If you create derivative works (such as modified or extended versions), then you must also license them as CC-BY-SA.
+CC-BY-SA is a form of Creative Commons license for resources released online. Work available under a <a href="http://creativecommons.org/licenses/by-sa/3.0/" target="_blank">CC-BY-SA license</a> means you can include it in any other work under the condition that you give proper attribution. If you create derivative works (such as modified or extended versions), then you must also license them as CC-BY-SA.
</section>
<section>
@@ -94,7 +94,7 @@
<section>
<h4>Content Negotiation</h4>
-Content negotiation, often called "conneg", refers to a phase in establishing a network connection. It is a mechanism for selecting the appropriate representation when servicing a request. The representation of entities in any response can be negotiated (including error responses). See also [<a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#content.negotiation" target="blank">HTTP Protocol 1.1</a>]. See also <a href="#connection">Connection</a>.
+Content negotiation, often called "conneg", refers to a phase in establishing a network connection. It is a mechanism for selecting the appropriate representation when servicing a request. The representation of entities in any response can be negotiated (including error responses). See also [<a href="http://www.w3.org/Protocols/HTTP/1.1/rfc2616bis/draft-lafon-rfc2616bis-03.html#content.negotiation" target="_blank">HTTP Protocol 1.1</a>]. See also <a href="#connection">Connection</a>.
</section>
<section >
@@ -119,7 +119,7 @@
<section >
<h4>Data Cloud</h4>
-Data cloud, also called the <a href="http://richard.cyganiak.de/2007/10/lod/" target="_blank">Linked Data Cloud</a>, is a visual representation of datasets published as Linked Data. Using metadata generated by directories, including CKAN, the project records datasets by domain. The Linked Data Cloud has doubled in size every 10 months since 2007 and as of late 2012 consists of more than 300 data sets from various domains, including geography, media, government and life sciences, according the [<a href="http://lod-cloud.net/state/">State of the LOD Cloud</a>], website and visualizations maintained by C. Bizer, A. Jentzsch, R. Cyganiak. The original data owners/stewards publish one third of the data contained in the Linked Open Data Cloud, while third parties publish 67%. Many academic institutions republish data from their respective governments as <a href="#linked-data">Linked Data</a>, often enhancing the representation in the process.
+Data cloud, also called the <a href="http://richard.cyganiak.de/2007/10/lod/" target="_blank">Linked Data Cloud</a>, is a visual representation of datasets published as Linked Data. Using metadata generated by directories, including CKAN, the project records datasets by domain. The Linked Data Cloud has doubled in size every 10 months since 2007 and as of late 2012 consists of more than 300 data sets from various domains, including geography, media, government and life sciences, according the [<a href="http://lod-cloud.net/state/" target="_blank">State of the LOD Cloud</a>], website and visualizations maintained by C. Bizer, A. Jentzsch, R. Cyganiak. The original data owners/stewards publish one third of the data contained in the Linked Open Data Cloud, while third parties publish 67%. Many academic institutions republish data from their respective governments as <a href="#linked-data">Linked Data</a>, often enhancing the representation in the process.
</section >
<section >
@@ -144,7 +144,7 @@
<section >
<h4>DBpedia</h4>
-DBpedia is a community effort to extract structured information from Wikipedia and make it available on the Web. DBpedia is often depicted as a hub for the <a href="#data-cloud">Data Cloud</a>. An RDF representation of the metadata derived from Wikipedia is made available for SPARQL queries and linking to other datasets on the Web. DBpedia also provides a human readable version of the structured content. For example, the human readable version of Linked Data for the color "Red" is found on DBpedia at <a href="http://dbpedia.org/page/Red">http://dbpedia.org/page/Red</a>. See also [<a href="#curl">curl</a>].
+DBpedia is a community effort to extract structured information from Wikipedia and make it available on the Web. DBpedia is often depicted as a hub for the <a href="#data-cloud">Data Cloud</a>. An RDF representation of the metadata derived from Wikipedia is made available for SPARQL queries and linking to other datasets on the Web. DBpedia also provides a human readable version of the structured content. For example, the human readable version of Linked Data for the color "Red" is found on DBpedia at <a href="http://dbpedia.org/page/Red" target="_blank">http://dbpedia.org/page/Red</a>. See also [<a href="#curl">curl</a>].
</section >
<section>
@@ -164,7 +164,7 @@
<section>
<h4>DCMI</h4>
-See <a href="#dublin-core-metadata-initiative">Dublin Core Metadata Initiative</a>
+See <a href="#dublin-core-metadata-initiative" target="_blank">Dublin Core Metadata Initiative</a>
</section>
<section>
@@ -179,12 +179,12 @@
<section>
<h4>Domain Name System (DNS)</h4>
-Domain Name System (DNS) refers to the Internet's mechanism for mapping between a human-readable host name (e.g. <a href="http://www.example.com">www.example.com</a>) and an Internet Protocol (IP) Address (e.g. 203.20.51.10).
+Domain Name System (DNS) refers to the Internet's mechanism for mapping between a human-readable host name (e.g. <a href="http://www.example.com" target="_blank">www.example.com</a>) and an Internet Protocol (IP) Address (e.g. 203.20.51.10).
</section>
<section>
<h4>Dublin Core Metadata Element Set</h4>
-Dublin Core Metadata Element Set refers to a <a href="#vocabulary">vocabulary</a> of fifteen properties for use in resource descriptions, such as may be found in a library card catalog (creator, publisher, etc). The Dublin Core Metadata Element Set, also known as "DC Elements", is the most commonly used vocabulary for Linked Data applications. See also <a href="http://dublincore.org/documents/dces/"> Dublin Core Element Set, Version 1.1 Specification.</a> [<a href="#dublin-core-metadata-initiative" target="_blank">DCMI</a>]
+Dublin Core Metadata Element Set refers to a <a href="#vocabulary">vocabulary</a> of fifteen properties for use in resource descriptions, such as may be found in a library card catalog (creator, publisher, etc). The Dublin Core Metadata Element Set, also known as "DC Elements", is the most commonly used vocabulary for Linked Data applications. See also <a href="http://dublincore.org/documents/dces/" target="_blank"> Dublin Core Element Set, Version 1.1 Specification.</a> [<a href="#dublin-core-metadata-initiative" target="_blank">DCMI</a>]
</section>
<section>
@@ -254,12 +254,12 @@
<section>
<h4>JSON-LD</h4>
-JSON-LD (JavaScript Object Notation for Linking Data) [[JSON-LD]] is an attempt to harmonize the representation of Linked Data in JSON. JSON-LD is a specification that outlines a common JSON representation format for expressing directed graphs, mixing both Linked Data and non-Linked Data in a single document. JSON-LD is a lightweight Linked Data format that provides data context. <a href="http://json-ld.org/spec/FCGS/json-ld-syntax/20120626/"> JSON-LD Syntax</a> is easy for humans to read and write as well as, easy for machines to parse and generate. JSON-LD is based on the JSON format and provides a way to allow JSON data interoperate at Web-scale. JSON-LD is an appropriate Linked Data interchange language for JavaScript environments, Web service and NoSQL databases.
+JSON-LD (JavaScript Object Notation for Linking Data) [[JSON-LD]] is an attempt to harmonize the representation of Linked Data in JSON. JSON-LD is a specification that outlines a common JSON representation format for expressing directed graphs, mixing both Linked Data and non-Linked Data in a single document. JSON-LD is a lightweight Linked Data format that provides data context. <a href="http://json-ld.org/spec/FCGS/json-ld-syntax/20120626/" target="_blank"> JSON-LD Syntax</a> is easy for humans to read and write as well as, easy for machines to parse and generate. JSON-LD is based on the JSON format and provides a way to allow JSON data interoperate at Web-scale. JSON-LD is an appropriate Linked Data interchange language for JavaScript environments, Web service and NoSQL databases.
</section>
<section>
<h4>Jena</h4>
-<a href="http://jena.apache.org">Jena</a> is an Open Source Software implementation of a <a href="#semantic-web">Semantic Web</a> development framework. It supports the storage, retrieval and analysis of <a href="#rdf">RDF</a> information.
+<a ="http://jena.apache.org">Jena</a> is an Open Source Software implementation of a <a href="#semantic-web">Semantic Web</a> development framework. It supports the storage, retrieval and analysis of <a href="#rdf">RDF</a> information.
</section>
<section>
@@ -269,7 +269,7 @@
<section>
<h4>Linked Data Client</h4>
-A client side application that consumes Linked Data using standard Web techniques. A Linked Data Client may resolve URI's to retrieve Linked Data serializations, using appropriate content negotiation, and understands how to make use of those representations once it receives them. A Linked Data client understands standard REST API, for example the Linked Data REST API. There are many examples of Linked Data clients, several include: Tim Berners-Lee's early <a href="http://www.w3.org/2005/ajar/tab.html"> Tabulator browser</a>, <a href="http://www.visualdataweb.org/gfacet.php" target="_blank"> gFacet</a>, and the <a href="http://callimachusproject.org" target="_blank">Callimachus Shell (CaSH)</a>.
+A client side application that consumes Linked Data using standard Web techniques. A Linked Data Client may resolve URI's to retrieve Linked Data serializations, using appropriate content negotiation, and understands how to make use of those representations once it receives them. A Linked Data client understands standard REST API, for example the Linked Data REST API. There are many examples of Linked Data clients, several include: Tim Berners-Lee's early <a href="http://www.w3.org/2005/ajar/tab.html" target="_blank"> Tabulator browser</a>, <a href="http://www.visualdataweb.org/gfacet.php" target="_blank"> gFacet</a>, and the <a href="http://callimachusproject.org" target="_blank">Callimachus Shell (CaSH)</a>.
</section>
<section>
@@ -318,7 +318,7 @@
Machine readable data refers to data which can be seamlessly processed by programs. It often means non-graphics data which gets 2-stars on the <a href="#5-star-linked-data">5-star Linked Data scale</a>. While some open data developers use screen-scrapping techniques to parse machine readable content, using 4-star or 5-star Linked Data is preferable in terms of provenance and ease of reuse. Anything less than 4-star data gives Web developers more work modeling and transforming data. By creating and publishing Linked Data, you are increasing the ability of search engines, and thus humans, to find, access and re-use information.
</p>
<p>
-To see how a Linked Data representation yields both a human and machine readable version simultaneously, try this exercise. Wikipedia has an interesting page about the color <a href="http://wikipedia.org/wiki/Red" target="_blank">Red</a>. DBpedia allows you to get the structured content listed on the Wikipedia page for "Red" [<a href="http://wikipedia.org/wiki/Red">http://wikipedia.org/wiki/Red</a>] by changing "wiki" to "data" and appending the appropriate file extension.
+To see how a Linked Data representation yields both a human and machine readable version simultaneously, try this exercise. Wikipedia has an interesting page about the color <a href="http://wikipedia.org/wiki/Red" target="_blank">Red</a>. DBpedia allows you to get the structured content listed on the Wikipedia page for "Red" [<a href="http://wikipedia.org/wiki/Red" target="_blank">http://wikipedia.org/wiki/Red</a>] by changing "wiki" to "data" and appending the appropriate file extension.
<pre>$ curl -L http://dbpedia.org/data/Red.ttl</pre>
Thus, you've seen how the same data can be viewed in human and machine readable format from the same page.
</p>
@@ -336,7 +336,7 @@
<section>
<h4>Metadata Object Description Schema</h4>
-It is a bibliographic description system intended to be a compromise between <a href="http://www.loc.gov/marc">MARC</a> and <a href="http://dublincore.org/">DC metadata</a>. It is implemented in <a href="#xml-schema">XML Schema</a>. See DC, MARC, XSD.
+It is a bibliographic description system intended to be a compromise between <a href="http://www.loc.gov/marc" target="_blank">MARC</a> and <a href="http://dublincore.org/" target="_blank">DC metadata</a>. It is implemented in <a href="#xml-schema">XML Schema</a>. See DC, MARC, XSD.
</section>
<section>
@@ -383,7 +383,7 @@
<section>
<h4>ORG Ontology</h4>
-ORG is an RDF vocabulary to enable publication of information about organizations and organizational structures, even at governmental level. See also [<a href="http://www.w3.org/TR/vocab-org/">http://www.w3.org/TR/vocab-org/</a>]
+ORG is an RDF vocabulary to enable publication of information about organizations and organizational structures, even at governmental level. See also [<a href="http://www.w3.org/TR/vocab-org/" target="_blank">http://www.w3.org/TR/vocab-org/</a>]
</section>
<section>
@@ -433,7 +433,7 @@
<section>
<h4>R2RML</h4>
-<a href="http://www.w3.org/TR/r2rml/">R2RML</a> (RDB to RDF Mapping Language) is a language for expressing customized mappings from relational databases to RDF datasets. Such mappings provide the ability to view existing relational data in the RDF data model, expressed in a structure and target vocabulary of the mapping author's choice.
+<a href="http://www.w3.org/TR/r2rml/" target="_blank">R2RML</a> (RDB to RDF Mapping Language) is a language for expressing customized mappings from relational databases to RDF datasets. Such mappings provide the ability to view existing relational data in the RDF data model, expressed in a structure and target vocabulary of the mapping author's choice.
</section>
<section>
@@ -474,7 +474,7 @@
<h4>RDF-JSON</h4>
<p class='todo'>In favor of removing this item: DaveR. In favor of keeping: Bhyland. To discuss</p>
-A concrete syntax in JavaScript Object Notation (JSON) [[!RFC4627]] for RDF as defined in the RDF Concepts and Abstract Syntax [[!RDF-CONCEPTS]] W3C Recommendation. An RDF-JSON document serializes such a set of RDF triples as a series of nested data structures. See also [<a href="https://dvcs.w3.org/hg/rdf/raw-file/default/rdf-json/index.html"> RDF 1.1 JSON Serialization document draft</a>]
+A concrete syntax in JavaScript Object Notation (JSON) [[!RFC4627]] for RDF as defined in the RDF Concepts and Abstract Syntax [[!RDF-CONCEPTS]] W3C Recommendation. An RDF-JSON document serializes such a set of RDF triples as a series of nested data structures. See also [<a href="https://dvcs.w3.org/hg/rdf/raw-file/default/rdf-json/index.html" target="_blank"> RDF 1.1 JSON Serialization document draft</a>]
</section>
<section>
@@ -544,7 +544,7 @@
<section>
<h4>Sesame</h4>
-Sesame is an Open Source Software implementation of a Semantic Web development framework. It supports the storage, retrieval and analysis of RDF information. See also [<a href="http://www.openrdf.org">Open RDF</a>].
+Sesame is an Open Source Software implementation of a Semantic Web development framework. It supports the storage, retrieval and analysis of RDF information. See also [<a href="http://www.openrdf.org" target="_blank">Open RDF</a>].
</section>
<section>
@@ -559,12 +559,12 @@
<section>
<h4>SPARQL client</h4>
-A SPARQL client is an application that can construct and issue a SPARQL query. An example of a SPARQL client is <a href="http://jena.apache.org/documentation/query/index.html">ARQ</a>, part of the Apache Jena Project. ARQ is a query engine for Jena that supports the SPARQL RDF Query Language.
+A SPARQL client is an application that can construct and issue a SPARQL query. An example of a SPARQL client is <a href="http://jena.apache.org/documentation/query/index.html" target="_blank">ARQ</a>, part of the Apache Jena Project. ARQ is a query engine for Jena that supports the SPARQL RDF Query Language.
</section>
<section>
<h4>SPARQL endpoint</h4>
-SPARQL endpoint refers to an application that can answer a SPARQL query, including one where the native encoding of information is not in RDF. It is a best practice for datasets providers to give the URL of their SPARQL endpoint to get access to their data both programmatically or through the web interface. A list of some endpoints status is available at <a href="http://labs.mondeca.com/sparqlEndpointsStatus/">http://labs.mondeca.com/sparqlEndpointsStatus/</a>
+SPARQL endpoint refers to an application that can answer a SPARQL query, including one where the native encoding of information is not in RDF. It is a best practice for datasets providers to give the URL of their SPARQL endpoint to get access to their data both programmatically or through the web interface. A list of some endpoints status is available at <a href="http://labs.mondeca.com/sparqlEndpointsStatus/" target="_blank">http://labs.mondeca.com/sparqlEndpointsStatus/</a>
</section>
<section>
@@ -609,10 +609,10 @@
<section >
<h4>Uniform Resource Identifier</h4>
-<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource. URIs were standardized by joint action of the W3C and IETF. URI’s provide a simple and extensible means for identifying a resource. URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create <a href="http://dbpedia.org/page/red">http://dbpedia.org/page/red</a>. URIs can also be used to refer to other data representations such as a row in a CSV file or a specific table in a relational database.
+<p>A Uniform Resource Identifier (URI) is a global identifier that uniquely identifies an abstract or physical resource. URIs were standardized by joint action of the W3C and IETF. URI’s provide a simple and extensible means for identifying a resource. URIs play a key role in enabling Linked Data. URIs can be used to uniquely identify virtually anything including a physical building or more abstract concepts like the color red. If you would like to see the URI for the color red for example, the DBpedia project has modified URLs from the Wikipedia entry to create <a href="http://dbpedia.org/page/red" target="_blank">http://dbpedia.org/page/red</a>. URIs can also be used to refer to other data representations such as a row in a CSV file or a specific table in a relational database.
</p>
</p>
-As Linked Data builds directly on Web architecture, the term "resource" is used to refer to things of interest that are identified by HTTP URIs. An HTTP URI may or may not be resolvable on the Web. URIs have been known by many names: Web addresses, Universal Document Identifiers, Universal Resource Identifiers, and finally the combination of Uniform Resource Identifier. If you are interested in the history of the many names, read Tim Berners-Lee's design document <a href="http://www.w3.org/DesignIssues/Architecture.html">Web Architecture from 50,000 feet</a>. For definitive information on Uniform Resource Identifiers (URI), see "Uniform Resource Identifier (URI): Generic Syntax," [[!RFC3986]]
+As Linked Data builds directly on Web architecture, the term "resource" is used to refer to things of interest that are identified by HTTP URIs. An HTTP URI may or may not be resolvable on the Web. URIs have been known by many names: Web addresses, Universal Document Identifiers, Universal Resource Identifiers, and finally the combination of Uniform Resource Identifier. If you are interested in the history of the many names, read Tim Berners-Lee's design document <a href="http://www.w3.org/DesignIssues/Architecture.html" target="_blank">Web Architecture from 50,000 feet</a>. For definitive information on Uniform Resource Identifiers (URI), see "Uniform Resource Identifier (URI): Generic Syntax," [[!RFC3986]]
</p>
</section >
@@ -668,7 +668,7 @@
<section>
<h4>World Wide Web Consortium (W3C)</h4>
-<a href="http://www.w3c.org/">World Wide Web Consortium</a>, also known as W3C, is an international community that develops and promote high-quality standards based on consensus around Web technologies. It defined standards such as <a href="http://www.w3.org/standards/webdesign/">Web Design</a>, <a href="http://www.w3.org/standards/webarch/">Web Architecture</a> and <a href="http://www.w3.org/standards/semanticweb/">Semantic Web</a>.
+<a href="http://www.w3c.org/" target="_blank">World Wide Web Consortium</a>, also known as W3C, is an international community that develops and promotes protocols and guidelines that ensure long-term growth for the Web. W3C's standards define key parts of what makes the World Wide Web wrok. It defined standards such as <a href="http://www.w3.org/standards/webdesign/" target="_blank">Web Design</a>, <a href="http://www.w3.org/standards/webarch/" target="_blank">Web Architecture</a> and the <a href="http://www.w3.org/standards/semanticweb/" target="_blank">Semantic Web</a>. See also <a href="http://www.w3.org/Consortium/mission" target="_blank"> W3C Mission</a>.
</section >
<section>
@@ -695,7 +695,7 @@
<!-- ACK -->
<section class="appendix">
<h2>Acknowledgments</h2>
-<p>The editors are grateful to <a href="http://3roundstones.com/about-us/leadership-team/david-wood/">David Wood</a> for the initial glossary terms from the <a href="http://3roundstones.com/linking-government-data/">Linking Government Data</a> book, (<a href="http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-1-4614-1766-8">Springer 2011</a>). The editors would like to thank the active members of the <a href="http://www.w3.org/2011/gld/">Government Linked Data Working Group</a> and special thanks to the reviewers and contributors: Thomas Baker, Hadley Beeman, Richard Cyganiak, Michael Hausenblas, Benedikt Kaempgen, James McKinney, Marios Meimaris, Jindrich Mynarz, Michael Pendleton and Dave Reynolds who helped iterate this Linked Data Glossary so we have common ground upon which to grow the Web of Data. Mille grazie!
+<p>The editors are grateful to <a href="http://3roundstones.com/about-us/leadership-team/david-wood/" target="_blank">David Wood</a> for contributing the initial glossary terms from <a href="http://3roundstones.com/linking-government-data/" target="_blank">Linking Government Data</a>, (<a href="http://www.springer.com/computer/database+management+%26+information+retrieval/book/978-1-4614-1766-8">Springer 2011</a>). The editors wish to also thank the active members of the <a href="http://www.w3.org/2011/gld/" target="_blank">Government Linked Data Working Group</a> with special thanks to the reviewers and contributors: Thomas Baker, Hadley Beeman, Richard Cyganiak, Michael Hausenblas, Benedikt Kaempgen, James McKinney, Marios Meimaris, Jindrich Mynarz, Michael Pendleton and Dave Reynolds who all worked hard to iterate this Linked Data Glossary so that everyone has some common ground upon which to grow the Web of Data. Mille grazie!
</p>
</section>
</body>