<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Domain-Independent Quality Measures for Crowd Truth Disagreement</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Oana Inel</string-name>
          <email>oana.inel@vu.nl</email>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lora Aroyo</string-name>
          <email>lora.aroyo@vu.nl</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chris Welty</string-name>
          <email>cawelty@gmail.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Robert-Jan Sips</string-name>
          <email>robert-jan.sips@nl.ibm.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>CAS Benelux</institution>
          ,
          <addr-line>IBM</addr-line>
          <country country="NL">Netherlands</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>IBM Watson Research Center</institution>
          ,
          <addr-line>New York</addr-line>
          ,
          <country country="US">USA</country>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>VU University Amsterdam</institution>
        </aff>
      </contrib-group>
      <abstract>
        <p>Using crowdsourcing platforms such as CrowdFlower and Amazon Mechanical Turk for gathering human annotation data has become now a mainstream process. Such crowd involvement can reduce the time needed for solving an annotation task and with the large number of annotators can be a valuable source of annotation diversity. In order to harness this diversity across domains it is critical to establish a common ground for quality assessment of the results. In this paper we report our experiences for optimizing and adapting crowdsourcing microtasks across domains considering three aspects: (1) the micro-task template, (2) the quality measurements for the workers judgments and (3) the overall annotation work ow. We performed experiments in two domains, i.e. events extraction (MRP project) and medical relations extraction (Crowd-Watson project). The results con rm our main hypothesis that some aspects of the evaluation metrics can be de ned in a domainindependent way for micro-tasks that assess the parameters to harness the diversity of annotations and the useful disagreement between workers. This paper focuses speci cally on the parameters relevant for the 'event extraction' ground-truth data collection and demonstrates their reusability from the medical domain.</p>
      </abstract>
      <kwd-group>
        <kwd>Crowdsourcing</kwd>
        <kwd>Ground-Truth</kwd>
        <kwd>Event Extraction</kwd>
        <kwd>Relation Extraction</kwd>
        <kwd>NLP</kwd>
        <kwd>Newspaper corpus</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        At the basis for machine learning and information retrieval systems is the
