5 resultados para Romance languages -- To 1500 -- Word order -- Congresses

em University of Queensland eSpace - Australia


Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

It has long been observed that many languages from all over the world require that certain grammatical categories (e.g., person, number, tense, modality) occur in the "second position" of a clause. Much of the research into second position has developed formal explanations for this recurring pattern, based on interactions between morphosyntax and phonology. In this article I explore how pragmatics of information packaging interacts with these other features in the development of such morphosyntactic architecture in three North-Central Australian languages: Warlpiri, Wambaya, and Garrwa.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

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.