Projection - Revision history

imported>Vzakharov at 12:37, 28 August 2012

2012-08-28T12:37:18Z

← Older revision		Revision as of 12:37, 28 August 2012
Line 34:		Line 34:
	:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)		:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)
	;second intermediate projection (if any)		;second intermediate projection (if any)
	XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));		XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt);
	:projects the second intermediate projection (XB) in case of adjt (the tree has a comp and a adjt, or two adjts)		:projects the second intermediate projection (XB) in case of adjt (the tree has a comp and a adjt, or two adjts)
	XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));		XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2);
	:projects the second intermediate projection (XB) in case of comp (the tree has two comps)		:projects the second intermediate projection (XB) in case of comp (the tree has two comps)
	;third intermediate projection (if any)		;third intermediate projection (if any)

imported>Martins at 20:34, 17 April 2012

2012-04-17T20:34:05Z

← Older revision		Revision as of 20:34, 17 April 2012
Line 26:		Line 26:
	This is done by a set of rules as follows:		This is done by a set of rules as follows:

	;~~First~~ intermediate projection (lower XB)		;first intermediate projection (lower XB)
	XC(%head;%comp)<nowiki>:=</nowiki>XB(%head;%comp);		XC(%head;%comp)<nowiki>:=</nowiki>XB(%head;%comp);
	:projects the first intermediate projection (XB) in case of comp		:projects the first intermediate projection (XB) in case of comp

imported>Martins at 20:33, 17 April 2012

2012-04-17T20:33:50Z

← Older revision		Revision as of 20:33, 17 April 2012
Line 26:		Line 26:
	This is done by a set of rules as follows:		This is done by a set of rules as follows:

	~~==== first~~ intermediate projection (lower XB) ~~====~~		;First intermediate projection (lower XB)
	XC(%head;%comp)<nowiki>:=</nowiki>XB(%head;%comp);		XC(%head;%comp)<nowiki>:=</nowiki>XB(%head;%comp);
	:projects the first intermediate projection (XB) in case of comp		:projects the first intermediate projection (XB) in case of comp
Line 33:		Line 33:
	XH(%head)<nowiki>:=</nowiki>XB(%head;);		XH(%head)<nowiki>:=</nowiki>XB(%head;);
	:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)		:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)
	~~====~~ second intermediate projection (if any) ~~====~~		;second intermediate projection (if any)
	XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));		XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));
	:projects the second intermediate projection (XB) in case of adjt (the tree has a comp and a adjt, or two adjts)		:projects the second intermediate projection (XB) in case of adjt (the tree has a comp and a adjt, or two adjts)
	XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));		XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));
	:projects the second intermediate projection (XB) in case of comp (the tree has two comps)		:projects the second intermediate projection (XB) in case of comp (the tree has two comps)
			;third intermediate projection (if any)
	~~====~~ third intermediate projection (if any) ~~====~~
	XB(XB(%head;%xb1);%xb2))XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)		XB(XB(%head;%xb1);%xb2))XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)
	~~====~~ fourth intermediate projection (if any) ~~====~~		;fourth intermediate projection (if any)
	...		...
	~~====~~ maximal projection ~~====~~		;maximal projection
	XB(%head;)<nowiki>:=</nowiki>XP(XB(%head;););		XB(%head;)<nowiki>:=</nowiki>XP(XB(%head;););
	:minimal tree: the tree has only the head (no comp, adjt or spec)		:minimal tree: the tree has only the head (no comp, adjt or spec)

imported>Martins at 20:33, 17 April 2012

2012-04-17T20:33:05Z

imported>Martins at 20:32, 17 April 2012

2012-04-17T20:32:05Z

← Older revision		Revision as of 20:32, 17 April 2012
Line 35:		Line 35:
	==== second intermediate projection (if any) ====		==== second intermediate projection (if any) ====
	;XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));		;XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));
	:projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)		:projects the second intermediate projection (XB) in case of adjt (the tree has a comp and a adjt, or two adjts)
	;XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));		;XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));
	:projects the second intermediate projection (XB) in case of comp (the tree has two comps)		:projects the second intermediate projection (XB) in case of comp (the tree has two comps)

	==== third intermediate projection (if any) ====		==== third intermediate projection (if any) ====
	;XB(XB(%head;%xb1);%xb2))XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)		;XB(XB(%head;%xb1);%xb2))XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)

imported>Martins at 20:31, 17 April 2012

2012-04-17T20:31:19Z

