A word-by-word human sentence processing complexity metric is presented. This metric formalizes the intuition that comprehenders have more trouble on words contributing larger amounts of information about the syntactic structure of the sentence as a whole. The formalization is in terms of the conditional entropy of grammatical continuations, given the words that have been heard so far. To calculate the predictions of this metric, Wilson and Carroll's (1954) original entropy reduction idea is extended to infinite languages. This is demonstrated with (...) a mildly context-sensitive language that includes relative clauses formed on a variety of grammatical relations across the Accessibility Hierarchy of Keenan and Comrie (1977). Predictions are derived that correlate significantly with repetition accuracy results obtained in a sentence-memory experiment (Keenan & Hawkins, 1987). (shrink)

All other things being equal the parser favors attaching an ambiguous modifier to the most recent possible site. A plausible explanation is that locality preferences such as this arise in the service of minimizing memory costs—more distant sentential material is more difficult to reactivate than more recent material. Note that processing any sentence requires linking each new lexical item with material in the current parse. This often involves the construction of long‐distance dependencies. Under a resource‐limited view of language processing, lengthy (...) integrations should induce difficulty even in unambiguous sentences. To date there has been little direct quantitative evidence in support of this perspective. This article presents 2 self‐paced reading studies, which explore the hypothesis that dependency distance is a fundamental determinant of reading complexity in unambiguous constructions in English. The evidence suggests that the difficulty associated with integrating a new input item is heavily determined by the amount of lexical material intervening between the input item and the site of its target dependents. The patterns observed here are not straightforwardly accounted for within purely experience‐based models of complexity. Instead, this work supports the role of a memory bottleneck in language comprehension. This constraint arises because hierarchical linguistic relations must be recovered from a linear input stream. (shrink)

The problems of access—retrieving linguistic structure from some mental grammar —and disambiguation—choosing among these structures to correctly parse ambiguous linguistic input—are fundamental to language understanding. The literature abounds with psychological results on lexical access, the access of idioms, syntactic rule access, parsing preferences, syntactic disambiguation, and the processing of garden‐path sentences. Unfortunately, it has been difficult to combine models which account for these results to build a general, uniform model of access and disambiguation at the lexical, idiomatic, and syntactic levels. (...) For example, psycholinguistic theories of lexical access and idiom access and parsing theories of syntactic rule access have almost no commonality in methodology or coverage of psycholinguistic data. This article presents a single probabilistic algorithm which models both the access and disambiguation of linguistic knowledge. The algorithm is based on a parallel parser which ranks constructions for access, and interpretations for disambiguation, by their conditional probability. Low‐ranked constructions and interpretations are pruned through beam‐search; this pruning accounts, among other things, for the garden‐path effect. I show that this motivated probabilistic treatment accounts for a wide variety of psycholinguistic results, arguing for a more uniform representation of linguistic knowledge and for the use of probabilistically‐enriched grammars and interpreters as models of human knowledge of and processing of language. (shrink)

This dissertation investigates the ways in which natural language restricts the domains of quantifiers. Adverbs of quantification are analyzed as quantifying over situations. The domain of quantifiers is pragmatically constrained: apparent processes of "semantic partition" are treated as pragmatic epiphenomena. The introductory Chapter 1 sketches some of the background of work on natural language quantification and begins the analysis of adverbial quantification over situations. Chapter 2 develops the central picture of "semantic partition" as a side-effect of pragmatic processes of anaphora (...) resolution. I argue that the apparent effects of topic/focus articulation and presuppositional information on the interpretation of quantifiers are not the result of a direct and local mechanism of sentence grammar. Instead, I develop an analysis where the link is established via the anaphoric dependence of quantifier domains on the discourse context. Chapter 3 discusses the analysis of conditional clauses as quantifier restrictors, concentrating on the question whether conditional clauses restrict quantifiers directly or indirectly. A treatment is explored which has if-clauses constrain the value of the hidden domain variable of the restricted quantifier. Chapter 4, on unless-clauses, and Chapter 5, on only if- and even if-clauses, present some issues in the compositional analysis of complex conditional clauses. These chapters significantly expand the data coverage of the theory of A-quantification. Building on previous work of mine on exceptives, I analyze unless-clauses as exceptive operators on A-quantifiers. The analysis of only if-clauses, treated as conditional clauses that combine if with the focus adverb only, unearthes some interesting new properties. Chapter 6, finally, examines the phenomenon of donkey-anaphora in the light of the results of the previous chapters. I show that a solution to the proportion problem may become possible once we combine the situation-semantic approach to adverbial quantification with the pragmatic theory developed in Chapter 2 and further elaborated in the analysis of donkey anaphora in complex conditionals. (shrink)

We present a detailed process theory of the moment‐by‐moment working‐memory retrievals and associated control structure that subserve sentence comprehension. The theory is derived from the application of independently motivated principles of memory and cognitive skill to the specialized task of sentence parsing. The resulting theory construes sentence processing as a series of skilled associative memory retrievals modulated by similarity‐based interference and fluctuating activation. The cognitive principles are formalized in computational form in the Adaptive Control of Thought–Rational (ACT–R) architecture, and our (...) process model is realized in ACT–R. We present the results of 6 sets of simulations: 5 simulation sets provide quantitative accounts of the effects of length and structural interference on both unambiguous and garden‐path structures. A final simulation set provides a graded taxonomy of double center embeddings ranging from relatively easy to extremely difficult. The explanation of center‐embedding difficulty is a novel one that derives from the model' complete reliance on discriminating retrieval cues in the absence of an explicit representation of serial order information. All fits were obtained with only 1 free scaling parameter fixed across the simulations; all other parameters were ACT–R defaults. The modeling results support the hypothesis that fluctuating activation and similarity‐based interference are the key factors shaping working memory in sentence processing. We contrast the theory and empirical predictions with several related accounts of sentence‐processing complexity. (shrink)

In relative clause extraposition (RCE) in English, a noun is modified by a non-adjacent RC, resulting in a discontinuous dependency, as in: Three people arrived here yesterday who were from Chicago. Although discourse focus is known to influence the choice of RCE over truth-conditionally equivalent sentences with canonical structure (Rochemont and Culicover, English focus constructions and the theory of grammar, Cambridge University Press, 1990; Takami, A functional constraint on Extraposition from NP, John Benjamins, 1999), Hawkins (Efficiency and complexity in grammars, (...) Oxford University Press, 2004) and Wasow (Postverbal behavior, CSLI Publications, 2002) have proposed in addition that RCE should be preferred when the relative clause is long (or ‘heavy’) relative to the VP because such structures are processed more efficiently in comprehension and production. The current study tested this hypothesis based on Hawkins' (Efficiency and complexity in grammars, Oxford University Press, 2004) domain minimization principles. In an acceptability judgment task, canonical sentences were rated significantly higher than extraposition sentences when the RC was light, but this difference disappeared when the RC was heavy. In a self-paced reading task, extraposition sentences were read significantly faster than canonical sentences when the RC was heavy, but there was no difference when the RC was light. In an analysis of RCE in the ICE-GB corpus, extraposed RCs were significantly longer than the VP on average, whereas canonical RCs were significantly shorter, and the proportion of sentences with extraposition decreased as the ratio of VP-to-RC length increased. These findings support Hawkins' (Efficiency and complexity in grammars, Oxford University Press, 2004) domain minimization principles and help explain why a discontinuous dependency is allowed and sometimes preferred even in a language with relatively fixed word order. (shrink)