Exercise1

To create the transformation grammar necessary to go from (1) to (2) with IAN, and from (2) to (1) with EUGENE.

Instructions

UNLization (IAN)

1. Go to IAN (UNLWEB>UNLDEV>IAN)
2. Create a new document with the sentence (1) below, including the period.
3. Create a new dictionary with the entries below.
4. Provide the t-grammar necessary to go from (1) to (2)
5. Export the trace (at the level detailed) and include it at the end of your CV

NLization (EUGENE)

1. Go to EUGENE (UNLWEB>UNLDEV>EUGENE)
2. Create a new document with the sentence (2) below.
3. 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.
5. 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/unlversity.

Corpus

(1) NL

Any sufficiently advanced technology is indistinguishable from magic.

(2) UNL

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

Dictionary

The tagset is available at Tagset.

 [ ]{}""(PUT=BLK)<eng,0,0>;
 [.]{}""(PUT=PERIOD)<eng,0,0>;
 [advanced]{}"advanced"(LEX=J,POS=ADJ)<eng,0,0>;
 [any]{}""(LEX=D,POS=QUA,att=@any)<eng,0,0>;
 [from]{}""(LEX=P,POS=PRE)<eng,0,0>;
 [indistinguishable]{}"indistinguishable"(LEX=J,POS=ADJ)<eng,0,0>;
 [is]{}""(LEX=V,POS=COP)<eng,0,0>;
 [magic]{}"magic"(LEX=N,POS=NOU)<eng,0,0>;
 [sufficiently]{}"sufficiently"(LEX=A,POS=AAV)<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).
The T-grammar follows the specifications available at Transformation grammar.

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