Exercise1 - Revision history

imported>Martins at 09:15, 28 May 2014

2014-05-28T09:15:07Z

← Older revision		Revision as of 09:15, 28 May 2014
Line 50:		Line 50:
	== T-Grammar ==		== T-Grammar ==
	A T-grammar, or transformation grammar, is a set of rules that manipulate nodes in order to generate a graph (UNL) out of a list (NL), or a list (NL) out of a graph (UNL).<br />		A T-grammar, or transformation grammar, is a set of rules that manipulate nodes in order to generate a graph (UNL) out of a list (NL), or a list (NL) out of a graph (UNL).<br />
	The T-grammar follows the specifications available at [[Transformation ~~Grammar~~]].<br />		The T-grammar follows the specifications available at [[Transformation grammar]].<br />

	=== Examples of T-Rules ===		=== Examples of T-Rules ===

imported>Martins at 09:14, 28 May 2014

2014-05-28T09:14:54Z

← Older revision		Revision as of 09:14, 28 May 2014
Line 60:		Line 60:
	(J,%x)(N,%y):=(%x)(" ")(%y); (inserts a blank space between J and N, i.e., [beautiful][boy] becomes [become][ ][boy])		(J,%x)(N,%y):=(%x)(" ")(%y); (inserts a blank space between J and N, i.e., [beautiful][boy] becomes [become][ ][boy])
	aoj(J,%x;N,%y):=(%x)(%y); (linearizes the aoj relation between J and N into N J, i.e., aoj([beautiful];[boy]) becomes [beautiful][boy])		aoj(J,%x;N,%y):=(%x)(%y); (linearizes the aoj relation between J and N into N J, i.e., aoj([beautiful];[boy]) becomes [beautiful][boy])
	For further examples of T-rules, check [[English ~~Grammar~~]]		For further examples of T-rules, check [[English grammar]]

imported>Martins at 09:14, 28 May 2014

2014-05-28T09:14:00Z

