Reply & Supply: Experiment 2 (Synonym Proposal Task) Crowdsourcing Data

These data support the <b>synonymy proposal task</b> (<b>SPT</b>) experiment described in the paper "<i>Reply &amp; Supply: Efficient crowdsourcing when workers do more than answer questions</i>", https://arxiv.org/abs/1611.00954.<br><br>The data consist of two CSV files, one describing the questions built by the crowd as they work, the other recording the responses of workers when presented with questions. A "question id" (`qid`) field links these data. The IDs of Mechanical Turk workers were deidentified. The task interface is described in Fig. 2 of the paper.<br>Three question sampling algorithms were tested in the experiment. These are recorded in the `algorithm`. Note that workers may participate in multiple algorithms, and that `qid` is only unique for a given algorithm (`qid` 1 under the `random` algorithm and `qid` 1 under the `binomial` algorithm are not the same question).

本数据集支持论文《回复与补充：当众包工作者不止回答问题时的高效众包模式》（英文标题："Reply & Supply: Efficient crowdsourcing when workers do more than answer questions"，链接：https://arxiv.org/abs/1611.00954）中所述的**同义词提议任务（synonymy proposal task, SPT）**实验。

本数据集包含两个CSV文件：其一记录众包工作者在任务执行过程中构建的问题，其二记录工作者面对给定问题时给出的应答。二者通过「问题标识符（qid）」字段进行关联。所有Mechanical Turk工作者的身份标识均已完成去标识化处理。任务界面详见论文中的图2。

本实验共测试了三种问题采样算法，算法类别记录于`algorithm`字段中。需注意：工作者可参与多种算法，且`qid`仅在对应算法内唯一——例如`random`算法下的`qid`1与`binomial`算法下的`qid`1并非同一问题。