Displaying 1 - 8 of 8
-
Lai, J., & Poletiek, F. H. (2013). How “small” is “starting small” for learning hierarchical centre-embedded structures? Journal of Cognitive Psychology, 25, 423-435. doi:10.1080/20445911.2013.779247.
Abstract
Hierarchical centre-embedded structures pose a large difficulty for language learners due to their complexity. A recent artificial grammar learning study (Lai & Poletiek, 2011) demonstrated a starting-small (SS) effect, i.e., staged-input and sufficient exposure to 0-level-of-embedding exemplars were the critical conditions in learning AnBn structures. The current study aims to test: (1) a more sophisticated type of SS (a gradually rather than discretely growing input), and (2) the frequency distribution of the input. The results indicate that SS optimally works under other conditional cues, such as a skewed frequency distribution with simple stimuli being more numerous than complex ones. -
Warmelink, L., Vrij, A., Mann, S., Leal, S., & Poletiek, F. H. (2013). The effects of unexpected questions on detecting familiar and unfamiliar lies. Psychiatry, Psychology and law, 20(1), 29-35. doi:10.1080/13218719.2011.619058.
Abstract
Previous research suggests that lie detection can be improved by asking the interviewee unexpected questions. The present experiment investigates the effect of two types of unexpected questions: background questions and detail questions, on detecting lies about topics with which the interviewee is (a) familiar or (b) unfamiliar. In this experiment, 66 participants read interviews in which interviewees answered background or detail questions, either truthfully or deceptively. Those who answered deceptively could be lying about a topic they were familiar with or about a topic they were unfamiliar with. The participants were asked to judge whether the interviewees were lying. The results revealed that background questions distinguished truths from both types of lies, while the detail questions distinguished truths from unfamiliar lies, but not from familiar lies. The implications of these findings are discussed. -
Poletiek, F. H., & Van Schijndel, T. J. P. (2009). Stimulus set size and statistical coverage of the grammar in artificial grammar learning. Psychonomic Bulletin & Review, 16(6), 1058-1064. doi:10.3758/PBR.16.6.1058.
Abstract
Adults and children acquire knowledge of the structure of their environment on the basis of repeated exposure to samples of structured stimuli. In the study of inductive learning, a straightforward issue is how much sample information is needed to learn the structure. The present study distinguishes between two measures for the amount of information in the sample: set size and the extent to which the set of exemplars statistically covers the underlying structure. In an artificial grammar learning experiment, learning was affected by the sample’s statistical coverage of the grammar, but not by its mere size. Our result suggests an alternative explanation of the set size effects on learning found in previous studies (McAndrews & Moscovitch, 1985; Meulemans & Van der Linden, 1997), because, as we argue, set size was confounded with statistical coverage in these studies. nt]mis|This research was supported by a grant from the Netherlands Organization for Scientific Research. We thank Jarry Porsius for his help with the data analyses. -
Poletiek, F. H. (2009). Popper's Severity of Test as an intuitive probabilistic model of hypothesis testing. Behavioral and Brain Sciences, 32(1), 99-100. doi:10.1017/S0140525X09000454.
-
Poletiek, F. H., & Wolters, G. (2009). What is learned about fragments in artificial grammar learning? A transitional probabilities approach. Quarterly Journal of Experimental Psychology, 62(5), 868-876. doi:10.1080/17470210802511188.
Abstract
Learning local regularities in sequentially structured materials is typically assumed to be based on encoding of the frequencies of these regularities. We explore the view that transitional probabilities between elements of chunks, rather than frequencies of chunks, may be the primary factor in artificial grammar learning (AGL). The transitional probability model (TPM) that we propose is argued to provide an adaptive and parsimonious strategy for encoding local regularities in order to induce sequential structure from an input set of exemplars of the grammar. In a variant of the AGL procedure, in which participants estimated the frequencies of bigrams occurring in a set of exemplars they had been exposed to previously, participants were shown to be more sensitive to local transitional probability information than to mere pattern frequencies. -
Poletiek, F. H. (2002). [Review of the book Adaptive thinking: Rationality in the real world by G. Gigerenzer]. Acta Psychologica, 111(3), 351-354. doi:10.1016/S0001-6918(02)00046-X.
-
Poletiek, F. H. (2002). How psychiatrists and judges assess the dangerousness of persons with mental illness: An 'expertise bias'. Behavioral Sciences & the Law, 20(1-2), 19-29. doi:10.1002/bsl.468.
Abstract
When assessing dangerousness of mentally ill persons with the objective of making a decision on civil commitment, medical and legal experts use information typically belonging to their professional frame of reference. This is investigated in two studies of the commitment decision. It is hypothesized that an ‘expertise bias’ may explain differences between the medical and the legal expert in defining the dangerousness concept (study 1), and in assessing the seriousness of the danger (study 2). Judges define dangerousness more often as harming others, whereas psychiatrists more often include harm to self in the definition. In assessing the seriousness of the danger, experts tend to be more tolerant with regard to false negatives, as the type of behavior is more familiar to them. The theoretical and practical implications of the results are discussed. -
Poletiek, F. H. (2002). Implicit learning of a recursive rule in an artificial grammar. Acta Psychologica, 111(3), 323-335. doi:10.1016/S0001-6918(02)00057-4.
Abstract
Participants performed an artificial grammar learning task, in which the standard finite
state grammar (J. Verb. Learn. Verb. Behavior 6 (1967) 855) was extended with a recursive
rule generating self-embedded sequences. We studied the learnability of such a rule in two experiments.
The results verify the general hypothesis that recursivity can be learned in an artificial
grammar learning task. However this learning seems to be rather based on recognising
chunks than on abstract rule induction. First, performance was better for strings with more
than one level of self-embedding in the sequence, uncovering more clearly the self-embedding
pattern. Second, the infinite repeatability of the recursive rule application was not spontaneously
induced from the training, but it was when an additional cue about this possibility was
given. Finally, participants were able to verbalise their knowledge of the fragments making up
the sequences––especially in the crucial front and back positions––, whereas knowledge of the
underlying structure, to the extent it was acquired, was not articulatable. The results are discussed
in relation to previous studies on the implicit learnability of complex and abstract rules.
Share this page