Motivation
Consider the following problem: you are given two strings, "S1: John
eats" and "S2: John sleeps" and you are asked to build a
correct English sentence that combines the two events into one sentence
expressing that S2 occurred after S1 in the past (something like: "S3:
After eating, John slept").
Working on the strings, such transformations are very difficult to achieve.
One need to know the syntactic structure of the small sentences in order to
be able to combine them appropriately. The input to SURGE is a good
representation level to allow such manipulations. Instead of starting with
the strings S1 and S2, we will start with the Functional Descriptions (FDs)
I1 and I2 describing S1 and S2 respectively.
The second motivation for using a syntactic realization module like SURGE
is to provide an interface between a lexical chooser and the grammar within
a complete generation system. The responsibility of the realization module
is to abstract away from the complexity of the syntax and to present a
simple and compositional interface to the lexical chooser.
Our main goal in this tutorial, is to learn how to write inputs for
sentences in SURGE. Inputs to surge look like the following example:
(def-test give1
"John does not often give it to Mary."
((cat clause)
(adverb ((lex "often")))
(polarity negative)
(process ((type composite)
(relation-type possessive)
(lex "give")))
(participants ((agent ((cat proper) (lex "John")))
(affected ((cat proper) (lex "Mary")))
(possessor {^ affected})
(possessed ((cat pronoun)))))))
The theory of grammar implemented in SURGE provides a definition for terms
like "clause", "process", "participants", "agent", "possessor" etc. The
following notes give a highlight of this theory.