T-rule - Revision history

imported>Martins at 09:15, 28 May 2014

2014-05-28T09:15:42Z

← Older revision		Revision as of 09:15, 28 May 2014
Line 1:		Line 1:
	T-rules, or transformation rules, are rules that alter the state of ~~the~~ nodes. They are used for normalization, for syntactic analysis and for semantic interpretation. The set of the t-rules forms the '''Transformation grammar''', or '''T-Grammar'''.		T-rules, or transformation rules, are rules that alter the state of nodes. They are used for normalization, for syntactic analysis and for semantic interpretation. The set of the t-rules forms the '''Transformation grammar''', or '''T-Grammar'''.

	== Basic Symbols ==		== Basic Symbols ==

imported>Dgaiv at 17:19, 11 February 2014

2014-02-11T17:19:34Z

← Older revision		Revision as of 17:19, 11 February 2014
Line 231:		Line 231:
	\|-		\|-
	\|REPLACE		\|REPLACE
	\|SEM(%x;%y):=~~SYM~~(%x;%y);		\|SEM(%x;%y):=SYN(%x;%y);
	\|The semantic relation SEM between the nodes %x and %y is replaced by the syntactic relation SYN between the same nodes.		\|The semantic relation SEM between the nodes %x and %y is replaced by the syntactic relation SYN between the same nodes.
	\|}		\|}

imported>Martins at 15:11, 27 August 2013

2013-08-27T15:11:03Z

← Older revision		Revision as of 15:11, 27 August 2013
Line 309:		Line 309:

	;INDEXATION		;INDEXATION
	:All instances of the same node must be co-indexed (or they will be considered different nodes). See [[~~Index~~]].		:All instances of the same node must be co-indexed (or they will be considered different nodes). See [[Indexation]].
			::(%a)(%b):=(%a); (delete the node %b)
			::(%a)(%b):=(%b); (delete the node %a)
			::rel(%a;%b):=rel(%a;%c); (replace the node %b by the node %c; the node %a does not undergo any change)
			::SYN(%x,^NUM;%y,NUM):=SYN(%x,NUM=%y;%y); (copy the value of the attribute NUM from the node %y to the node %x)

	;ACTION		;ACTION
