Negative filter
context-free, phrase-structure, grammar 13
(416.2 per million)
tech,10-2-E87-1037,ak
formalisms
</term>
is organized within a
<term>
chart-parsing framework
</term>
. The declarative character of the
#17074Typically the processing of these formalisms is organized within achart-parsing framework.
tech,19-5-E87-1037,ak
rule-invocation strategies
</term>
within
<term>
context-free chart parsing
</term>
. The
<term>
verb forms
</term>
are often
#17152The aim of this paper is to provide a survey and a practical comparison of fundamental rule-invocation strategies withincontext-free chart parsing.
tech,15-3-E87-1037,ak
to decide upon an overall optimal
<term>
control strategy
</term>
on the part of the
<term>
processor
#17092The declarative character of the formalisms makes it important to decide upon an overall optimalcontrol strategy on the part of the processor.
other,5-2-E87-1037,ak
Typically the processing of these
<term>
formalisms
</term>
is organized within a
<term>
chart-parsing
#17069Typically the processing of theseformalisms is organized within a chart-parsing framework.
other,5-3-E87-1037,ak
. The declarative character of the
<term>
formalisms
</term>
makes it important to decide upon
#17082The declarative character of theformalisms makes it important to decide upon an overall optimal control strategy on the part of the processor.
other,2-1-E87-1037,ak
normal form
</term>
. Currently several
<term>
grammatical formalisms
</term>
converge towards being declarative
#17043Currently severalgrammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a backbone, e.g. LFG and PATR-II.
tech,19-1-E87-1037,ak
grammar
</term>
as a backbone , e.g.
<term>
LFG
</term>
and
<term>
PATR-II
</term>
. Typically
#17060Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a backbone, e.g.LFG and PATR-II.
tech,21-1-E87-1037,ak
backbone , e.g.
<term>
LFG
</term>
and
<term>
PATR-II
</term>
. Typically the processing of these
#17062Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a backbone, e.g. LFG andPATR-II.
other,15-4-E87-1037,ak
into critical focus : to gain maximal
<term>
processing efficiency
</term>
, one has to determine the best way
#17116In particular, this brings the rule-invocation strategy into critical focus: to gain maximalprocessing efficiency, one has to determine the best way of putting the rules to use.
tech,22-3-E87-1037,ak
strategy
</term>
on the part of the
<term>
processor
</term>
. In particular , this brings the
#17099The declarative character of the formalisms makes it important to decide upon an overall optimal control strategy on the part of theprocessor.
tech,16-5-E87-1037,ak
practical comparison of fundamental
<term>
rule-invocation strategies
</term>
within
<term>
context-free chart parsing
#17149The aim of this paper is to provide a survey and a practical comparison of fundamentalrule-invocation strategies within context-free chart parsing.
tech,6-4-E87-1037,ak
</term>
. In particular , this brings the
<term>
rule-invocation strategy
</term>
into critical focus : to gain maximal
#17107In particular, this brings therule-invocation strategy into critical focus: to gain maximal processing efficiency, one has to determine the best way of putting the rules to use.
model,28-4-E87-1037,ak
determine the best way of putting the
<term>
rules
</term>
to use . The aim of this paper is
#17129In particular, this brings the rule-invocation strategy into critical focus: to gain maximal processing efficiency, one has to determine the best way of putting therules to use.