Merge: Binarity in (Multidominant) Syntax

Date

2021-02-01

Author

Citko, Barbara
Gracanın Yüksek, Martına

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

180
views

0
downloads

An argument that Merge is binary but its binarity refers to syntactic positions rather than objects. In this book, Barbara Citko and Martina Gračanin-Yuksek examine the constraints on Merge—the basic structure-building operation in minimalist syntax—from a multidominant perspective. They maintain that Merge is binary, but argue that the binarity of Merge refers to syntactic positions Merge relates: what has typically been formulated as a constraint that prevents Merge from combining more than two syntactic objects is a constraint on Merge's relating more than two syntactic positions. Citko and Gračanin-Yuksek investigate the interactions between the two types of Merge that can generate multidominant structures: Parallel Merge and Internal Merge. Taking Right Node Raiding (RNR) as a representative example of Parallel Merge and Across-the-Board (ATB) extraction to be representative of Parallel Merge + Internal Merge, they show that ATB is subject to a parallelism constraint that RNR is not subject to. They show that this difference follows from Binarity Constraint on Merge (BiCoM), the requirement that prevents Merge from relating more than two syntactic positions within a single derivation, which is obeyed in RNR, but not in ATB extraction. They further show that BiCoM is also operative in languages with more flexible word order, such as Croatian and Polish, and that structural syncretism alleviates BiCoM violations in these languages as well.

URI

https://mitpress.mit.edu/books/series/linguistic-inquiry-monographs
https://hdl.handle.net/11511/89120

Collections

Department of Foreign Language Education, Book / Book chapter

Suggestions

OpenMETU
Core

Hybrid classes of balanced Boolean functions with good cryptographic properties Khan, Mansoor Ahmed; Özbudak, Ferruh (2014-07-20) Cryptographically strong Boolean functions play an imperative role in the design of almost every modern symmetric cipher. In this context, the cryptographic properties of Boolean functions, such as non-linearity, algebraic degree, correlation immunity and propagation criteria, are critically considered in the process of designing these ciphers. More recently, with the emergence of algebraic and fast algebraic attacks, algebraic immunity has also been included as an integral property to be considered. As a r...
Coloring 3D symmetry set: perceptual meaning and significance in 3D Tarı, Zehra Sibel (1999-12-01) A computational implementation for assigning perceptual meaning and significance to the points in the symmetry is presented. The coloring scheme allows recovery of the features of interest such as the shape skeletons from the complicated symmetry representation. The method is applicable to arbitrary data including color and multi-modality images. On the computational side, for a 256 × 256 binary image, two minutes on a low-end Pentium machine is enough to compute both the distance function and the colored n...
Quasi-Cartan companions of elliptic cluster algebras Velioğlu, Kutlucan; Seven, Ahmet İrfan; Department of Mathematics (2016) There is an analogy between combinatorial aspects of cluster algebras and diagrams corresponding to skew-symmetrizable matrices. In this thesis, we study quasi-Cartan companions of skew-symmetric matrices in the mutation-class of exceptional elliptic diagrams. In particular, we establish the existence of semipositive admissible quasi-Cartan companions for these matrices and exhibit some other invariant properties.
LPL++: Object logic programming language with built-in inheritance through unification Toroslu, İsmail Hakkı (Association for Computing Machinery (ACM), 1998-03-01) In this paper, an object logic programming language is proposed that captures ail of the basic object-oriented concepts in standard logic programming environment. This paper combines and extends two previously proposed models, namely Conery's technique (1988) which uses first-order logic to model objects including all of the basic object-oriented concepts except inheritance, and the LOGIN language of Ait-Kaci and Nasr (1986) which embeds inheritance into unification using typed logic.
Model-theory of vector-spaces over unspecified fields Pierce, David (2009-06-01) Vector spaces over unspecified fields can be axiomatized as one-sorted structures, namely, abelian groups with the relation of parallelism. Parallelism is binary linear dependence. When equipped with the n-ary relation of linear dependence for some positive integer n, a vector-space is existentially closed if and only if it is n-dimensional over an algebraically closed field. In the signature with an n-ary predicate for linear dependence for each positive integer n, the theory of infinite-dimensional vector...

Citation Formats

B. Citko and M. Gracanın Yüksek, Merge: Binarity in (Multidominant) Syntax. 2021.