W3C home > Mailing lists > Public > public-rdfa-wg@w3.org > April 2011

Re: RDFa discovery?

From: Shane McCarron <shane@aptest.com>
Date: Tue, 05 Apr 2011 10:23:13 -0500
Message-ID: <4D9B33E1.1000607@aptest.com>
To: nathan@webr3.org
CC: RDFA Working Group <public-rdfa-wg@w3.org>
Honestly, this is my pet peeve with RDFa.  There is no way to know.  At 
all.  We have several announcements mechanisms, but since none of them 
are required the only way to know is to parse the document.  If you get 
to the end and you have triples, it must have contained RDFa.

I know - it's a terrible answer.

On 4/5/2011 8:11 AM, Nathan wrote:
> Hi All,
> Just a quick question, how does one tell whether an document contains, 
> or does not contain, RDFa?
> Let's suppose I have an archive of 10k documents, I'd like to extract 
> the RDFa on them, how can tell upfront that they contain RDFa, without 
> having to process them all?
> a: I may have already asked this previously!
> b: This may be irrelevant for non-SAX based parsers (supposing that 
> the bulk of the weight would be in syntax->DOM conversion, a step 
> needed before any "this is RDFa flag" could be detected).
> Unsure whether this is even worth asking now..
> Best,
> Nathan

Shane P. McCarron                          Phone: +1 763 786-8160 x120
Managing Director                            Fax: +1 763 786-8180
ApTest Minnesota                            Inet: shane@aptest.com
Received on Tuesday, 5 April 2011 15:23:43 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 21:19:51 UTC