collection of ground truth data. Typically, creating such a gold standard dataset
requires domain expert annotations to ensure high quality of the training and
evaluation data. However, expert-annotation may result in limitedly annotated
datasets, which do not capture the evolution of human expressions and the
diversity in their interpretations. With its large pool of human workers,
crowdsourcing became a mainstream source for higher volume and continuous collection of
training and evaluation data (specically for tasks that do not require domain
expertise). Thus, the new challenge became to correctly and eciently
identifying low quality or spam contributions of the micro-workers. Research shows that
micro-workers’ behavior (e.g. either as intentional spam or low quality
contributions) can inuence the overall quality of the nal results [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. Typically, the
quality is measured under the assumption that there is only one right answer for
each micro-task and that it can be measured through annotators agreement [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ].
      </p>
      <p>
        Recently, however, there is evidence to support the hypothesis that
harnessing diversity and disagreement between workers can improve the ground truth
data [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Thus, it is critical to identify how much of the crowdsourced data is
part of spam, low quality or actual meaningful disagreement between workers.
There is an extensive body of research on spam detection through, e.g. majority
decision [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], the expectation maximization [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ]. Additionally, the micro-task
template can impact the ability of the workers to complete the task successfully [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ].
However, most of the studies have been focussing on addressing these issues as
individual processes and less as part of a complete end-to-end workow [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. In
this paper, we show that an optimal annotation workow, which supports (1)
apriori ltering of input data to maximize suitability for the workers and for the
training, (2) crafting the templates to ensure proper disagreement collection and
(3) dening appropriate metrics for low quality and spam ltering can impact
benecially the quality of the ground truth data, which we call Crowd Truth [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ].
      </p>
      <p>We conducted experiments in two domains - starting with medical relation
extraction in the context of Crowd-Watson project 4 and adapting the
experiences to event extraction in the context of DARPA’s Machine Reading
program (MRP)5. We used the same workow in both domains: (1) pre-processing
of input data and micro-task template design , (2) data collection through
automatic sequencing of micro-task batches , (3) disagreement analytics through
quality metrics on workers judgments and (4) post-processing of the results for
spam ltering and micro-task template adaptation . The novel contribution of this
work is twofold - on the one hand demonstrating a crowd truth collection
workow optimized for multiple domains; and on the other hand providing reusable
disagreement-harnessing micro-task templates with the corresponding spam
detection disagreement metrics.</p>
      <p>The rest of the paper is organized as follows. Section 2 places this work in
the context of crowdsourcing, evaluation metrics and event extraction. Section 3
presents the Crowd-Watson workow and shows its adaptation for the event
extraction task. Section 4 presents the experimental setup and Section 5 discusses
the results. Section 6 draws the conclusions and presents the future work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>
        The amount of knowledge that crowdsourcing platforms like CrowdFlower 6 or
Amazon Mechanical Turk 7 hold fostered a great advancement in human
computation [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Although the existing paid platforms manage to ease the human
computation, it has been argued that their utility as a general-purpose computation
platform still needs improvement [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. Since the development of crowdsourcing
has become more intensive, much research has been done in combining human
and machine capabilities in order to obtain an automation of the crowdsourced
process. Some state-of-the-art crowdsourcing frameworks are CrowdLang [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]
4https://github.com/laroyo/watsonc
5http://www.darpa.mil/OurWork/I2O/Programs/MachineReading.aspx
6https://crowdflower.com/
7https://www.mturk.com/mturk/
and CrowdMap [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. However, CrowdLang restricts the users to work with its
own internal programming language and CrowdMap solves only ontology
alignment. Thus, both frameworks can be hardly adapted to another domain.
      </p>
      <p>
        A lot of research has been focused on indentifying crowdsourced spam.
Although a commonly used algorithm for removing spam workers is the majority
decision [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], according to [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] it is not an optimal approach as it assumes all the
workers to be equally good. Alternatively, expectation maximization [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
estimates individual error rates of workers. First, it infers the correct answer for each
unit and then compares each worker answer to the one inferred to be correct.
However, [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] shows that some tasks can have multiple good answers, while most
spam or low quality workers typically select multiple answers. For this type of
problem, some disagreement metrics [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] have been developed, based on workers
annotations (e.g. agreement on the same unit, agreement over all the units) and
their behavior (e.g. repetitive answers, number of annotations).
      </p>
      <p>
        Research on events detection and extraction from medical texts [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ], [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
is primarily focussed on improving the machine performance for it. In [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] the
authors create an event trigger dictionary based on the original GENIA event
corpus [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ] and further, they apply dependency graphs for parsing the input
corpus and extracting the putative events. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ] uses the Stanford Lexical Parser 8
for producing dependency graphs of the input corpus, as well as extracting the
putative events. However, instead of using a dictionary for medical events, they
only use the relations given by the dependency graphs.
      </p>
      <p>
        Although there has been an extensive event extraction research using
machines, the advantages of using crowdsourcing in this domain were not fully
harnessed. Our new approach (fostering disagreement between annotators) [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ] asks
the crowd to judge the putative events and to provide event role-llers at
dierent granularities. The concept of harnessing disagreement in Natural Language
Processing is not yet considered a mainstream process. In [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] disagreement is
used as a trigger for consensus-based annotation in which all disagreeing
annotators are forced to discuss and arrive at a consensus. This approach achieves
scores above .9, but it is not clear if the forced consensus achieves anything
meaningful. It is also not clear if this is practical in a crowdsourcing environment.
3
      </p>
    </sec>
    <sec id="sec-3">
      <title>Adapting Crowd-Watson for Event Extraction</title>
      <p>This section presents the workow initially developed within the Crowd-Watson
project (Figure 1) for creating ground truth data for medical relation
extraction, that was further adapted for creating ground truth for newspaper events
extraction. The resulting ground truth we refer to as Crowd Truth. In this paper
we focus on the event extraction process for event crowd truth collection and
its adaptation from the medical domain. A key point here is illustrating the
reusability and optimization features of the workow across the two domains.</p>
      <p>The framework is designed as an end-to-end process which provides
feedback loops that generate analysis for each stage of the workow in order to
improve future results. The Pre-Processing 3.1 component handles the
adaptation of the input data for making it solving-aordable in terms of micro-tasks.
8http://nlp.stanford.edu/software/lex-parser.shtml
The Data Collection 3.2 uses CrowdFlower sequences of jobs for collecting
judgments, while the Disagreement Analysis 3.3 component automatically handles
the contributors evaluation. The Post-Processing 3.4 component automatically
lters out the workers identied as spammers. Further, the process of collecting
disagreement-based judgments can continue by reiterating each mentioned step.
3.1</p>
      <p>
        Pre-Processing for Event Extraction
As, typically, the initial textual data collected from large sources, e.g. Wikipedia,
newspapers rst needs to be processed into smaller chunks suitable for
microtasks (paragraphs, sentences). Further, to optimize its applicability for training,
sentences that are not useful for training, e.g. too long or too short or contain
specic words that increase the ambiguity need to be ltered out. The Input
Data Filtering component clusters the input sentences based on their syntactic
criteria, e.g. presence of semicolons, comma-separated lists, parentheses, etc.
Each of those clusters can be either ignored or used for a specic micro-tasks.
For example, sentences with putative events identied in them can be given to
the crowd to conrm whether they refer to an event or not. Majority of those
lters we directly reused from our medical relation extraction use case.
Input Data: For the experiments described in Section 4 we used articles from
The New York Times. After their content was split into sentences (50 initial
sentences), we removed the short sentences (less than 15 words). Compared with
the task of medical relation extraction where the long sentences are typically
dicult for the crowd, in the task of event extraction the longer the sentence
the higher the chance that it will contain useful context for the event and the
role llers. This left us with 37 sentences to run the experiments with.
Putative Event Extraction: The rst step in extracting events is to determine
the putative events (verbs and nominalized verbs), i.e. word phrase that could
possibly indicate an event. This component rst exploits the context-free phrase
structure grammar representation from the Stanford Parser to extract all the
verbs and the nouns. Further, it follows the typed dependencies parses (also
from the Stanford Parser) to extract word phrases that being in relation with
certain verbs might trigger events. In addition to the Stanford Parser we also
used NomLex9, a dictionary of nominalizations. Thus, we extracted 205 putative
events from the 37 sentences of the input data. For the crowdsourced experiments
we selected only 70 putative events. Table 1 presents the putative events dataset.
which is the relevant level of granularity for temporal expressions. However, when
gathering gold standard data for events we are interested in collecting all possible
temporal expression. Thus, we combined four relative classes from Allen’s time
theory [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] with two time points and ve time intervals from from KSL time
ontology [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ]. According to [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] the proper nouns strongly relate to participants
in events. Thus, our participants taxonomy considers 5 classes that can be mostly
represented by proper nouns. To foster diversity and disagreement, we added to
each taxonomy the value Other. Table 2 presents each taxonomy.
      </p>
      <p>
        Table 2: Event Role Fillers Taxonomies
crowdsourcing platform 14, which targets nichesourcing with medical experts [
        <xref ref-type="bibr" rid="ref25">25</xref>
        ].
Crowd-Watson is specically designed to stimulate the capture of disagreement
and diversity in the annotator contributions. Figure 1 shows the specication of
the components for event extraction.
This component assesses the quality of the workers contributions by analyzing
the disagreement with Worker Metrics - worker agreement on a specic unit or
across all the units that (s)he solved, and Content Metrics - the overall quality
of the training data. This provides additional characteristics of the crowd truth,
e.g. sentence clarity, similarity and ambiguity measures. In the event extraction
task, the sentence vector is dened for each event property as the content of
the aforementioned taxonomies and the "Not Applicable" value. This value is
automatically added when: (1) the word phrase selected does not refer to an
event, (2) there is no event property mentioned in the text snippet.
      </p>
      <p>
        To avoid penalizing workers for contributing on dicult or ambiguous
sentences, we lter sentences based on their clarity score [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. Only then we apply
the content-based worker metrics. The worker-sentence agreement measures the
agreement between a worker annotation and the annotations of the rest of the
workers for the same sentence (i.e. the averaged cosines between the worker
sentence vector and the aggregated sentence vector, subtracting the worker’s
vector). The worker-worker agreement measures the agreement of the individual
judgments of one worker with the judgments of all the other workers (i.e. the
aggregated pairwise confusion matrix between the worker and the rest of the
workers weighted by the number of sentences in common). The number of
annotations per sentence is the average number of dierent types used by a worker
for annotating a set of sentences.
The resulting analysis from these metrics provides input to Post-Processing to
lter spam workers and spam-prone worker channels. The Worker Spam Filtering
controls this ow. The list of spam micro-workers is sent to the Data Collection
component to ban them from contributing to future tasks. Some statistics are
also performed at the level of channels through Crowdsourcing Channel Filtering .
Feedback is also sent to the Pre-Processing for improving the selection of input
data, the optimization of micro-task settings and the workow.
      </p>
      <p>Finally, the Visual-Analytics component provides interactive visualization of
(1) the workers behavior, (2) the sentence clarity and similarity. It provides a
clear way to observe the dynamics in workers disagreement, completion time and
the distribution of lters for spam contributions. The same visualization is used
both for the relation extraction and for the event extraction tasks (Figure 3).
4</p>
    </sec>
    <sec id="sec-4">
      <title>Experimental Setup</title>
      <p>We adapted the Crowd-Watson medical relation extraction template for event
extraction by constraining the workers to follow stricter rules, so that we can
compare: (1) how does the new template inuence the quality of the results;
14http://crowd-watson.nl/dr-detective-game/
In this section we analyze the entire experimental workow. We observe the
eect of the template design on the accuracy of the crowdsourced data, and we
measure the accuracy of the worker metrics compared to the accuracy of the
worker metrics together with the explanation-based metrics.</p>
      <p>
        The preliminary experiment (Exp0) for identifying events and event types
did not use a conditional micro-task template. Nine workers submitted only one
or two judgments, which did not provide evaluation relevance, and were thus
excluded from the analysis. The contributions of 66 remaining workers were
analyzed further. The worker metrics identied 15 spam contributors, while the
explanation-based lters, described in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] identied another 10 spam
contributors. However, upon a manual evaluation of the results 5 more workers were
identied with an erratic behavior, selecting either "no event" and a type
different than "Not Applicable", or "yes event" and "Not Applicable" type. Such
contributions could be because of intentional spamming, or negligence or
misunderstanding of the task. This result guided us to a more restrictive template
to improve the job outcome. The new event extraction template (Figure 2) did
not allow the workers to choose simultaneously: (1) "Not Applicable" and other
event property type, (2) "no event" and a type dierent than "Not Applicable",
(3) "yes event" and "Not Applicable" type.
      </p>
      <p>When adapting the taxonomies we tried to conceive dierent experimental
cases that could give insights in the adaptability degree of the metrics:
the list of event types, time types and participant types are similar to the
number of relations provided in the medical relation extraction task;
the taxonomy for location type is more diverse, with overlapping concepts;
one event can have multiple participants, which can increase the number of
annotation for a putative event; this is a relevant factor for evaluating the
behavior the average number of annotations metric;</p>
      <p>We performed a manual sampling-based evaluation of workers in order to
determine the accuracy of the spam metrics. We examined all the workers marked
as spam by the lters, as well as the ones ranked as best workers. Some workers
in the gray area inbetween were also manually evaluated. Figure 4 shows the
precision, recall and F-measure only for the worker metrics for each job type,
i.e. event type, event location, event time and event participants. Although the
worker metrics identied a high percentage of low-quality contributors, the
accuracy and the precision of the metrics still need improvements. A reason for
this behavior could strongly relate to event properties types distribution and
similarity, which varies along the four classes of event characteristics.</p>
      <p>For the Event Type task the average number of annotations metric was able
to identify correctly a high amount of spammers. However, both the
workersentence and worker-worker agreement had low values in terms of correctness.
The distribution of event types among 35 sentences, i.e. putative events (see
Figure 3) indicates high ambiguity of the event types. One reason for this could
be our choice of event types, which might not be so appropriate for the workers.
However, in the Location Type task we see a dierent picture. As expected, most
workers chose multiple types for one identied location. For example, the
highlighted location for one putative event was "Apple’s glass cube on Fifth Avenue"
and was classied as: [COMMERCIAL], [BUILDING], [ROAD], [STREET].
Although the worker did agree to a certain extent with the other workers solving
the same sentence, he was wrongly classied as spammer based on the number
of annotations. Thus, the accuracy of spam identication for location type is
solely based on the worker-worker and worker-sentence agreements metrics. The
F-measure for event type is equal to 0.89, while for event location is equal to
0.82. Even though the percentages of identied low-quality contributors were
comparable for both experiments, the lower number of correct predictions for
event location stands as a reason for a lower event location type F-measure. For
the Time Type task the assessment of metrics behavior was the most
challenging. More than half of the sentences used in the experiment did not contain any
event time reference, and most of the workers chose "[NOT APPLICABLE]" as
a type. This resulted in a high worker-worker and worker-sentence agreement
scores. Thus, if a worker would disagree with other workers on just one
sentence, (s)he would be identied as spam. Most of the spammers, however, were
captured by at least two worker metrics. The ones identied by less than two
metrics justify the high recall and the low precision (Figure 4) (F=0.81).</p>
      <p>One event could have multiple participants of dierent types. However, the
highlighted participants mentions in the task were of the same type, which
explains why the average number of annotations per sentence did not have an
erratic behavior. The event participants type has the highest F-measure value
(0.91). This value is a result of the high amount of spammers correctly identied
as well as the high amount of spammers identied from the entire list of
spammers. Thus, we can conclude that the participants taxonomy presented to the
workers is concise and covers with high precision the possibilities of interpreting
the participants of an event.</p>
      <p>The high worker disagreement in the event type experiments gave the worker
metrics an important boost of eciency, by identifying a high amount of true
spammers. However, the overall agreement was above mean expectations. Thus,
the workers that did not highly agree with other workers were prone to be
identied as spammers. For event location, however, the average number of annotations
per putative event decreased the total precision of correctly identied spammers.
As seen in Figure 4, the applied worker measurements had the most accurate
behavior for the event participants type task.</p>
      <p>Fig. 4: Worker Metrics Evaluation FFiilgt.e5r:s EWvoarlkueartioMnetrics and Explanation-based
By looking at Figure 5 we can see that the explanations provided by the
workers regarding their answers give an important boost of eciency in
identifying patterns that are associated with low-quality contributions and even spam
contributions. In combination with the worker metrics, these explanation-based
lters are able to increase the accuracy of detecting low-quality workers with at
least 5%. This situation was possible because only a small number of workers
were identied as spammer by both explanation-based lters and
disagreementbased metrics (worker metrics). Thus, for each batch, not more than 2 or 3
workers were identied by both quality measurements. Hence, it seems
reasonable to further use the advantages brought up by those lters. This conclusion
is also underlined by the usage of all the channels, situation that is usually
associated with an increased percentage of spammed results. The results presented
in Figure 5 make a good case to state that the usage of both worker metrics
and explanation-based lters achieves high accuracy in terms of crowdsourced
data. With the results mentioned in Figure 5 we can state that we succeeded to
achieve high accuracy in identifying the spam workers, but we also showed how
the metrics are suitable across domains.
6</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions and Future Work</title>
      <p>This paper presents the results of our experiments on estimating the reusability
and domain-dependency of crowdsourcing workow components, such as
processing of input data, micro-task templates and result assessment metrics. We
demonstrated how components dened in one domain (medical relation
extraction) can be easily adapted to a completely dierent domain (event extraction
from newspapers). Results from the experiments showed that some of the
metrics for workers and content can be applied with high precision in those domains.
For understanding to what extent the domains can be similarly treated, we
conducted dierent research at each step of the crowdsourced process.</p>
      <p>By directly reusing pre-processing lters from the medical relation
extraction domain we showed that the input data can be optimized using syntactic
text features. Thus, we can argue that the syntactic text features are mostly
domain-independent. Although the template design was adapted for stimulating
diversity in worker answers, the metrics were still able to capture the low quality
contributions in both domains. With the nal template design for event
extraction, the workers were less prone to spam the results by mistake. We have showed
that especially for domains were there is no golden data known in advance, the
explanations can be successfully used to identify more spam or low-quality
workers. When the explanation lters are combined with the disagreement worker
metrics the accuracy of detecting those low-quality contributors reaches a value
greater than 92%. To sum up, the adaptation of the disagreement analysis
component from the medical relation extraction to the event extraction preserved its
good outcomes, and thus, these disagreement metrics are domain-independent.</p>
      <p>As part of this research, our future work should focus on solving
ambiguityrelated aspects. First, our analysis showed that there is still space for improving
the event properties types. The event-type taxonomy shows a lot of
ambiguity when looking at the workers annotations distribution. Further experiments
should clarify whether a dierent classication of the putative events can achieve
a better performance compared to the current experiments. Also, we need to
conclude how the types that are overlapping inuence the results. Furthermore,
each word phrase highlighted from the sentences needs to be clustered in order
to determine the most appropriate structure of the event role ller.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Vuurens</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>de Vries</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Eickho</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>How much spam can you take? an analysis of crowdsourcing results to increase accuracy</article-title>
          .
          <source>In: Proc. ACM SIGIR Workshop on Crowdsourcing for Information Retrieval (CIR 11)</source>
          . (
          <year>2011</year>
          )
          <fpage>21</fpage>
          <lpage>26</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Nowak</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , R ger, S.:
          <article-title>How reliable are annotations via crowdsourcing: a study about inter-annotator agreement for multi-label image annotation</article-title>
          .
          <source>In: Proceedings of the international conference on Multimedia information retrieval</source>
          ,
          <source>ACM</source>
          (
          <year>2010</year>
          )
          <fpage>557</fpage>
          <lpage>566</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Harnessing disagreement for event semantics</article-title>
          . Detection, Representation, and
          <article-title>Exploitation of Events in the Semantic Web (</article-title>
          <year>2012</year>
          )
          <fpage>31</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Hirth</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Ho feld, T.,
          <string-name>
            <surname>Tran-Gia</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Cost-optimal validation mechanisms and cheat-detection for crowdsourcing platforms</article-title>
          .
          <source>In: Innovative Mobile and Internet Services in Ubiquitous Computing (IMIS)</source>
          ,
          <source>IEEE</source>
          (
          <year>2011</year>
          )
          <fpage>316</fpage>
          <lpage>321</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Ipeirotis</surname>
            ,
            <given-names>P.G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Provost</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Quality management on amazon mechanical turk</article-title>
          .
          <source>In: ACM SIGKDD workshop on human computation</source>
          ,
          <source>ACM</source>
          (
          <year>2010</year>
          )
          <fpage>64</fpage>
          <lpage>67</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kittur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chi</surname>
            ,
            <given-names>E.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Suh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Crowdsourcing user studies with mechanical turk</article-title>
          . In:
          <article-title>SIGCHI conference on human factors in computing systems</article-title>
          ,
          <source>ACM</source>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kittur</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nickerson</surname>
            ,
            <given-names>J.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gerber</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shaw</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zimmerman</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lease</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Horton</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>The future of crowd work</article-title>
          .
          <source>In: Proceedings of the 2013 conference on Computer supported cooperative work</source>
          ,
          <source>ACM</source>
          (
          <year>2013</year>
          )
          <fpage>1301</fpage>
          <lpage>1318</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Crowd truth: Harnessing disagreement in crowdsourcing a relation extraction gold standard</article-title>
          .
          <source>WebSci2013</source>
          . ACM (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Quinn</surname>
            ,
            <given-names>A.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bederson</surname>
            ,
            <given-names>B.B.</given-names>
          </string-name>
          :
          <article-title>Human computation: a survey and taxonomy of a growing eld</article-title>
          .
          <source>In: Proceedings of the SIGCHI Conference on Human Factors in Computing Systems</source>
          , ACM (
          <year>2011</year>
          )
          <fpage>1403</fpage>
          <lpage>1412</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Minder</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bernstein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Crowdlang- rst steps towards programmable human computers for general computation</article-title>
          .
          <source>In: Human Computation</source>
          . (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Sarasua</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Simperl</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Noy</surname>
            ,
            <given-names>N.F.</given-names>
          </string-name>
          :
          <article-title>Crowdmap: Crowdsourcing ontology alignment with microtasks</article-title>
          .
          <source>In: The Semantic Web ISWC 2012</source>
          . Springer (
          <year>2012</year>
          )
          <fpage>525</fpage>
          <lpage>541</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Raykar</surname>
            ,
            <given-names>V.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>L.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Valadez</surname>
            ,
            <given-names>G.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Florin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bogoni</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moy</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Learning from crowds</article-title>
          .
          <source>The Journal of Machine Learning Research</source>
          <volume>99</volume>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Dawid</surname>
            ,
            <given-names>A.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Skene</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>Maximum likelihood estimation of observer error-rates using the em algorithm</article-title>
          . Applied Statistics (
          <year>1979</year>
          )
          <fpage>20</fpage>
          <lpage>28</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Sober n</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Inel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Overmeen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Crowd truth metrics</article-title>
          .
          <source>Technical report</source>
          , VU University Amsterdam (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Measuring crowd truth for medical relation extraction</article-title>
          .
          <source>AAAI2013 Fall Symposium on Semantics for Big Data (in print)</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Buyko</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Faessler</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wermter</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hahn</surname>
            ,
            <given-names>U.</given-names>
          </string-name>
          :
          <article-title>Event extraction from trimmed dependency graphs</article-title>
          .
          <source>In: Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing: Shared Task, Association for Computational Linguistics</source>
          (
          <year>2009</year>
          )
          <fpage>19</fpage>
          <lpage>27</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Kilicoglu</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bergler</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Syntactic dependency based heuristics for biological event extraction</article-title>
          .
          <source>In: Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing: Shared Task</source>
          . (
          <year>2009</year>
          )
          <fpage>119</fpage>
          <lpage>127</lpage>
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ohta</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsujii</surname>
          </string-name>
          , J.:
          <article-title>Corpus annotation for mining biomedical events from literature</article-title>
          .
          <source>BMC bioinformatics 9(1)</source>
          (
          <year>2008</year>
          )
          <fpage>10</fpage>
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Ang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dhillon</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Krupski</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shriberg</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stolcke</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Prosody-based automatic detection of annoyance and frustration in human-computer dialog</article-title>
          . In: INTERSPEECH,
          <string-name>
            <surname>Citeseer</surname>
          </string-name>
          (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schneider</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Smith</surname>
            ,
            <given-names>N.A.</given-names>
          </string-name>
          :
          <article-title>Semafor 1.0: A probabilistic framesemantic parser</article-title>
          .
          <source>Language Technologies Institute</source>
          , School of Computer Science, Carnegie Mellon University (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Allen</surname>
            ,
            <given-names>J.F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hayes</surname>
            ,
            <given-names>P.J.:</given-names>
          </string-name>
          <article-title>A common-sense theory of time</article-title>
          . Volume
          <volume>85</volume>
          . (
          <year>1985</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22.
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fikes</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A reusable time ontology</article-title>
          .
          <source>Technical report, KSL-00-01</source>
          , Stanford University (
          <year>2000</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23.
          <string-name>
            <surname>Hatzivassiloglou</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Filatova</surname>
          </string-name>
          , E.:
          <article-title>Domain-independent detection, extraction, and labeling of atomic events</article-title>
          ,
          <source>Proceedings of the RANLP Conference</source>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Inel</surname>
            ,
            <given-names>O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sober n</surname>
          </string-name>
          , G.,
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Overmeen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sips</surname>
          </string-name>
          , R.J.:
          <article-title>Crowd watson: Crowdsourced text annotations</article-title>
          .
          <source>Technical report</source>
          , VU University Amsterdam (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25.
          <string-name>
            <surname>Dumitrache</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Aroyo</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Welty</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sips</surname>
            ,
            <given-names>R.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Levas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Dr. detective: combining gami cation techniques and crowdsourcing to create a gold standard for the medical domain</article-title>
          .
          <source>Technical report</source>
          , VU University Amsterdam (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>