Transwiki:C-command

Transwiki:C-command: "

Undo revision 13075895 by Internoob (talk)

← Older revision		Revision as of 04:50, 10 May 2011
(2 intermediate revisions by one user not shown)
Line 1:		Line 1:
-	In [[syntax]], '''c-command''' is a relationship between nodes in [[parse tree]]s. Originally defined by [[Tanya Reinhart]] (1976, 1983),<ref>	+	==English==
-	See also [[Howard Lasnik]] (1975) and [[Noam Chomsky]] (1981).</ref>
-	it corresponds to the idea of 'siblings and all their descendants' in [[family tree]]s.
-	==Definition and Example==	+	===Etymology===
-	[[File:C-command.png|right|thumb|A simple syntax tree.]]	+	Introduced by {{w|Tanya Reinhart}} in her 1976 [[MIT]] dissertation (p.&nbsp;32),{{fact|date=February 2010}} and is a shortened form of '[[constituent]] command." Reinhart herself thanks {{w|Nick Clements}} for suggesting both the term and its abbreviation. As discussed by {{w|Andrew Carnie}},<ref name="Carnie etym">{{quote-book
-
-	The definition of c-command is based partly on the relationship of ''dominance''. A node 'dominates' another node if it is above it in the tree (it is a parent, grandparent, etc.)
-
-	Using this definition of dominance, node ''A'' c-commands node ''B'' if and only if:
-	*A does not dominate B
-	*B does not dominate A
-	*The first branching node that dominates A, also dominates B<ref name="c-command def Haegeman">{{cite book
-	| last = Haegeman
-	| first = Liliane
-	| title = Introduction to Government and Binding Theory
-	| page = 147
-	| edition = 2nd
-	| publisher = Blackwell Publishing
-	| location = Oxford
-	| year = 1994
-	}}</ref><ref name="c-command def Carnie">{{cite book
-	| last = Carnie
-	| first = Andrew
-	| title = Syntax: A Generative Introduction
-	| page = 75
-	| edition = 1st
-	| publisher = Blackwell Publishing
-	| location = Oxford
-	| year = 2002
-	}}</ref>
-
-	For example, according to this 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'' c-commands ''D'', ''F'' and ''G''.
-	* ''F'' c-commands ''G''.
-	* ''G'' c-commands ''F''.
-
-	==Etymology==
-	The term "c-command" was introduced by {{w|Tanya Reinhart}} in her 1976 [[MIT]] dissertation (p.&nbsp;32),{{fact|date=February 2010}} and is a shortened form of "[[constituent]] command." Reinhart herself thanks {{w|Nick Clements}} for suggesting both the term and its abbreviation. As discussed by {{w|Andrew Carnie}},<ref name="Carnie etym">{{quote-book
	| last = Carnie		| last = Carnie
	| first = Andrew		| first = Andrew
Line 20:		Line 20:
	}}</ref>		}}</ref>
-	==C-command and the first branching node==	+	===Noun===
		+	{{en-noun|-}}
-	The above definition specified that the domain of c-command is the first ''branching'' node that dominates A. This relationship is sometimes known as ''strict c-command''.<ref name="Haegeman strict">{{cite book	+	# {{context|syntax}} The relationship between a node in a [[parse tree]] and its [[sibling]] [[node]]s (usually meaning the children of the first [[branch]]ing node that [[dominate]]s the node<ref name="Haegeman strict">{{quote-book
-	| last = Haegeman	+	| author = Liliane Haegeman
-	| first = Liliane
	| title = Introduction to Government and Binding Theory		| title = Introduction to Government and Binding Theory
	| page = 137		| page = 137
Line 30:		Line 30:
	| location = Oxford		| location = Oxford
	| year = 1994		| year = 1994
-	}}</ref> Without this specification, c-command would be limited to cases in which the first node of any sort dominating A also dominates B. The following tree illustrates how these two accounts differ in their result. If all nodes are considered, then ''A'' does not c-command any other nodes, because ''B'' dominates it and does not dominate any other nodes; if only branching nodes are considered, then ''B'' is irrelevant in evaluating the third criterion, and ''A'' does c-command ''D'', ''E'', and ''F''.	+	}}</ref>) and all their [[child]]ren.
-	:[[File:C-command 02.png]]
-	==See also==	+	===References===
-	*[[m-command]]
-
-	==References==
	<references/>		<references/>
	* Harris, C. L. and Bates, E. A. (2002) 'Clausal backgrounding and pronominal reference: A functionalist approach to c-command'. ''Language and Cognitive Processes'' '''17(3)''':237-269.		* Harris, C. L. and Bates, E. A. (2002) 'Clausal backgrounding and pronominal reference: A functionalist approach to c-command'. ''Language and Cognitive Processes'' '''17(3)''':237-269.
	* ''Contemporary Linguistics'' by William O'Grady, Michael Dobrovolsky, and Mark Aronoff. Bedford/St. Martin's. 1997 (third edition).		* ''Contemporary Linguistics'' by William O'Grady, Michael Dobrovolsky, and Mark Aronoff. Bedford/St. Martin's. 1997 (third edition).
	* Reinhart, Tanya M. (1976). ''The Syntactic Domain of Anaphora''. (Doctoral dissertation, Massachusetts Institute of Technology). (Available online at http://dspace.mit.edu/handle/1721.1/16400).		* Reinhart, Tanya M. (1976). ''The Syntactic Domain of Anaphora''. (Doctoral dissertation, Massachusetts Institute of Technology). (Available online at http://dspace.mit.edu/handle/1721.1/16400).
		+
		+	===See also===
		+	* [[m-command]]
	==External links==		==External links==
		+	* {{pedia}}
	* [http://www.ling.upenn.edu/courses/Fall_1999/ling550/ch1.html c-command and pronouns]		* [http://www.ling.upenn.edu/courses/Fall_1999/ling550/ch1.html c-command and pronouns]
	* [http://www.ling.upenn.edu/~beatrice/syntax-textbook/box-nodes.html Node relations], University of Pennsylvania		* [http://www.ling.upenn.edu/~beatrice/syntax-textbook/box-nodes.html Node relations], University of Pennsylvania

"

Source : Google Reader