Figures and data

Experiment 1 – Subtraction verification task.

A) RTs as a function of group (NT/CA), expectancy effect (unexpected minus expected), and complexity effect (high minus low). B1) The expectancy effect for each group. B2) The complexity effect for each group. Each datapoint is a participant. Error bars = SEM. * indicates p = .009. n.s = not significant.

Experiment 2 – Alphabet transformation task.

A) RTs as a function of group (NT/CA), expectancy (unexpected/expected), and complexity (high/low). B1) The expectancy effect (unexpected minus expected) for each group. B2) The complexity effect (high minus low) for each group. Each datapoint is a participant. Error bars = SEM. * indicates p < .0001. n.s = not significant.

The finite-state Markovian rule system used in Experiment 3. S1-S5 indicate the states that occur during the generation of grammatical letter strings. Letter strings are formed by starting at one entry and then by navigating from one transition to another, with each transition being able to generate a letter. A letter string terminates when an exit is reached.

A) Accuracy as a function of group (NT/CA), expectancy (expected/unexpected), and similarity (high/low). B) Sensitivity (d’) as a function of group for each level of similarity (high/low). Each datapoint is a participant. Error bars = SEM. * indicates p < .0001. n.s = not significant.
