Compositional Semantics - Computational Linguistics and Talking Robots - page 127

The only pair matching schema (1) is { girl, eat }, the only pair matching
schema (2) is { apple, eat }, and the only pair matching schema (3) is { little,
girl }.
Arranging and connecting the proplets in accordance with the successful
matches between 7.3.2 and 7.3.3 results in the following graph:

7.3.4 DBS GRAPH BASED ON PROPLETS ( PROPLET GRAPH )

verb: eat

cat: decl

sem: past

arg: girl apple

prn: 7

noun: girl noun: apple

sem: def sg cat: snp

fnc: eat sem: indef sg

mdr: little fnc: eat

prn: 7 prn: 7

adj: little

cat: adn

sem: pos
mdd: girl
prn: 7

In a second step, this proplet graph may be turned automatically into an SRG
or a signature. The SRG is obtained by replacing each proplet with its core
value , while the signature is obtained by replacing each proplet with a letter
representing the part of speech of its core attribute :

7.3.5 R ESULTING SRG AND SIGNATURE

(i) semantic relations graph (SRG) (ii) signature

V eat

N N

girl apple

A

little

11 As pointed out by Haitao Liu, an SRG resembles the stemma réelle while a signature resembles the
stemma virtuelle of Tesnière (1959). See also Ágel et al. (eds.) (2006), p. 1316.
12 Structure A is homomorph to a structure B iff (i) each elementary node in A has a counterpart in B
and (ii) each relation in A has a corresponding relation in B. Cf. FoCL'99, Sect. 21.3.