Processing non-adjacent dependencies is considered to be one of the hallmarks of human language. Assuming that sequence-learning tasks provide a useful way to tap natural-language-processing mechanisms, we cross-modally combined serial reaction time and artificial-grammar learning paradigms to investigate the processing of multiple nested (A 1 A 2 A 3 B 3 B 2 B 1 ) and crossed dependencies (A 1 A 2 A 3 B 1 B 2 B 3 ), containing either three or two dependencies. Both reaction times and prediction errors highlighted problems with processing the middle dependency in nested structures (A 1 A 2 A 3 B 3 _B 1 ), reminiscent of the 'missing-verb effect' observed in English and French, but not with crossed structures (A 1 A 2 A 3 B 1 _B 3 ). Prior linguistic experience did not play a major role: native speakers of German and Dutch-which permit nested and crossed dependencies, respectively-showed a similar pattern of results for sequences with three dependencies. As for sequences with two dependencies, reaction times and prediction errors were similar for both nested and crossed dependencies. The results suggest that constraints on the processing of multiple non-adjacent dependencies are determined by the specific ordering of the non-adjacent dependencies (i.e. nested or crossed), as well as the number of non-adjacent dependencies to be resolved (i.e. two or three). Furthermore, these constraints may not be specific to language but instead derive from limitations on structured sequence learning.Keywords: non-adjacent dependencies; sequence learning; artificial grammar learning; serial reaction time
THEORETICAL BACKGROUNDThe natural-language phenomenon of recursion and its potential underlying processing mechanisms have attracted great interest from scholars of different fields, including psycholinguistics, biology, computer science and cognitive neuroscience. Most research so far has focused on sequence-learning tasks, assuming that they share cognitive mechanisms with language processing. The focus in the past decade was to determine whether such tasks could capture processing differences between specific language structures, often with their processing complexity defined in terms of the Chomsky hierarchy [1]. In the current paper, we identify two different sources of processing complexity, and we propose that processing differences are intrinsically tied to (i) the memory resources required and (ii) relevant processing experience [2]. We will empirically investigate this claim by focusing on non-adjacent dependency processing.(a) Non-adjacency in language Recursion has been suggested to be a hallmark of human language (cf.[3]). Recursion is an operation that permits a finite set of rules to generate an infinite number of expressions. In this paper, we concentrate on bounded recursive structures involving multiple overlapping non-adjacent dependencies. Their existence has been suggested by generative linguists to be one of the major challenges for empirically based approaches to language [4], as they may point to the lim...