Clinic and Policlinic for Psychiatry and Psychotherapy, University Clinic Hamburg-Eppendorf, Martinistraße 52, 20246, Hamburg, Germany.
Institute for Computer Science, Hamburg University, Vogt-Kölln-Straße 30, 22527, Hamburg, Germany.
Psychol Res. 2020 Mar;84(2):528-545. doi: 10.1007/s00426-018-1042-3. Epub 2018 Jun 27.
Insight problem solving has been conceptualized as a dynamic search through a constrained search space, where a non-obvious solution needs to be found. Multiple sources of task difficulty have been defined that can keep the problem solver from finding the right solution such as an overly large search space or knowledge constraints requiring a change of the problem representation. Up to now, there are very few accounts that focus on different aspects of difficulty within an insight problem-solving context and how they affect task performance as well as the probability of finding a solution that is accompanied by an Aha! experience. In addition, we are not aware of any approaches investigating how knowledge constraints parametrically modulate task performance and the Aha! experience in compound remote associates (CRA) when controlling for other sources of task difficulty. Therefore, we first developed, tested, and externally validated a modified CRA paradigm in combination with lexical priming that is more likely to elicit representational change than the classical CRA tasks. Second, we parametrically estimated the effect of the knowledge constraint together with other sources of difficulty (size of the problem and search space, word length and frequency) using general linear mixed models. The knowledge constraint (and the size of the search space) was operationalized as lexical distance (measured as cosine distances) between different word pairs within this task. Our results indicate that the experimentally induced knowledge constraint still affects task performance and is negatively related to the Aha! experience when controlling for various other types of task difficulties. Finally, we will present the complete stimulus set in German language together with their statistical (i.e., item difficulty and mean solution time) and lexical properties.
顿悟问题解决被概念化为在受限搜索空间中进行的动态搜索,其中需要找到非明显的解决方案。已经定义了多种任务难度来源,这些来源可能会阻止问题解决者找到正确的解决方案,例如搜索空间过大或知识限制要求改变问题表示。到目前为止,很少有研究关注顿悟问题解决背景下不同方面的难度以及它们如何影响任务表现以及找到伴随顿悟体验的解决方案的可能性。此外,我们不知道有任何方法可以调查在控制其他任务难度来源的情况下,知识限制如何参数化调节任务表现和顿悟体验在复合远程联想(CRA)中的作用。因此,我们首先开发、测试和外部验证了一种结合词汇启动的改良 CRA 范式,该范式比经典 CRA 任务更有可能引发表示性变化。其次,我们使用广义线性混合模型参数估计了知识限制以及其他难度来源(问题和搜索空间的大小、单词长度和频率)的效果。知识限制(以及搜索空间的大小)是通过任务中不同单词对之间的词汇距离(用余弦距离测量)来操作的。我们的结果表明,在控制各种其他类型的任务难度时,实验诱导的知识限制仍然会影响任务表现,并与顿悟体验呈负相关。最后,我们将呈现完整的德语刺激集及其统计(即项目难度和平均解决方案时间)和词汇属性。