← Older revision		Revision as of 09:14, 28 May 2014
Line 35:		Line 35:

	== Dictionary ==		== Dictionary ==
			The tagset is available at [[Tagset]].

	[ ]{}""(PUT=BLK)<eng,0,0>;		[ ]{}""(PUT=BLK)<eng,0,0>;
	[.]{}""(PUT=PERIOD)<eng,0,0>;		[.]{}""(PUT=PERIOD)<eng,0,0>;
	[advanced]{}"advanced"(LEX=J,POS=ADJ)<eng,0,0>;		[advanced]{}"advanced"(LEX=J,POS=ADJ)<eng,0,0>;
	[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;		[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;
	[from]{}""(LEX=P,POS=PRE)<eng,0,0>;		[from]{}""(LEX=P,POS=PRE)<eng,0,0>;
	[indistinguishable]{}"indistinguishable"(LEX=J,POS=ADJ)<eng,0,0>;		[indistinguishable]{}"indistinguishable"(LEX=J,POS=ADJ)<eng,0,0>;
	[is]{}""(LEX=V,POS=COP)<eng,0,0>;		[is]{}""(LEX=V,POS=COP)<eng,0,0>;
	[magic]{}"magic"(LEX=N,POS=NOU)<eng,0,0>;		[magic]{}"magic"(LEX=N,POS=NOU)<eng,0,0>;
	[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;		[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;
	[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;		[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;

			== T-Grammar ==
			A T-grammar, or transformation grammar, is a set of rules that manipulate nodes in order to generate a graph (UNL) out of a list (NL), or a list (NL) out of a graph (UNL).<br />
			The T-grammar follows the specifications available at [[Transformation Grammar]].<br />

			=== Examples of T-Rules ===
			;UNLization (NL>UNL)
			(BLK):=; (deletes blank spaces, i.e, [beautiful][ ][boy] becomes [beautiful][boy])
			(J,%x)(N,%y):=(%y)(%x); (reverses the order J N to N J, i.e., [beautiful][boy] becomes [boy][beautiful])
			(J,%x)(N,%y):=aoj(%x;%y); (creates a relation "aoj" from J to N, i.e., [beautiful][boy] becomes aoj([beautiful];[boy]))
			;NLization (UNL>NL)
			(J,%x)(N,%y):=(%x)(" ")(%y); (inserts a blank space between J and N, i.e., [beautiful][boy] becomes [become][ ][boy])
			aoj(J,%x;N,%y):=(%x)(%y); (linearizes the aoj relation between J and N into N J, i.e., aoj([beautiful];[boy]) becomes [beautiful][boy])
			For further examples of T-rules, check [[English Grammar]]

imported>Martinluts at 09:16, 20 May 2014

2014-05-20T09:16:15Z

← Older revision		Revision as of 09:16, 20 May 2014
Line 41:		Line 41:
	[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;		[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;
	[from]{}""(LEX=P,POS=PRE)<eng,0,0>;		[from]{}""(LEX=P,POS=PRE)<eng,0,0>;
	[indistinguishable){}"indistinguishable"(LEX=J,POS=ADJ)<eng,0,0>;		[indistinguishable]{}"indistinguishable"(LEX=J,POS=ADJ)<eng,0,0>;
	[is]{}""(LEX=V,POS=COP)<eng,0,0>;		[is]{}""(LEX=V,POS=COP)<eng,0,0>;
	[magic]{}"magic"(LEX=N,POS=NOU)<eng,0,0>;		[magic]{}"magic"(LEX=N,POS=NOU)<eng,0,0>;
	[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;		[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;
	[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;		[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;

imported>Martins at 19:20, 19 May 2014

2014-05-19T19:20:54Z

← Older revision		Revision as of 19:20, 19 May 2014
Line 14:		Line 14:
	#Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.		#Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.
	#Export the trace (at the level detailed) and include it at the end of your CV		#Export the trace (at the level detailed) and include it at the end of your CV
			=== Application ===
			Upload your CV, with results of the UNLization and NLization, to the form available at www.unlweb.net.br/unlversity.

	== Corpus ==		== Corpus ==

imported>Martins at 19:19, 19 May 2014

2014-05-19T19:19:41Z

← Older revision		Revision as of 19:19, 19 May 2014
Line 7:		Line 7:
	#Create a new dictionary with the entries below.		#Create a new dictionary with the entries below.
	#Provide the t-grammar necessary to go from (1) to (2)		#Provide the t-grammar necessary to go from (1) to (2)
	#Export the trace (at the level detailed)		#Export the trace (at the level detailed) and include it at the end of your CV
	=== NLization (EUGENE) ===		=== NLization (EUGENE) ===
	#Go to EUGENE (UNLWEB>UNLDEV>EUGENE)		#Go to EUGENE (UNLWEB>UNLDEV>EUGENE)
Line 13:		Line 13:
	#Create a new dictionary with the entries below.		#Create a new dictionary with the entries below.
	#Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.		#Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.
	#Export the trace (at the level detailed)		#Export the trace (at the level detailed) and include it at the end of your CV

	== Corpus ==		== Corpus ==

imported>Martins at 18:03, 19 May 2014

2014-05-19T18:03:55Z

← Older revision		Revision as of 18:03, 19 May 2014
Line 3:		Line 3:
	== Instructions ==		== Instructions ==
	=== UNLization (IAN) ===		=== UNLization (IAN) ===
	1. Go to IAN (UNLWEB>UNLDEV>IAN)		#Go to IAN (UNLWEB>UNLDEV>IAN)
	2. Create a new document with the sentence (1) below, including the period.		#Create a new document with the sentence (1) below, including the period.
	3. Create a new dictionary with the entries below.		#Create a new dictionary with the entries below.
	4. Provide the t-grammar necessary to go from (1) to (2)		#Provide the t-grammar necessary to go from (1) to (2)
	5. Export the trace (at the level detailed)		#Export the trace (at the level detailed)
	=== NLization (EUGENE) ===		=== NLization (EUGENE) ===
	1. Go to EUGENE (UNLWEB>UNLDEV>EUGENE)		#Go to EUGENE (UNLWEB>UNLDEV>EUGENE)
	2. Create a new document with the sentence (2) below.		#Create a new document with the sentence (2) below.
	3. Create a new dictionary with the entries below.		#Create a new dictionary with the entries below.
	4. Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.		#Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.
	5. Export the trace (at the level detailed)		#Export the trace (at the level detailed)

	== Corpus ==		== Corpus ==

imported>Martins at 18:03, 19 May 2014

2014-05-19T18:03:17Z

@@ Line 1: / Line 1: @@
 To create the transformation grammar necessary to go from (1) to (2) with [[IAN]], and from (2) to (1) with [[EUGENE]].
 (1) NL
   Any sufficiently advanced technology is indistinguishable from magic.
@@ Line 29: / Line 44: @@
   [sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;
   [technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;

imported>Martins at 18:01, 19 May 2014

2014-05-19T18:01:54Z

← Older revision		Revision as of 18:01, 19 May 2014
Line 1:		Line 1:
	To create the transformation grammar necessary to go from (1) to (2) with [[IAN]], and from (2) to (1) with [[EUGENE]].		To create the transformation grammar necessary to go from (1) to (2) with [[IAN]], and from (2) to (1) with [[EUGENE]].

	(1)		(1) NL
	Any sufficiently advanced technology is indistinguishable from magic.		Any sufficiently advanced technology is indistinguishable from magic.

	(2)		(2) UNL
	[S]		[S]
	{org}		{org}

imported>Martins at 18:01, 19 May 2014

2014-05-19T18:01:18Z

← Older revision		Revision as of 18:01, 19 May 2014
Line 4:		Line 4:
	Any sufficiently advanced technology is indistinguishable from magic.		Any sufficiently advanced technology is indistinguishable from magic.

	(2)		(2)
			[S]
			{org}
			Any sufficiently advanced technology is indistinguishable from magic.
			{/org}
			{unl}
	aoj(indistinguishable, technology.@any)		aoj(indistinguishable, technology.@any)
	mod(technology.@any, advanced)		mod(technology.@any, advanced)
	man(advanced, sufficiently)		man(advanced, sufficiently)
	src(indistinguishable, magic)		src(indistinguishable, magic)
			{/unl}
			[/S]

	== Dictionary ==		== Dictionary ==

			[ ]{}""(PUT=BLK)<eng,0,0>;
			[.]{}""(PUT=PERIOD)<eng,0,0>;
	[advanced]{}"advanced"(LEX=J,POS=ADJ)<eng,0,0>;		[advanced]{}"advanced"(LEX=J,POS=ADJ)<eng,0,0>;
	[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;		[any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;
Line 20:		Line 29:
	[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;		[sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<eng,0,0>;
	[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;		[technology]{}"technology"(LEX=N,POS=NOU)<eng,0,0>;

			== Instructions ==
			=== UNLization (IAN) ===
			1. Go to IAN (UNLWEB>UNLDEV>IAN)
			2. Create a new document with the sentence (1) above, including the period.
			3. Create a new dictionary with the entries above.
			4. Provide the t-grammar necessary to go from (1) to (2)
			5. Export the trace (at the level detailed)
			=== NLization (EUGENE) ===
			1. Go to EUGENE (UNLWEB>UNLDEV>EUGENE)
			2. Create a new document with the sentence (2) above.
			3. Create a new dictionary with the entries above.
			4. Provide the t-trammar necessary to go from (2) to (1). Don't forget to generate the period at the end of the sentence.
			5. Export the trace (at the level detailed)