Nanopublications LDF server

Matches in Nanopublications for { ?s ?p ?o <http://purl.org/np/RATdINFsrekrz9lIxJCW1sxBEZDLNm8L5QVbCCcfWgBaI#assertion>. }

• paragraph type Paragraph assertion.
• paragraph hasContent "The execution of this stage, as depicted in Figure 1, starts by generating the microtasks from F i , i.e., the sets of RDF triples T and quality issues Q to crowdsource. In addition, a parameter α can be specified as a threshold on the number of questions to include in a single microtask. Algorithm 1 presents the procedure to create the microtasks. The algorithm firstly per- forms a pruning step (line 2) to remove triples that do not require human assessment. For instance, in our im- plementation, the function prune discards RDF triples whose URIs could not be dereferenced. The algorithm then proceeds to build microtasks such that each microtask only contains triples associated with a specific resource, similar to the interfaces of the TripleCheck-Mate tool used in the contest. The set S contains all the resources that appear as subjects in the set of triples T (line 3). For each subject, the algorithm builds the set of triples T 0 associated with the subject (line 5), and the creation of microtasks begins (line 6). From the pool T 0 , a triple t is selected (line 8) and the corresponding human-readable information is extracted (line 9). In this stage, similar to the TripleCheckMate, each microtask requires the workers to browse all the possible quality issues, therefore, the set of issues to assess on triple t is equal to Q in each microtask cre- ated (line 10). In case that the number of questions in the current microtask exceeds the threshold α, a new microtask is then created. The definition of the parameter α allows for avoiding the creation of very long tasks, i.e., when the number of triples with the same subject is large; appropriate values of α enables the creation of tasks than can still be solved in a reasonable time, consistent with the concept of microtask (a short task). Algorithm 1 continues creating microtasks for all the triples of a resource (lines 7-16), for all the resources (lines 4-18). The outcome of the algorithm is a set M of microtasks to assess the quality of the triples in T according to the issues in Q." assertion.