Negative filter
non-redundant, lexicon, specification 18
(576.3 per million)
other,1-1-C94-1080,ak
readable dictionaries
</term>
. The
<term>
behavioral specification
</term>
of an
<term>
object-oriented grammar
#26886Thebehavioral specification of an object-oriented grammar model is considered.
model,5-1-C94-1080,ak
behavioral specification
</term>
of an
<term>
object-oriented grammar model
</term>
is considered . The
<term>
model
</term>
#26890The behavioral specification of anobject-oriented grammar model is considered.
model,1-2-C94-1080,ak
grammar model
</term>
is considered . The
<term>
model
</term>
is based on
<term>
full lexicalization
#26897Themodel is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
tech,5-2-C94-1080,ak
. The
<term>
model
</term>
is based on
<term>
full lexicalization
</term>
,
<term>
head-orientation
</term>
via
#26901The model is based onfull lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
tech,8-2-C94-1080,ak
on
<term>
full lexicalization
</term>
,
<term>
head-orientation
</term>
via
<term>
valency constraints
</term>
#26904The model is based on full lexicalization,head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
model,10-2-C94-1080,ak
</term>
,
<term>
head-orientation
</term>
via
<term>
valency constraints
</term>
and
<term>
dependency relations
</term>
#26906The model is based on full lexicalization, head-orientation viavalency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
other,13-2-C94-1080,ak
<term>
valency constraints
</term>
and
<term>
dependency relations
</term>
,
<term>
inheritance
</term>
as a means
#26909The model is based on full lexicalization, head-orientation via valency constraints anddependency relations, inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
other,16-2-C94-1080,ak
<term>
dependency relations
</term>
,
<term>
inheritance
</term>
as a means for
<term>
non-redundant
#26912The model is based on full lexicalization, head-orientation via valency constraints and dependency relations,inheritance as a means for non-redundant lexicon specification, and concurrency of computation.
tech,26-2-C94-1080,ak
lexicon specification
</term>
, and
<term>
concurrency of computation
</term>
. The
<term>
computation model
</term>
#26922The model is based on full lexicalization, head-orientation via valency constraints and dependency relations, inheritance as a means for non-redundant lexicon specification, andconcurrency of computation.
model,1-3-C94-1080,ak
concurrency of computation
</term>
. The
<term>
computation model
</term>
relies upon the
<term>
actor paradigm
#26927Thecomputation model relies upon the actor paradigm, with concurrency entering through asynchronous message passing between actors.
tech,6-3-C94-1080,ak
computation model
</term>
relies upon the
<term>
actor paradigm
</term>
, with
<term>
concurrency
</term>
entering
#26932The computation model relies upon theactor paradigm, with concurrency entering through asynchronous message passing between actors.
tech,10-3-C94-1080,ak
the
<term>
actor paradigm
</term>
, with
<term>
concurrency
</term>
entering through
<term>
asynchronous
#26936The computation model relies upon the actor paradigm, withconcurrency entering through asynchronous message passing between actors.
tech,13-3-C94-1080,ak
concurrency
</term>
entering through
<term>
asynchronous message passing
</term>
between
<term>
actors
</term>
. In particular
#26939The computation model relies upon the actor paradigm, with concurrency entering throughasynchronous message passing between actors.
other,17-3-C94-1080,ak
asynchronous message passing
</term>
between
<term>
actors
</term>
. In particular , we here elaborate
#26943The computation model relies upon the actor paradigm, with concurrency entering through asynchronous message passing betweenactors.
lr,15-4-C94-1080,ak
principles of how the global behavior of a
<term>
lexically distributed grammar
</term>
and its corresponding
<term>
parser
#26960In particular, we here elaborate on principles of how the global behavior of alexically distributed grammar and its corresponding parser can be specified in terms of event type networks and event networks, resp.
tech,21-4-C94-1080,ak
grammar
</term>
and its corresponding
<term>
parser
</term>
can be specified in terms of
<term>
#26966In particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its correspondingparser can be specified in terms of event type networks and event networks, resp.
other,28-4-C94-1080,ak
</term>
can be specified in terms of
<term>
event type networks
</term>
and
<term>
event networks
</term>
, resp
#26973In particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its corresponding parser can be specified in terms ofevent type networks and event networks, resp.
other,32-4-C94-1080,ak
<term>
event type networks
</term>
and
<term>
event networks
</term>
, resp . We present
<term>
LHIP
</term>
#26977In particular, we here elaborate on principles of how the global behavior of a lexically distributed grammar and its corresponding parser can be specified in terms of event type networks andevent networks, resp.