6 resultados para Descriptive grammars

em Doria (National Library of Finland DSpace Services) - National Library of Finland, Finland


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Previous studies on pencil grip have typically dealt with the developmental aspects in young children while handwriting research is mainly concerned with speed and legibility. Studies linking these areas are few. Evaluation of the existing pencil grip studies is hampered by methodological inconsistencies. The operational definitions of pencil grip arerational but tend to be oversimplified while detailed descriptors tend to be impractical due to their multiplicity. The present study introduces a descriptive two-dimensional model for the categorisation of pencil grip suitable for research applications in a classroom setting. The model is used in four empirical studies of children during the first six years of writing instruction. Study 1 describes the pencil grips observed in a large group of pupils in Finland (n = 504). The results indicate that in Finland the majority of grips resemble the traditional dynamic tripod grip. Significant genderrelated differences in pencil grip were observed. Study 2 is a longitudinal exploration of grip stability vs. change (n = 117). Both expected and unexpected changes were observed in about 25 per cent of the children's grips over four years. A new finding emerged using the present model for categorisation: whereas pencil grips would change, either in terms of ease of grip manipulation or grip configuration, no instances were found where a grip would have changed concurrently on both dimensions. Study 3 is a cross-cultural comparison of grips observed in Finland and the USA (n = 793). The distribution of the pencil grips observed in the American pupils was significantly different from those found in Finland. The cross-cultural disparity is most likely related to the differences in the onset of writing instruction. The differences between the boys' and girls' grips in the American group were non-significant.An implication of Studies 2 and 3 is that the initial pencil grip is of foremost importance since pencil grips are largely stable over time. Study 4 connects the pencil grips to assessment of the mechanics of writing (n = 61). It seems that certain previously not recommended pencil grips might nevertheless be includedamong those accepted since they did not appear to hamper either fluency or legibility.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Inneh. bl. a. en engelsk öfvers af Runebergs "Vårt land".

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This thesis introduces an extension of Chomsky’s context-free grammars equipped with operators for referring to left and right contexts of strings.The new model is called grammar with contexts. The semantics of these grammars are given in two equivalent ways — by language equations and by logical deduction, where a grammar is understood as a logic for the recursive definition of syntax. The motivation for grammars with contexts comes from an extensive example that completely defines the syntax and static semantics of a simple typed programming language. Grammars with contexts maintain most important practical properties of context-free grammars, including a variant of the Chomsky normal form. For grammars with one-sided contexts (that is, either left or right), there is a cubic-time tabular parsing algorithm, applicable to an arbitrary grammar. The time complexity of this algorithm can be improved to quadratic,provided that the grammar is unambiguous, that is, it only allows one parsefor every string it defines. A tabular parsing algorithm for grammars withtwo-sided contexts has fourth power time complexity. For these grammarsthere is a recognition algorithm that uses a linear amount of space. For certain subclasses of grammars with contexts there are low-degree polynomial parsing algorithms. One of them is an extension of the classical recursive descent for context-free grammars; the version for grammars with contexts still works in linear time like its prototype. Another algorithm, with time complexity varying from linear to cubic depending on the particular grammar, adapts deterministic LR parsing to the new model. If all context operators in a grammar define regular languages, then such a grammar can be transformed to an equivalent grammar without context operators at all. This allows one to represent the syntax of languages in a more succinct way by utilizing context specifications. Linear grammars with contexts turned out to be non-trivial already over a one-letter alphabet. This fact leads to some undecidability results for this family of grammars