Graph Theory - Computational Linguistics and Talking Robots - page 170

Let us compare K 4 with the following DBS graphs; they have the same num-
ber of nodes - and therefore the same number of digits in their respective
degree sequences, but corresponding digits show different degrees:

9.1.2 S AME NUMBER OF NODES BUT DIFFERENT DEGREES

The little girl ate an apple. The man gave the child an apple

(i) semantic relations graph (SRG) (i) semantic relations graph (SRG)

eat give

girl apple man child apple

little

(ii) signature (ii) signature

V V

2211 3111

N N

NNN

A

The DBS graphs on the left have a two-place verb with its two arguments
and the subject modified by an adnominal adjective, while the DBS graphs
on the right have a three-place verb and its three arguments. Accordingly, the
respective degree sequences are 2211 and 3111.
While the SRG and the signature in the DBS analysis of a content are
undirected graphs, the associated numbered arcs graph (NAG) is a directed
graph. Consider the following example in the active voice (see 9.1.7 for the
corresponding passive):

9.1.3 DBS GRAPH ANALYSIS OF A CONTENT : The dog found a bone.

(i) semantic relations graph (SRG) (iii) numbered arcs graph (NAG)

find 0

find

1

4

2 3

dog bone

dog bone

(ii) signature

(iv) surface realization

V

1 2

found

3 4

.

The_dog a_bone