← Older revision		Revision as of 20:31, 17 April 2012
Line 27:		Line 27:

	==== first intermediate projection (lower XB) ====		==== first intermediate projection (lower XB) ====
	;XC(%head;%comp):=XB(%head;%comp);		;XC(%head;%comp)<nowiki>:=</nowiki>XB(%head;%comp);
	:projects the first intermediate projection (XB) in case of comp		:projects the first intermediate projection (XB) in case of comp
	;XA(%head;%comp):=XB(%head;%adjt);		;XA(%head;%comp)<nowiki>:=</nowiki>XB(%head;%adjt);
	:projects the first intermediate projection (XB) in case of adjt (i.e., when there is no comp)		:projects the first intermediate projection (XB) in case of adjt (i.e., when there is no comp)
	;XH(%head):=XB(%head;);		;XH(%head)<nowiki>:=</nowiki>XB(%head;);
	:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)		:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)
	==== second intermediate projection (if any) ====		==== second intermediate projection (if any) ====
	;XB(%head;%xb1)XA(%head;%adjt):=XB(XB(%head;%xb1);%adjt));		;XB(%head;%xb1)XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(%head;%xb1);%adjt));
	:projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)		:projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)
	;XB(%head;%comp1)XC(%head;%comp2):=XB(XB(%head;%comp1);%comp2));		;XB(%head;%comp1)XC(%head;%comp2)<nowiki>:=</nowiki>XB(XB(%head;%comp1);%comp2));
	:projects the second intermediate projection (XB) in case of comp (the tree has two comps)		:projects the second intermediate projection (XB) in case of comp (the tree has two comps)
	==== third intermediate projection (if any) ====		==== third intermediate projection (if any) ====
	;XB(XB(%head;%xb1);%xb2))XA(%head;%adjt):=XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)		;XB(XB(%head;%xb1);%xb2))XA(%head;%adjt)<nowiki>:=</nowiki>XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)
	==== fourth intermediate projection (if any) ====		==== fourth intermediate projection (if any) ====
	...		...
	==== maximal projection ====		==== maximal projection ====
	;XB(%head;):=XP(XB(%head;););		;XB(%head;)<nowiki>:=</nowiki>XP(XB(%head;););
	:minimal tree: the tree has only the head (no comp, adjt or spec)		:minimal tree: the tree has only the head (no comp, adjt or spec)
	;B(%head;%xb):=XP(XB(%head;%xb););		;B(%head;%xb)<nowiki>:=</nowiki>XP(XB(%head;%xb););
	:the tree has only one intermediate projection and no spec		:the tree has only one intermediate projection and no spec
	;XB(%head;%xb)XS(%head;%spec):=XP(XB(%head;%xb);%spec);		;XB(%head;%xb)XS(%head;%spec)<nowiki>:=</nowiki>XP(XB(%head;%xb);%spec);
	:the tree has only one intermediate projection and the spec		:the tree has only one intermediate projection and the spec
	;XB(%head;%xb):=XP(XB(%head;%xb););		;XB(%head;%xb)<nowiki>:=</nowiki>XP(XB(%head;%xb););
	:the tree has only one intermediate projection and no spec		:the tree has only one intermediate projection and no spec
	;XB(XB(%head;%xb1);%xb2)XS(%head;%spec):=XP(XB(XB(%head;%xb1);%xb2);%spec);		;XB(XB(%head;%xb1);%xb2)XS(%head;%spec)<nowiki>:=</nowiki>XP(XB(XB(%head;%xb1);%xb2);%spec);
	:the tree has two intermediate projections and the spec		:the tree has two intermediate projections and the spec
	;XB(XB(%head;%xb1);%xb2):=XP(XB(XB(%head;%xb1);%xb2););		;XB(XB(%head;%xb1);%xb2)<nowiki>:=</nowiki>XP(XB(XB(%head;%xb1);%xb2););
	:the tree has two intermediate projections and no spec		:the tree has two intermediate projections and no spec
	etc.		etc.

imported>Martins at 20:30, 17 April 2012

2012-04-17T20:30:05Z

imported>Martins at 20:26, 17 April 2012

2012-04-17T20:26:57Z

