The Simplicity of RDFa

Bob DuCharme, the presenter of next week’s webcast SPARQL Queries, SPARQL Technology recently wrote a brief article showing how simple RDFa can be. DuCharme begins, “I got so tired of hearing people complain about how confusing RDFa is that while I was on hold during a recent phone call I threw together a demo of just how simple it can be. The document has the two basic kinds of triples: one with a literal for an object, with data typing thrown in for good measure, and one with a resource URI as its object.”

He continues, “This link will show you the triples as extracted by the W3C's RDFa Distiller and Parser service. My little demo doesn't take into account all the swirling attempts to innovate, accommodate, and disassociate various ideas about embedding machine-readable markup that are currently out there (if you want to stay on top of this, read Jeni Tennison's blog), but it highlights a principle that is probably older than FORTRAN: parsing data in a particular syntax can be a big job, because the parser must understand the full language, but writing data in a particular language can be simple because you can pick the subset that you prefer to work with.”

Read more here.

Image: Courtesy Flickr/ zigazou76