C-command | EPFL Graph Search

Are you an EPFL student looking for a semester project?

Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.

In generative grammar and related frameworks, a node in a parse tree c-commands its sister node and all of its sister's descendants. In these frameworks, c-command plays a central role in defining and constraining operations such as syntactic movement, binding, and scope. Tanya Reinhart introduced c-command in 1976 as a key component of her theory of anaphora. The term is short for "constituent command". Common terms to represent the relationships between nodes are below (refer to the tree on the right): M is a parent or mother to A and B. A and B are children or daughters of M. A and B are sisters. M is a grandparent to C and D. The standard definition of c-command is based partly on the relationship of dominance: Node N1 dominates node N2 if N1 is above N2 in the tree and one can trace a path from N1 to N2 moving only downwards in the tree (never upwards); that is, if N1 is a parent, grandparent, etc. of N2. For a node (N1) to c-command another node (N2) the parent of N1 must establish dominance over N2. Based upon this definition of dominance, node N1 c-commands node N2 if and only if: Node N1 does not dominate N2, N2 does not dominate N1, and The first (i.e. lowest) branching node that dominates N1 also dominates N2. For example, according to the standard definition, in the tree at the right, M does not c-command any node because it dominates all other nodes. A c-commands B, C, D, E, F, and G. B c-commands A. C c-commands D, F, and G. D c-commands C and E. E does not c-command any node because it does not have a sister node or any daughter nodes. F c-commands G. G c-commands F. If node A c-commands node B, and B also c-commands A, it can be said that A symmetrically c-commands B. If A c-commands B but B does not c-command A, then A asymmetrically c-commands B. The notion of asymmetric c-command plays a major role in Richard S. Kayne's theory of Antisymmetry. A simplification of the standard definition on c-command is as follows: A node A c-commands a node B iff Neither A nor B dominates the other, and Every branching node dominating A also dominates B As such, we get sentences like: (1) [John] likes [her] Where [node A] John c-commands [node B].

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (4)

Related concepts (11)

Syntactic movement

Syntactic movement is the means by which some theories of syntax address discontinuities. Movement was first postulated by structuralist linguists who expressed it in terms of discontinuous constituents or displacement. Some constituents appear to have been displaced from the position in which they receive important features of interpretation. The concept of movement is controversial and is associated with so-called transformational or derivational theories of syntax (such as transformational grammar, government and binding theory, minimalist program).

Government (linguistics)

In grammar and theoretical linguistics, government or rection refers to the relationship between a word and its dependents. One can discern between at least three concepts of government: the traditional notion of case government, the highly specialized definition of government in some generative models of syntax, and a much broader notion in dependency grammars. Case government In traditional Latin and Greek (and other) grammars, government is the control by verbs and prepositions of the selection of grammatical features of other words.

Binding (linguistics)

In linguistics, binding is the phenomenon in which anaphoric elements such as pronouns are grammatically associated with their antecedents. For instance in the English sentence "Mary saw herself", the anaphor "herself" is bound by its antecedent "Mary". Binding can be licensed or blocked in certain contexts or syntactic configurations, e.g. the pronoun "her" cannot be bound by "Mary" in the English sentence "Mary saw her". While all languages have binding, restrictions on it vary even among closely related languages.

Types of boredom and other learning activity emotions: A person-centred investigation of inter-individual data

Alexandra Corina Niculescu

Whether boredom is a unitary construct or if multiple types of boredom exist is a long-standing debate. Recent research has established the existence of boredom types based on frequency observations of boredom by experience sampling. This work tries to exp ...

2021

Partially-supervised Mention Detection

James Henderson

Learning to detect entity mentions without using syntactic information can be useful for integration and joint optimization with other tasks. However, it is common to have partially annotated data for this problem. Here, we investigate two approaches to de ...

ACL2020

Transfer Learning from Pre-trained BERT for Pronoun Resolution

Qianqian Qiao, Xingce Bao

The paper describes the submission of the team "We used bert!" to the shared task Gendered Pronoun Resolution (Pair pronouns to their correct entities). Our final submission model based on the fine-tuned BERT (Bidirectional Encoder Representations from Tra ...

ASSOC COMPUTATIONAL LINGUISTICS-ACL2019