31 resultados para Penalty clauses
em University of Queensland eSpace - Australia
Resumo:
While a number of studies have shown that object-extracted relative clauses are more difficult to understand than subject-extracted counterparts for second language (L2) English learners (e.g., Izumi, 2003), less is known about why this is the case and how they process these complex sentences. This exploratory study examines the potential applicability of Gibson's (1998, 2000) Syntactic Prediction Locality Theory (SPLT), a theory proposed to predict first language (L1) processing difficulty, to L2 processing and considers whether the theory might also account for the processing difficulties of subject- and object-extracted relative clauses encountered by L2 learners. Results of a self-paced reading time experiment from 15 Japanese learners of English are mainly consistent with the reading time profile predicted by the SPLT and thus suggest that the L1 processing theory might also be able to account for L2 processing difficulty.
Resumo:
Thc oen itninteureasc ttioo nb eo fa pcreangtmraal tiiscs uaen di ns ymnotadcetlisc ocfo nsestnrtaeinnctse processing. It is well established that object relatives (1) are harder to process than subject relatives (2). Passivization, other things being equal, increases sentence complexity. However, one of the functions of the passive construction is to promote an NP into the role of subject so that it can be more easily bound to the head NP in a higher clause. Thus, (3) is predicted to be marginally preferred over (1). Passiviazation in this instance may be seen as a way of avoiding the object relative construction. 1. The pipe that the traveller smoked annoyed the passengers. 2. The traveller that smoked the pipe annoyed the passengers. 3.The pipe that was smoked by the traveller annoyed the 4.The traveller that the pipe was smoked by annoyed the 5.The traveller that the lady was assaulted by annoyed the In (4) we have relativization of an NP which has been demoted by passivization to the status of a by-phrase. Such relative clauses may only be obtained under quite restrictive pragmatic conditions. Many languages do not permit relativization of a constituent as low as a by-phrase on the NP accessibility hierarchy (Comrie, 1984). The factors which determine the acceptability of demoted NP relatives like (4-5) reflect the ease with which the NP promoted to subject position can be taken as a discourse topic. We explored the acceptability of sentences such as (1-5) using pair-wise judgements of samddifferent meaning, accompanied by ratings of easeof understanding. Results are discussed with reference to Gibsons DLT model of linguistic complexity and sentence processing (Gibson, 2000)
Resumo:
Recent work by Siegelmann has shown that the computational power of recurrent neural networks matches that of Turing Machines. One important implication is that complex language classes (infinite languages with embedded clauses) can be represented in neural networks. Proofs are based on a fractal encoding of states to simulate the memory and operations of stacks. In the present work, it is shown that similar stack-like dynamics can be learned in recurrent neural networks from simple sequence prediction tasks. Two main types of network solutions are found and described qualitatively as dynamical systems: damped oscillation and entangled spiraling around fixed points. The potential and limitations of each solution type are established in terms of generalization on two different context-free languages. Both solution types constitute novel stack implementations - generally in line with Siegelmann's theoretical work - which supply insights into how embedded structures of languages can be handled in analog hardware.
Resumo:
We present an approach to parsing rehive clauses in Arabic in the tradition of the Paninian Grammar Frumework/2] which leads to deriving U common logicul form for equivalent sentences. Particular attention is paid to the analysis of resumptive pronouns in the retrieval of syntuctico-semantic relationships. The analysis arises from the development of a lexicalised dependency grammar for Arabic that has application for machine translation.
Resumo:
This paper investigates combinatorial arrangements of the dartboard to maximize a penalty function derived from the differences of adjacent sectors. The particular penalty function is constructed by summing the absolute differences of neighbouring sectors raised to a power between zero and one. The arrangement to give the maximum penalty is found
Resumo:
There is a morpheme 'li' in Mauritian Creole (MC), which is homophonous with the 3sg pronoun, and which, in the early creole, occurs frequently between the subject and the predicate in affirmative, present tense clauses. I propose that that 'li' may have originated as a resumptive pronoun, co-referential with the subject, but following the grammaticalization of new determiner elements to mark the semantic contrasts of [±definite] and singular vs. plural, 'li' has now grammaticalized into a predicate marker. Its presence is sensitive to both the nature of the predicate, and to the definiteness and specificity features of the subject NP. My analysis is within the framework of Truth Conditional Semantics, where indefinite NPs are analyzed as variables that get introduced into the discourse, and must be bound by an operator to yield a closed proposition, with a truth value. Drawing on a comparison with a cognative morpheme 'i' in Seychellois Creole, I claim that its path to grammaticalization is linked to that of the specificity marking 'la'.
Resumo:
Contrary to the common pattern of spatial terms being metaphorically extended to location in time, the Australian language Jingulu shows an unusual extension of temporal markers to indicate location in space. Light verbs, which typically encode tense, aspect, mood and associated motion, are occasionally found on nouns to indicate the relative location of the referent with respect to the speaker. It is hypothesised that this pattern resulted from the reduction of verbal clauses used as relative modifiers to the nouns in question.
Resumo:
A model for finely layered visco-elastic rock proposed by us in previous papers is revisited and generalized to include couple stresses. We begin with an outline of the governing equations for the standard continuum case and apply a computational simulation scheme suitable for problems involving very large deformations. We then consider buckling instabilities in a finite, rectangular domain. Embedded within this domain, parallel to the longer dimension we consider a stiff, layered beam under compression. We analyse folding up to 40% shortening. The standard continuum solution becomes unstable for extreme values of the shear/normal viscosity ratio. The instability is a consequence of the neglect of the bending stiffness/viscosity in the standard continuum model. We suggest considering these effects within the framework of a couple stress theory. Couple stress theories involve second order spatial derivatives of the velocities/displacements in the virtual work principle. To avoid C-1 continuity in the finite element formulation we introduce the spin of the cross sections of the individual layers as an independent variable and enforce equality to the spin of the unit normal vector to the layers (-the director of the layer system-) by means of a penalty method. We illustrate the convergence of the penalty method by means of numerical solutions of simple shears of an infinite layer for increasing values of the penalty parameter. For the shear problem we present solutions assuming that the internal layering is oriented orthogonal to the surfaces of the shear layer initially. For high values of the ratio of the normal-to the shear viscosity the deformation concentrates in thin bands around to the layer surfaces. The effect of couple stresses on the evolution of folds in layered structures is also investigated. (C) 2002 Elsevier Science Ltd. All rights reserved.
Resumo:
In this paper, genetic algorithm (GA) is applied to the optimum design of reinforced concrete liquid retaining structures, which comprise three discrete design variables, including slab thickness, reinforcement diameter and reinforcement spacing. GA, being a search technique based on the mechanics of natural genetics, couples a Darwinian survival-of-the-fittest principle with a random yet structured information exchange amongst a population of artificial chromosomes. As a first step, a penalty-based strategy is entailed to transform the constrained design problem into an unconstrained problem, which is appropriate for GA application. A numerical example is then used to demonstrate strength and capability of the GA in this domain problem. It is shown that, only after the exploration of a minute portion of the search space, near-optimal solutions are obtained at an extremely converging speed. The method can be extended to application of even more complex optimization problems in other domains.