Grammatical sensitivity: Its origins and potential contribution to early word reading skill

A three-phase longitudinal study examined the origins of grammatical sensitivity and its usefulness as a predictor of early word-level reading. At about 4 years of age, children were given a range of language and cognitive tests. One year later, the children were given a further series of language and cognitive tests, this time including grammatical sensitivity, phonological sensitivity, and nonword repetition. Another year later, word-level reading achievement was assessed. Overall, grammatical sensitivity and phonological sensitivity were more firmly grounded in earlier language ability than in cognitive ability. Phonological sensitivity and nonword repetition showed reliable predictive associations with subsequent word reading skills. Grammatical sensitivity did not. (c) 2005 Elsevier Inc. All rights reserved.

Cross-language Perception of Word-final Stops by Native Vietnamese Listeners: Preliminary Results on the Role of Specific, Non-native Phonetic Experience

This study examined the discrimination of word-final stop contrasts (/p/-/t/, /p/-/k/, /t/-/k/) in English and Thai by 12 listeners who speak Vietnamese as their first language (L1). Vietnamese shares specific phonetic realization of stops with Thai, i.e., unreleased final stop and differs from English which allows both released and unreleased final stops. These 12 native Vietnamese (NV) listeners’ discrimination accuracy was compared to that of the two listener groups (Australian English (AE), native Thai (NT)) tested in previous studies. The NV group was less accurate than the native group in discriminating both English and Thai stop contrasts. In particular, for the Thai /t/-/k/ contrast, they were significantly less accurate than the AE listeners. The present findings suggest that experience with specific (i.e., unreleased) and native phonetic realization of sounds may be essential in accurate discrimination of final stop contrasts. The effect of L1 dialect on cross-language speech perception is discussed.

Refinement of higher-order logic programs

A refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification. In this paper we extend the refinement calculus for logic programs to include higher-order programming capabilities in specifications and programs, such as procedures as terms and lambda abstraction. We use a higher-order type and term system to describe programs, and provide a semantics for the higher-order language and refinement. The calculus is illustrated by refinement examples.

Multivariate genetic analysis of cognitive abilities in an adolescent twin sample

The sources of covariation among cognitive measures of Inspection Time, Choice Reaction Time, Delayed Response Speed and Accuracy, and IQ were examined in a classical twin design that included 245 monozygotic (MZ) and 298 dizygotic (DZ) twin pairs. Results indicated that a factor model comprising additive genetic and unique environmental effects was the most parsimonious. In this model, a general genetic cognitive factor emerged with factor loadings ranging from 0.28 to 0.64. Three other genetic factors explained the remaining genetic covariation between various speed and Delayed Response measures with IQ. However, a large proportion of the genetic variation in verbal (54%) and performance (25%) IQ was unrelated to these lower order cognitive measures. The independent genetic IQ variation may reflect information processes not captured by the elementary cognitive tasks, Inspection Time and Choice Reaction Time, nor our working memory task, Delayed Response. Unique environmental effects were mostly nonoverlapping, and partly represented test measurement error.

Compilation by refinement for a practical assembly language

In this paper we extend the conventional framework of program refinement down to the assembler level. We describe an extension to the Refinement Calculus that supports the refinement of programs in the Guarded Command Language to programs in .NET assembler. This is illustrated by a small example.