Line 327:		Line 331:

	;REGULAR EXPRESSIONS		;REGULAR EXPRESSIONS
	:The left side of the rules may bring [[~~http://www.pcre.org/ Perl Compatible Regular Expressions~~]] between "/"~~, as indicated below~~:		:The left side of the rules may bring [[regular expressions]] between "/":
	::/(agt\|obj\|aoj)/(A,%a;B,%b):=VS(%a;%b);		::/(agt\|obj\|aoj)/(A,%a;B,%b):=VS(%a;%b);
	:::The rule above applies in case of agt(A;B), obj(A;B) and aoj(A;B)		:::The rule above applies in case of agt(A;B), obj(A;B) and aoj(A;B)
Line 362:		Line 366:
	:But:		:But:
	:::SEM( VER,TRA ; NOU,MCL) IS DIFFERENT FROM SEM( NOU,MCL ; VER,TRA )		:::SEM( VER,TRA ; NOU,MCL) IS DIFFERENT FROM SEM( NOU,MCL ; VER,TRA )

	~~;DICTIONARY ATTRIBUTES~~
	~~:Dictionary attributes can be used as variables (see [[#Indexes\|indexes]]).~~
	~~:::SYN(%x,^NUM;%y,NUM):=SYN(NUM=%y;%x);~~

	;DICTIONARY RULES (see also [[Dictionary Specs#Inflection_rules_inside_dictionary_entries.2A \| Inflection rules inside dictionary entries]])		;DICTIONARY RULES (see also [[Dictionary Specs#Inflection_rules_inside_dictionary_entries.2A \| Inflection rules inside dictionary entries]])
Line 377:		Line 377:
	:::foot>feet		:::foot>feet
	:::city>cities		:::city>cities

	~~;NLW SPLITTING~~
	~~:Sub-NLWs in complex entries are referred by # (see [[#Indexes\|indexes]]).~~
	~~::Dictionary~~
	~~:::[[bring] [back]] "bring back" (VER,MTW,VA(01>02), #01(HEAD,VER), #02(ADJT,PP)) <eng,0,0>;~~
	~~::Grammar~~
	~~:::VC(VER,MTW,VA(01>02),%head;NOU,%obj):=VB(VC(%head#01;%obj);%head#02);~~

	== Formal Syntax of Transformation Rules ==		== Formal Syntax of Transformation Rules ==

imported>Martins at 14:03, 21 August 2013

2013-08-21T14:03:15Z

← Older revision		Revision as of 14:03, 21 August 2013
Line 5:		Line 5:

	== Basic Concepts ==		== Basic Concepts ==
	{{:~~Basic Concepts~~}}		{{:Grammar units}}

	== Syntax ==		== Syntax ==

imported>Martins at 14:02, 21 August 2013

2013-08-21T14:02:32Z

← Older revision		Revision as of 14:02, 21 August 2013
Line 5:		Line 5:

	== Basic Concepts ==		== Basic Concepts ==
	{{:~~Basic_Concepts~~}}		{{:Basic Concepts}}

	== Syntax ==		== Syntax ==

imported>Martins at 14:02, 21 August 2013

2013-08-21T14:02:14Z

← Older revision		Revision as of 14:02, 21 August 2013
Line 5:		Line 5:

	== Basic Concepts ==		== Basic Concepts ==
	{{:~~Basic_concepts~~}}		{{:Basic_Concepts}}

	== Syntax ==		== Syntax ==

imported>Martins at 14:02, 21 August 2013

2013-08-21T14:02:02Z

← Older revision		Revision as of 14:02, 21 August 2013
Line 2:		Line 2:

	== Basic Symbols ==		== Basic Symbols ==
	{{:~~Basic_symbols~~}}		{{:Basic_Symbols}}

	== Basic Concepts ==		== Basic Concepts ==

imported>Martins at 14:01, 21 August 2013

2013-08-21T14:01:49Z

← Older revision		Revision as of 14:01, 21 August 2013
Line 1:		Line 1:
	T-rules, or transformation rules, are rules that alter the state of the nodes. They are used for normalization, for syntactic analysis and for semantic interpretation. The set of the t-rules forms the '''Transformation grammar''', or '''T-Grammar'''.		T-rules, or transformation rules, are rules that alter the state of the nodes. They are used for normalization, for syntactic analysis and for semantic interpretation. The set of the t-rules forms the '''Transformation grammar''', or '''T-Grammar'''.

			== Basic Symbols ==
			{{:Basic_symbols}}

			== Basic Concepts ==
			{{:Basic_concepts}}

	== Syntax ==		== Syntax ==

imported>Martins at 14:00, 21 August 2013

2013-08-21T14:00:19Z

@@ Line 229: / Line 229: @@
 |}
 <div align="center">Where SYN is a syntactic relation, SEM is a semantic relation, and %x, %y, %w and %z are nodes.</div>
 == Special types of transformation rules ==

imported>Martins at 14:00, 21 August 2013

2013-08-21T14:00:09Z

← Older revision		Revision as of 14:00, 21 August 2013
Line 229:		Line 229:
	\|}		\|}
	<div align="center">Where SYN is a syntactic relation, SEM is a semantic relation, and %x, %y, %w and %z are nodes.</div>		<div align="center">Where SYN is a syntactic relation, SEM is a semantic relation, and %x, %y, %w and %z are nodes.</div>

	~~== Transformations over hyper-nodes ==~~
	~~{{:Transformation_over_hyper-nodes}}~~

	== Transformations over relations and hyper-relations ==		== Transformations over relations and hyper-relations ==