← Older revision		Revision as of 20:26, 17 April 2012
Line 1:		Line 1:
	'''Projection''' is the mechanism by which, in a given syntactic tree, one or two constituents are integrated into a more complex structure. It is the bottom-up movement of merging or collapsing one or two subordinate nodes into a higher node. In the UNL<sup>arium</sup> framework, projection is used to build the sentence structure out of the individual constituents (head, specifier, adjunct and complement) during natural language generation.		'''Projection''' is the mechanism by which, in a given syntactic tree, one or two constituents are integrated into a more complex structure. It is the bottom-up movement of merging or collapsing one or two subordinate nodes into a higher node in order to form a [[syntactic structure]]. In the UNL<sup>arium</sup> framework, projection is used to build the sentence structure out of the individual constituents (head, specifier, adjunct and complement) during natural language generation.

			== Use ==

			Projections are used to build trees out of the head-driven relations, i.e., to go from:

			'''XS(head;specifier);''', which describes the relation between the head of the structure and its specifier
			'''XA(head;adjunct);''', which describes the relation between the head of the structure and its adjuncts
			'''XC(head;complement);''', which describes the relation between the head of the structure and its complements
			'''XH(head);''', which describes the head of the structure

			to:

			<pre>
			XP
			/ \
			spec XB
			/ \
			XB adjt
			/ \
			X comp
			\|
			head
			</pre>

			This is done by a set of rules as follows:

			;first intermediate projection (lower XB)
			XC(%head;%comp):=XB(%head;%comp);
			*projects the first intermediate projection (XB) in case of comp
			XA(%head;%comp):=XB(%head;%adjt);
			*projects the first intermediate projection (XB) in case of adjt (i.e., when there is no comp)
			XH(%head):=XB(%head;);
			*projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)
			;second intermediate projection (if any)
			XB(%head;%xb1)XA(%head;%adjt):=XB(XB(%head;%xb1);%adjt));
			*projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)
			XB(%head;%comp1)XC(%head;%comp2):=XB(XB(%head;%comp1);%comp2));
			*projects the second intermediate projection (XB) in case of comp (the tree has two comps)
			;third intermediate projection (if any)
			XB(XB(%head;%xb1);%xb2))XA(%head;%adjt):=XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)
			;fourth intermediate projection (if any)
			...
			;maximal projection
			XB(%head;):=XP(XB(%head;););
			*minimal tree: the tree has only the head (no comp, adjt or spec)
			XB(%head;%xb):=XP(XB(%head;%xb););
			*the tree has only one intermediate projection and no spec
			XB(%head;%xb)XS(%head;%spec):=XP(XB(%head;%xb);%spec);
			*the tree has only one intermediate projection and the spec
			XB(%head;%xb):=XP(XB(%head;%xb););
			*the tree has only one intermediate projection and no spec
			XB(XB(%head;%xb1);%xb2)XS(%head;%spec):=XP(XB(XB(%head;%xb1);%xb2);%spec);
			*the tree has two intermediate projections and the spec
			XB(XB(%head;%xb1);%xb2):=XP(XB(XB(%head;%xb1);%xb2););
			*the tree has two intermediate projections and no spec
			etc.

			XB(XB(%head;%comp);%adjt))XA(%head;%adjt):=
			*projects the third intermediate projection

	== Syntax ==		== Syntax ==

imported>Martins at 13:32, 28 March 2010

2010-03-28T13:32:44Z

← Older revision		Revision as of 13:32, 28 March 2010
Line 12:		Line 12:
	== Examples ==		== Examples ==
	*VH(%head):=VB(%head);		*VH(%head):=VB(%head);
	**The head of the verbal phrase becomes the head of the verbal ~~intermediary~~ projection (VB)		**The head of the verbal phrase becomes the head of the verbal intermediate projection (VB)
	*VC(%head;%comp):=VB(%head;%comp);		*VC(%head;%comp):=VB(%head;%comp);
	**The head of the verbal phrase becomes the head of the verbal ~~intermediary~~ projection and the complement of the verbal phrase becomes the second argument of the ~~verbl intermediary~~ projection		**The head of the verbal phrase becomes the head of the verbal intermediate projection and the complement of the verbal phrase becomes the second argument of the verbal intermediate projection
	*VB(%head;%comp)VA(%head;%adjt):=VB(VB(%head;%comp);%adjt);		*VB(%head;%comp)VA(%head;%adjt):=VB(VB(%head;%comp);%adjt);
	**The verbal ~~intermediary~~ projection becomes the head of a higher ~~intermediary~~ projection that takes the adjunct to the verb as second argument		**The verbal intermediate projection becomes the head of a higher intermediate projection that takes the adjunct to the verb as second argument

	== Observations ==		== Observations ==

imported>Martins at 10:14, 26 March 2010

2010-03-26T10:14:49Z

