Optimal Constructions∗
نویسندگان
چکیده
This paper deals with a well-known problem in the discussion of argument linking, the flexibility that we find with particular verbs, and the constraints governing the integration of verbs with so-called argument structure constructions. We will show that traditional approaches as well as construction grammar need additional machinery to deal with variable argument linking. I will present an optimisation approach to variable argument linking that uses construction grammar as format for morphosyntax. Section 1 introduces the phenomenon. Section 2 introduces the concept of argument structure constructions from construction grammar. Section 3 provides a detailed analysis of the problem and offers an optimality theoretic account. Further aspects are discussed in sections 4 and 5. Section 6 briefly discusses formal aspects of the proposed constructionist model of OT syntax.
منابع مشابه
Geometric constructions of optimal optical orthogonal codes
We provide a variety of constructions of (n,w, λ)-optical orthogonal codes using special sets of points and Singer groups in finite projective spaces. In several of the constructions, we are able to prove that the resulting codes are optimal with respect to the Johnson bound. The optimal codes exhibited have λ = 1, 2 and w − 1 (where w is the weight of each codeword in the code). The remaining ...
متن کاملThe Impact of Different Frequency Patterns on the Syntactic Production of a 6-year-old EFL Home Learner: A Case Study
This longitudinal study investigated the impact of different Frequency Patterns (FP) on the syntactic production of a six-year-old EFL learner in a home context. Target syntactic constructions were presented using games and plays and were traced for their occurrence patterns in input and output. Following each instruction period, the constructions were measured through immediate and delayed ora...
متن کاملSome Notes on Constructions of Binary Sequences with Optimal Autocorrelation
Constructions of binary sequences with low autocorrelation are considered in the paper. Based on recent progresses about this topic, several more general constructions of binary sequences with optimal autocorrelations and other low autocorrelations are presented.
متن کاملOn the Error Parameter of Dispersers
Optimal dispersers have better dependence on the error than optimal extractors. In this paper we give explicit disperser constructions that beat the best possible extractors in some parameters. Our constructions are not strong, but we show that having such explicit strong constructions implies a solution to the Ramsey graph construction problem.
متن کاملTowards Optimal Randomness Extractors and Ramsey Graphs
I will survey some of the recent exciting progress on explicit constructions of randomness extractors for independent sources. Many of the new constructions rely on explicit constructions of newly introduced pseudorandom primitives, and there remains scope of finding better explicit constructions of these primitives. I will also discuss some possible approaches for constructing optimal Ramsey g...
متن کاملOptical Orthogonal Codes from Singer Groups
We construct some new families of optical orthogonal codes that are asymptotically optimal. In particular, for any prescribed value of λ, we construct infinite families of (n, w, λ)-OOCs that in each case are asymptotically optimal. Our constructions rely on various techniques in finite projective spaces involving normal rational curves and Singer groups. These constructions generalize and impr...
متن کامل