We present a formal syntax of approximate formulas suited for the logic with counting quantifiers SOLP. This logic was studied by us in [1] where, among other properties, we showed: (i) In the presence of a built–in (linear) order, SOLP can describeNP–complete problems and fragments of it capture classes likeP andNL; (ii) weakening the ordering relation to an almost order we can separate meanin...

This paper proposes a new theory of the relationship between the sentence processing mechanism and the available computational resources. This theory--the Syntactic Prediction Locality Theory (SPLT)--has two components: an integration cost component and a component for the memory cost associated with keeping track of obligatory syntactic requirements. Memory cost is hypothesized to be quantifie...

Syntactic complexity as an indicator in the study of English learners’ language proficiency has been frequently employed in language development assessment. Using the Syntactic Complexity Analyzer, developed by Lu (2010), this article collected data representing the syntactic complexity indexes from the writing of Chinese non-English major students and from the writing of proficient users of En...

Syntactic complexity effects have been investigated extensively with respect to comprehension (e.g., Demberg & Keller, 2008; Gibson, 1998, 2000; Gordon et al., 2001, 2004; Grodner & Gibson, 2005; King & Just, 1991; Lewis & Vasishth, 2005; Lewis et al., 2006; McElree et al., 2003; Wanner & Maratsos, 1978). According to one prominent class of accounts (experience-based accounts; e.g., Hale, 2001;...

We study the properties of syntactic monoids of bifix-free regular languages. In particular, we solve an open problem concerning syntactic complexity: We prove that the car-dinality of the syntactic semigroup of a bifix-free language with state complexity n is at most (n−1) n−3 +(n−2) n−3 +(n−3)2 n−3 for n 6. The main proof uses a large construction with the method of injective function. Since ...

This work uses the L-system to construct a tree structure for the text sequence and derives its complexity [1]. It serves as a measure of structural complexity of the text. It is applied to anomaly detection in data transmission. Keyword: text complexity, anomaly detection, structural complexity, rewriting rule, context-free grammar, L-system

The current fMRI adaptation study sought to elucidate the dimensions of syntactic complexity and their underlying neural substrates. For the first time with fMRI, we investigated repetition suppression (i.e., fMRI adaptation) for two orthogonal dimensions of sentence complexity: embedding position (right-branching vs. center-embedding) and movement type (subject vs. object). Two novel results w...

PURPOSE This article addresses complexity in the context of treatment for sentence structural impairments in agrammatic aphasia, with emphasis on noncanonical sentences involving linguistic movement and their related counterparts. Extensions of the complexity effect to recovery of canonical sentences also are discussed, stressing the linguistic properties of verbs as well as grammatical morphol...

Based on a review of the neuroimaging literature, I argue that the resources allocated for processing syntactically complex sentences (i.e., object-extracted relative clauses) are domain-general. Overlapping brain areas are activated by OR clauses and by effortful executive tasks such as storing information in verbal working memory, resolving conflict among competing representations, and switch...