The Surprisingly Popular algorithm (Prelec et al., 2017) is a voting algorithm designed to accurately recover the ground truth answer from a crowd of people. One limitation of the original algorithm is that it is limited to binary or multiple-choice questions, and it may become difficult to implement in practice when there are too many answer choices. We present extensions to apply Surprisingly Popular to questions with an indefinite number of answer choices spread over a continuous domain. We use a single-peaked function to obtain vote and vote prediction distributions for each voter. We present related theoretical results for the new algorithm and test a prototype implementation on empirical data. Furthermore, we suggest improvements to make the prototype more effective in practice.
