Database Reference
In-Depth Information
8.1.3 U
NAMBIGUOUS AND AMBIGUOUS INPUT TO SIGNATURES
Unambiguous match for {A, N}
3.
A
|
N(e.g.,
little
|
dog
)
Unambiguous match for {N, N}
5.
N
−
N(e.g.,
man
−
woman
)
Unambiguous match for {A, A}
7.
A
−
A(e.g.,
little
−
black
)
Ambiguous match for {A, V}
4.
A
|
V(e.g.,
beautifully
|
sing
)
11. A
\
V(e.g.,
in_vase
\
put
)
Ambiguous match for {N, V}
1.
N
/
V(e.g.,
John
/
gave
)
2.
N
\
V(e.g.,
Mary
\
gave
)
10. V
|
N
(e.g.,
burning
|
fire, to_help
|
desire
)
14. V
|
x
N(e.g.,
who_loves
|
Mary
)
Ambiguous match for {V, V}
6.
V
−
V
(e.g.,
walk
−
talk
)
8.
V
/
V
(e.g.,
to_err
/
is
)
9.
V
\
V
(e.g.,
to_read
\
try
)
12. V
/
x
V
(e.g.,
that_bark
/
surprise
)
13. V
\
x
V
(e.g.,
that_bark
\
hear
)
15. V
|
x
V
(e.g.,
when_bark
|
smile
)
16. V
−
x
V(e.g.,
sleep
−
read
)
The transparent adnominals and the nominal and adjectival coordinations are
unique, while the other constellations show a growing number of ambiguities.
These are the transparent adnominals and the nominal and adjectival coordi-
nations, the transparent and the opaque adverbial, etc.
2
The 16 elementary signatures allow us to connect any N, V, or A node to
any other N, V, or A node. In the case of an unambiguous input pair, there is
no need to choose between different elementary signatures for relating the two
nodes. For an ambiguous input pair, in contrast, the choice between the pos-
sible elementary signatures must be based on additional information, mostly
co-occurrence restrictions induced by the concepts involved (Sect. 8.5).
2
This suggests that reuse is preferred over specialization. The more common, frequent, and obligatory
the transparent semantic relation, the more the competing opaque relations riding piggy-back.
Search WWH ::
Custom Search