Database Reference
In-Depth Information
Comment: Rule DET-CN applies the lex functions defined in NLC'06, 14.3.2 and 14.3.3, to realize
an
apple
(double realization), using the
sem
values
indef sg
of
apple
for the determiner and the
noun
value for the noun. A successful rule application activates FV and PNC as the next rules.
Finally, arc 6 is traversed using the following rule, PNC (for punctuation):
6. PNC
{PNC-START}
⎡
⎣
⎤
⎦
.
lex(PNC)
⎡
⎣
⎤
⎦
verb:
α
cat: PNC
arg: X
β
prn: K
noun:
β
fnc:
α
prn: K
rule level
⇒
⎡
⎣
⎤
⎦
⎡
⎣
⎤
⎦
noun: apple
sem: indef sg
fnc: eat
mdr:
prn: 7
verb: eat
cat: decl
sem: past
arg: girl apple
prn: 7
content level
Comment: The rule PNC applies the lex function defined in NLC'06, 14.3.8, to realize the full stop, using
the
cat
value
decl
of the
eat
proplet. A successful application activates PNC+START as the next rule
(for a possible traversal to a next proposition) and the Final State ST
F
, defined as {([verb:
α
]RP
PCN
)}.
The translation of LA-speak rules, specified in the manner shown in 7.4.3, into
the JSLIM software is routine.
16
The conceptual analysis underlying such a proplet-based software may begin
with the DBS graph structures, because they are simpler than the correspond-
ing LA-speak grammar. Consider, for example, extrapropositional coordina-
tion. The content of
Julia sang. Sue slept. John read.
, shown in 3.2.5 as a
set of proplets, may be analyzed as the following graph structure:
7.4.4 R
EPRESENTING AN EXTRAPROPOSITIONAL COORDINATION
(i)
semantic relations graph (SRG)
(iii)
numbered arcs graph (NAG)
sleep
sing
read
0
3
6
sleep
sing
read
1
4
7
2
Julia
Susanne
John
5
8
Julia
Susanne
John
(ii)
signature
V
V
V
(iv)
surface realization
0−1
2
3−4
5
6−7
8
.
.
.
N
N
N
Julia
slept__
Susanne
sang__
John
read__
In text- or dialogue-initial position, the initial “
” coordination line without a
left-hand node serves as the
start line
. Subsequent extrapropositional “
−
” lines
have a left-hand node, representing the verb of the preceding proposition.
17
−
16
While NLC'06 approached natural language production by defining an LA-think grammar first and
then adding the LA-speak grammar for English on top of it, our present approach is to define the
LA-speak grammar first and to obtain the LA-think grammar by omitting the part with the
⇒
and
⇑
Search WWH ::
Custom Search