- From: Sebastian Hellmann <hellmann@informatik.uni-leipzig.de>
- Date: Sat, 22 Sep 2012 14:01:20 +0200
- To: Paolo Ciccarese <paolo.ciccarese@gmail.com>
- CC: Randall Leeds <randall.leeds@gmail.com>, Robert Sanderson <azaroth42@gmail.com>, public-openannotation <public-openannotation@w3.org>
The new selector could refer to http://tools.ietf.org/html/rfc5147#section-3 with properties : charBegin/charEnd and lineBegin / lineEnd We could add a "position" (charBeginPosition), but it is quite obvious. rfc5147 explains quite well how to count character positions and treat encoding issues. Sebastian Am 21.09.2012 14:17, schrieb Paolo Ciccarese: > Hi Sebastian, > that observation has been made many times by people in the text mining > community. > It really seems expensive to calculate the 'end' through the range given > the high number of annotations that can be machine generated. > > I think I am in favor of that change at this point. > > Maybe we can introduce a new selector with begin/end so that who has > already implemented begin and offset will be still ok? > > Best, > Paolo > > On Fri, Sep 21, 2012 at 3:38 AM, Sebastian Hellmann < > hellmann@informatik.uni-leipzig.de> wrote: > >> Hi all, >> the meeting was really interesting and I learned a lot. For NIF 2.0, I >> will draft such a document specifying a mapping, between the two models. I >> think the most difficult part here are the mappings between the selectors. >> >> Here is an initial question: >> In http://www.openannotation.org/**spec/extension/#SelectorOffset<http://www.openannotation.org/spec/extension/#SelectorOffset>was there any strong reason to use oax:range instead of something like end >> index. >> When querying with SPARQL, you can: >> >> with range: order all selections by length, get all selection of a >> specific length, query if any annotation begin at a certain position >> >> with begin, end index: query if any annotation are within a certain >> region, query for overlaps and locality of annotations, i.e. is there an >> annotation in this paragraph? >> >> >> Addition/subtraction is quite an expensive aggregate. So what do you think >> is the more common use case. I would vote for begin and end index and >> querying overlaps and inclusion. Maybe, we can do it similar to Apache >> Stanbol, which also uses endIndex. >> >> Any opinions on this? Should I copy/paste and open an issue in the Wiki? >> Or could there be consensus right the first time? >> >> Sebastian >> >> >> >> >> >> Am 15.09.2012 00:54, schrieb Randall Leeds: >> >>> On Wed, Aug 1, 2012 at 1:18 PM, Robert Sanderson <azaroth42@gmail.com> >>> wrote: >>> >>>> I would like to propose a joint work item to create a mapping document >>>> between NIF and OA, if you think that would be useful? >>>> >>> I think it would be invaluable to people discovering OA and NIF to >>> have such a document. >>> +1 >>> >>> >> -- >> Dipl. Inf. Sebastian Hellmann >> Department of Computer Science, University of Leipzig >> Events: >> * http://sabre2012.infai.org/**mlode <http://sabre2012.infai.org/mlode>(Leipzig, Sept. 23-24-25, 2012) >> * http://wole2012.eurecom.fr (*Deadline: July 31st 2012*) >> Projects: http://nlp2rdf.org , http://dbpedia.org >> Homepage: http://bis.informatik.uni-**leipzig.de/SebastianHellmann<http://bis.informatik.uni-leipzig.de/SebastianHellmann> >> Research Group: http://aksw.org >> >> > -- Dipl. Inf. Sebastian Hellmann Department of Computer Science, University of Leipzig Events: * http://sabre2012.infai.org/mlode (Leipzig, Sept. 23-24-25, 2012) * http://wole2012.eurecom.fr (*Deadline: July 31st 2012*) Projects: http://nlp2rdf.org , http://dbpedia.org Homepage: http://bis.informatik.uni-leipzig.de/SebastianHellmann Research Group: http://aksw.org
Received on Saturday, 22 September 2012 12:01:51 UTC