(
∃
y,p1,p2,k) L(Mary,Mary,p1,p2,A12,Gt,k)
Π
L(Mary,y,p1,p2,A12,Gt,k)
∧
Mary
≠
y
∧
p1
≠
p2
∧
book(y) (15)
For another example, the meaning description of the English preposition ‘through’
is also approximately given by (16).
[(
∃
x,y,p1,z,p3,g,k,p4,k0) (L(x,y,p1,z,A12,g,k)
•
L(x,y,z,p3,A12,g,k))
Π
L(x,y,p4,p4,A13,g,k0)
∧
p1
≠
z
∧
z
≠
p3: ARG(Dep.1,z);
IF(Gov=Verb)
→
PAT(Gov,(1,1)); IF(Gov=Noun)
→
ARG(Gov,y);] (16)
The U
p
above is for unifying the C
p
s of the very word, its governor (Gov, a verb or
a noun) and its dependent (Dep.1, a noun). The second argument (1,1) of the com-
mand PAT indicates the underlined part of (16) and in general (i,j) refers to the partial
formula covering from the ith to the jth atomic formula of the current C
p
. This part is
the pattern common to both the C
p
s to be unified. This is called ‘Unification Handle
(U
h
)’ and when missing, the C
p
s are to be combined simply with ‘∧’.
Therefore the sentences S7, S8 and S9 are interpreted as (17), (18) and (19), re-
spectively. The underlined parts of these formulas are the results of PAT operations.
The expression (20) is the C
p
of the adjective ‘long’ implying ‘there is some value
greater than some standard of length (A02)’ which is often simplified as (20’).
(S7) The train runs through the tunnel.
(
∃
x,y,p1,z,p3,k,p4,k0) (L(x,y,p1,z,A12,Gt,k)
•
L(x,y,z,p3,A12,Gt,k))
Π
L(x,y,p4,p4,A13,Gt,k0)
∧
p1
≠
z
∧
z
≠
p3
∧
train(y)
∧
tunnel(z) (17)
(S8) The path runs through the forest.
(
∃
x,y,p1,z,p3,k,p4,k0) (L(x,y,p1,z,A12,Gs,k)
•
L(x,y,z,p3,A12,Gs,k))
Π
L(x,y,p4,p4,A13,Gs,k0)
∧
p1
≠
z
∧
z
≠
p3
∧
path(y)
∧
forest(z) (18)
(S9) The path through the forest is long.
(
∃
x,y,p1,z,p3,x1,k,q,k1,p4,k0) (L(x,y,p1,z,A12,Gs,k)
•
L(x,y,z,p3,A12,Gs,k))
Π
L(x,y,p4,p4,A13,Gs,k0)
∧
L(x1,y,q,q,A02,Gt,k1)
∧
p1
≠
z
∧
z
≠
p3
∧
q>k1
∧
path(y)
∧
forest(z) (19)
(
∃
x1,y1,q,k1)L(x1,y1,q,q,A02,Gt,k1)
∧
q>k1 (20)
(
∃
x1,y1,k1)L(x1,y1,Long,Long,A02,Gt,k1) (20’)
4 Text Understanding and Cross-Media Reference
Every version of the intelligent system IMAGES can perform text understanding
based on word meaning descriptions as follows.
Firstly, a text is parsed into a surface dependency structure (or more than one if
syntactically ambiguous). Secondly, each surface dependency structure is translated
into a conceptual structure (or more than one if semantically ambiguous) using word
meaning descriptions. Finally, each conceptual structure is semantically evaluated.
The fundamental semantic computations on a text are to detect semantic anomalies,
ambiguities and paraphrase relations.
Semantic anomaly detection is very important to cut off meaningless computations.
Consider such a conceptual structure as (21), where ‘A29’ is the attribute ‘Taste’.
This locus formula can correspond to the English sentence ‘The desk is sweet’, which
is usually semantically anomalous because a ‘desk’ ordinarily has no taste.
28