Procedural deficit hypothesis claims that language deficit in children with specific language impairment is affiliated to sequence learning problems. However, studies did not explore on aspects of grammar vulnerable to sequence learning deficits. The present study makes predictions for aspects of grammar that could be sensitive to procedural deficits based on core ideas of procedural deficit hy...

This study compared the effects of teacher-provided direct and indirect written corrective feedback and manipulation of resource-directing dimensions of task cognitive complexity along +/- Here and Now condition on the grammatical accuracy of Iranian intermediate EFL learners’ narrative writing tasks. There were 45 participants in the study who were randomly assigned to three experimental group...

Language sample analysis is an important technique used in measuring language development. At present, measures of grammatical complexity such as the Index of Productive Syntax (Scarborough, 1990) are used to measure language development in early childhood. Although these measures depict the overall competence in the usage of language, they do not provide for an analysis of the grammatical mist...

We describe a Genetic Algorithm that can evolve complete programs. Using a variable length linear genome to govern the mapping of a Backus Naur Form grammar definition to a program, expressions and programs of arbitrary complexity may be evolved. Our system, Grammatical Evolution, has been applied to problems such as a Symbolic Regression problem, and finding Trigonometric Identities. In this p...

In the current paper we discuss the mechanisms that underlie the processing of inflectional and derivational complexity in English. We address this issue from a neurocognitive perspective and present evidence from a new fMRI study that the two types of morphological complexity engage the language processing network in different ways. The processing of inflectional complexity selectively activat...

One longstanding impediment to progress in understanding the neural basis of language is the development of model systems that retain language-relevant cognitive behaviors yet permit invasive cellular neuroscience methods. Recent experiments in songbirds suggest that this group may be developed into a powerful animal model, particularly for components of grammatical processing. It remains unkno...

Nparse is a shallow probabilistic unification-based parser for N-best list resorting and the finding of simple grammatical phrases. It is data-driven and robust, allowing both domainspecific and unrestricted-language training. We believe it can be an interesting alternative for use in a synthesis or recognition front end. This parser has been trained for Swedish on a fine-grained set of grammat...

Recently, several algorithms using number field sieves have been given to factor a number n in heuristic expected time Ln[1/3; c], where Ln[v; c] = exp{(c + o(1))(log n) (log log n)}, for n → ∞. In this paper we present an algorithm to solve the discrete logarithm problem for GF (p) with heuristic expected running time Lp[1/3; 3 ]. For numbers of a special form, there is an asymptotically slowe...

A circuit complexity of a graph is the minimum number of union and intersection operations needed to obtain the whole set of its edges starting from stars. Our main motivation to study this measure of graphs is that it is related to the circuit complexity of boolean functions. We prove some lower bounds to the circuit complexity of explicitly given graphs. In particular, we use the graph theore...