Simple transfer rules

As an example consider a transfer grammar to define the transfer relation between Dutch and English. The semantic representations of English and Dutch are labelled by the labels gb and nl respectively. We simplify this example by not taking into account properties such as tense and aspect. A rule that translates `open_fire_on' into `het_vuur_openen_op' is defined as:

$\pr\pred \head{ \mbox{\it sign}(\avm{ \mbox{\it gb} : \avm{ \mbox{\it sort}: \m... ...it gb} : \mbox{\rm G}_{2}\\ \mbox{\it nl} : \mbox{\rm N}_{2} }).} \epred\epr$
This rule simply states that the translation of an argument structure is composed of the translation of its arguments; furthermore the value for the neg attribute is simply defined to be the same for the English and Dutch argument structure representations. Similar rules can be written for other predicates. If the rule applies to the goal

$\query{ \mbox{\it sign}(\avm[\mbox{\rm X}]{ \mbox{\it gb}: \avm{ \mbox{\it sort}... ...box{\it num}:\mbox{\rm sg}}}}\\ \mbox{\it neg}: \mbox{\rm neg} }} ). }\equery$
the two daughters of the rule will be `instantiated', and the value of nl will be bound to the nl values of these daughters; i.e. we obtain the goal:

$\query{\avm[\mbox{\rm X}]{ \mbox{\it gb} : \dots \\ \mbox{\it nl} : \avm{ \mbo... ...nister}\\ \mbox{\it num}:\mbox{\rm sg}}}}\\ nl: \mbox{\rm N}}_{2}).} \equery$
An example of the rule for the first daughter will be a bilingual lexical entry and looks as:

$\pr\pred \head{\mbox{\it sign}(\avm{ \mbox{\it gb}: \avm{ \mbox{\it sort}:\mbox{... ...it pred}:\mbox{\rm militair}\\ \mbox{\it num}:\mbox{\rm Num} }}).} \epred\epr$
The second daughter will be translated by a general rule translating argument structures of sort `modifier' (this rule will be modified later in this section):

$\pr\pred \head{\mbox{\it sign}(\avm{ \mbox{\it gb}: \avm{ \mbox{\it sort}: \mbo... ...{\it gb}: \mbox{\rm G}_{arg}\\ \mbox{\it nl}: \mbox{\rm N}}_{arg}).} \epred\epr$

The complex English expression `prime minister' has to be translated as a simple expression in Dutch: `premier'. This rule can be defined as:

$\pr\pred \head{\mbox{\it sign}(\avm{ \mbox{\it nl} : \avm{\mbox{\it sort}: \mbo... ...pred}: \mbox{\rm minister}\\ \mbox{\it num}:\mbox{\rm Num}} }}). } \epred\epr$
where it is assumed that the construction is analyzed in English as an ordinary modified construction (rather than as a single idiomatic expression), and where the semantic representation of the modifier (`prime') takes the semantic representation of the noun as its argument. Note that a similar rule could be written to deal with the `schimmel - white horse' example. As a result of the rule applications we obtain the following feature structure from which the generator generates the sentence

$\begin{exam} De militairen hebben het vuur niet geopend op de Columbiaanse premier \end{exam}$

$\begin{displaymath} \avm[\mbox{\rm X}]{ \mbox{\it gb} : \dots\\ \mbox{\it nl} :... ...d}: \mbox{\rm premier}}} \\ \mbox{\it neg}: \mbox{\rm neg}}} \end{displaymath}$
The abbreviated `parse tree' for this example can be shown as in figure 5.5.

**Figure 5.5:** Parse tree of transfer example
$\begin{figure} \par\begin{center} \leavevmode \unitlength1pt \beginpicture \set... ...ut{\hbox{\viabb }} [Bl] at 270.29 18.00 \endpicture \end{center}\par\end{figure}$

In the foregoing examples the relation between semantic representations is rather straightforward. Note however that the full power of a unification grammar can be used to settle more difficult translation cases, because different labels can be used to represent the `translational syntax'. For instance we can build a tree as value of the label tree to represent the derivational history of the translation process. Or we can `thread' information through different nodes to be able to make translations dependent on each other. Translation parameters such as style and subject field can be percolated as labels of nodes to obtain consistent translations; but these labels themselves need not be translated. Some examples of more interesting translation rules using some of these possibilities are defined in the next sections.