Tree structure - Revision history

NBlöcher: Removed the block {{format}}

2014-08-30T08:19:23Z

Removed the block {{format}}

NBlöcher: Edited the format

2014-08-30T07:56:57Z

Edited the format

LaurenAckerman: white space edits on the trees... do they look okay on other computers?

2010-07-25T19:02:59Z

white space edits on the trees... do they look okay on other computers?

Wohlgemuth: utrecht

2009-06-10T12:11:47Z

utrecht

New page

A '''tree structure''' is a graph which comprises a set of points, called [[node]]s, connected by [[branch]]es (represented by solid lines). Any given pair of nodes contained in the same tree will be related by one of two different types of relation, namely either by [[dominance]] or by [[precedence]]. A tree structure has only one top node.

(i) A
/ \
B C
| / \
| D E
| | |
b d e

=== Example ===

in (i) the node labelled A dominates all other nodes. Node C dominates D, but D does not dominate C. Node B precedes nodes D and E, as well as the nodes d and e. The nodes at the bottom of each complete tree structure (here in lower case) are called terminal nodes; other nodes are called non-terminal. Each node carries a label. Non-terminal nodes carry category labels; A, B, C, D, E in figure (i). Terminal nodes, unless they are empty, are labelled with an appropriate lexical item (a word), viz. b, d, e in (i). Nodes can be branching or non-branching. For example, node C in (i) branches into nodes D and E; node B is a non-branching node. Tree structures are used as a representation of the constituent structure of natural language expressions. Thus, the tree in (ii) represents the structure of the sentence ''John may eat apples''.

(ii) IP
/ |
NP I'
| |\
| I VP
John | |
| V'
may |\
V \
| NP
eat |
|
apples

The nodes with the category labels NP, IP, VP, I', V', V, I in (ii) are non-terminal nodes. The words ''John, may, eat, apples'' are the terminal nodes in this tree. Originally, tree structures were [[generate]]d by [[phrase structure rules]], or by the transformational rules that map the distinct levels of representation ( [[d-structure]], [[s-structure]], [[LF]], [[PF]]) onto each other. All binary relations (such as [[c-command]], [[sister]]hood) are defined over trees. Another term for tree structure is Phrase marker or P-marker (although a Phrase marker is formally different from a tree).

=== Links ===

[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Tree+structure&lemmacode=192 Utrecht Lexicon of Linguistics]

=== References ===

* Radford, A. 1988. ''Transformational grammar: a first course,'' Cambridge University Press, Cambridge UK.

{{dc}}
[[Category:Syntax]]

{{stub}}{{cats}}{{format}}

← Older revision		Revision as of 08:19, 30 August 2014
Line 39:		Line 39:


−	{{stub}}{{cats~~}}{{format~~}}	+	{{stub}}{{cats}}

@@ Line 1: / Line 1: @@
 A '''tree structure''' is a graph which comprises a set of points, called [[node]]s, connected by [[branch]]es (represented by solid lines). Any given pair of nodes contained in the same tree will be related by one of two different types of relation, namely either by [[dominance]] or by [[precedence]]. A tree structure has only one top node.
@@ Line 9: / Line 10: @@
    	      b	 d  e
-=== Example ===
+== Example ==
+In (i) the node labelled A dominates all other nodes. Node C dominates D, but D does not dominate C. Node B precedes nodes D and E, as well as the nodes d and e. The nodes at the bottom of each complete tree structure (here in lower case) are called terminal nodes; other nodes are called non-terminal. Each node carries a label. Non-terminal nodes carry category labels; A, B, C, D, E in figure (i). Terminal nodes, unless they are empty, are labelled with an appropriate lexical item (a word), viz. b, d, e in (i). Nodes can be branching or non-branching. For example, node C in (i) branches into nodes D and E; node B is a non-branching node. Tree structures are used as a representation of the constituent structure of natural language expressions. Thus, the tree in (ii) represents the structure of the sentence ''John may eat apples''.
   (ii)	       IP
@@ Line 29: / Line 29: @@
 The nodes with the category labels NP, IP, VP, I', V', V, I in (ii) are non-terminal nodes. The words ''John, may, eat, apples'' are the terminal nodes in this tree. Originally, tree structures were [[generate]]d by [[phrase structure rules]], or by the transformational rules that map the distinct levels of representation ( [[d-structure]], [[s-structure]], [[LF]], [[PF]]) onto each other. All binary relations (such as [[c-command]], [[sister]]hood) are defined over trees. Another term for tree structure is Phrase marker or P-marker (although a Phrase marker is formally different from a tree).
-=== Links ===
+== Links ==
+*[http://www2.let.uu.nl/UiL-OTS/Lexicon/zoek.pl?lemma=Tree+structure&lemmacode=192 Utrecht Lexicon of Linguistics]
 === References ===
 * Radford, A. 1988. ''Transformational grammar: a first course,'' Cambridge University Press, Cambridge UK.

@@ Line 3: / Line 3: @@
   (i)	        A
   	       / \
-  	      B	 C
+  	      B	  C
-                |  / \
+               |   /\
-  	      |	D  E
+  	      |  D  E
   	      |  |  |
-   	      b	d  e
+   	      b	 d  e
 === Example ===
@@ Line 14: / Line 14: @@
   (ii)	       IP
-                 /  |
+                 /|
   	     NP	I'
    	     |	|\
@@ Line 20: / Line 20: @@
   	   John	|  |
   		|  V'
-  	       may  |\
+  	       may |\
   		   V \
   		   |  NP
-                     eat  |
+                     eat |
-−
+ 		       |
   		     apples