← Older revision		Revision as of 10:14, 26 March 2010
Line 22:		Line 22:
	:As in [[S-rule]]s, nodes in projection rules are always indexed, either by user-defined labels (such as %head, %comp or any other) or by the position in the left side of the rules.		:As in [[S-rule]]s, nodes in projection rules are always indexed, either by user-defined labels (such as %head, %comp or any other) or by the position in the left side of the rules.
	;Sentence structure		;Sentence structure
	:The main goal of projection rules is to build the sentence structure described in [[Syntax]]~~, i.e., to integrate all nodes into a single tree structure~~.		:The main goal of projection rules is to build the sentence structure described in [[Syntax]].

← Older revision		Revision as of 20:30, 17 April 2012
Line 26:		Line 26:
	This is done by a set of rules as follows:		This is done by a set of rules as follows:

	;first intermediate projection (lower XB)		==== first intermediate projection (lower XB) ====
	XC(%head;%comp):=XB(%head;%comp);		;XC(%head;%comp):=XB(%head;%comp);
	*projects the first intermediate projection (XB) in case of comp		:projects the first intermediate projection (XB) in case of comp
	XA(%head;%comp):=XB(%head;%adjt);		;XA(%head;%comp):=XB(%head;%adjt);
	*projects the first intermediate projection (XB) in case of adjt (i.e., when there is no comp)		:projects the first intermediate projection (XB) in case of adjt (i.e., when there is no comp)
	XH(%head):=XB(%head;);		;XH(%head):=XB(%head;);
	*projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)		:projects the first intermediate projection (XB) when there is no comp or adjt (the second argument is empty)
	;second intermediate projection (if any)		==== second intermediate projection (if any) ====
	XB(%head;%xb1)XA(%head;%adjt):=XB(XB(%head;%xb1);%adjt));		;XB(%head;%xb1)XA(%head;%adjt):=XB(XB(%head;%xb1);%adjt));
	*projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)		:projects the second intermediate projection (XB) in case of adjt (the tree has a comp or a adjt, or two adjts)
	XB(%head;%comp1)XC(%head;%comp2):=XB(XB(%head;%comp1);%comp2));		;XB(%head;%comp1)XC(%head;%comp2):=XB(XB(%head;%comp1);%comp2));
	*projects the second intermediate projection (XB) in case of comp (the tree has two comps)		:projects the second intermediate projection (XB) in case of comp (the tree has two comps)
	;third intermediate projection (if any)		==== third intermediate projection (if any) ====
	XB(XB(%head;%xb1);%xb2))XA(%head;%adjt):=XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)		;XB(XB(%head;%xb1);%xb2))XA(%head;%adjt):=XB(XB(XB(%head;%xb1);xb2);%adjt)); (the tree has one comp and two adjts, two comps and one adjt or three adjts)
	;fourth intermediate projection (if any)		==== fourth intermediate projection (if any) ====
	...		...
	;maximal projection		==== maximal projection ====
	XB(%head;):=XP(XB(%head;););		;XB(%head;):=XP(XB(%head;););
	*minimal tree: the tree has only the head (no comp, adjt or spec)		:minimal tree: the tree has only the head (no comp, adjt or spec)
	XB(%head;%xb):=XP(XB(%head;%xb););		;B(%head;%xb):=XP(XB(%head;%xb););
	*the tree has only one intermediate projection and no spec		:the tree has only one intermediate projection and no spec
	XB(%head;%xb)XS(%head;%spec):=XP(XB(%head;%xb);%spec);		;XB(%head;%xb)XS(%head;%spec):=XP(XB(%head;%xb);%spec);
	*the tree has only one intermediate projection and the spec		:the tree has only one intermediate projection and the spec
	XB(%head;%xb):=XP(XB(%head;%xb););		;XB(%head;%xb):=XP(XB(%head;%xb););
	*the tree has only one intermediate projection and no spec		:the tree has only one intermediate projection and no spec
	XB(XB(%head;%xb1);%xb2)XS(%head;%spec):=XP(XB(XB(%head;%xb1);%xb2);%spec);		;XB(XB(%head;%xb1);%xb2)XS(%head;%spec):=XP(XB(XB(%head;%xb1);%xb2);%spec);
	*the tree has two intermediate projections and the spec		:the tree has two intermediate projections and the spec
	XB(XB(%head;%xb1);%xb2):=XP(XB(XB(%head;%xb1);%xb2););		;XB(XB(%head;%xb1);%xb2):=XP(XB(XB(%head;%xb1);%xb2););
	*the tree has two intermediate projections and no spec		:the tree has two intermediate projections and no spec
	etc.		etc.

	~~XB(XB(%head;%comp);%adjt))XA(%head;%adjt):=~~
	*projects the third intermediate projection

	== Syntax ==		== Syntax ==