C96-2106 |
contrast to the previous method ,
|
partial evaluation
|
is corpus-independent . We have
|
J12-3005 |
-RSB- actually mean . " In the
|
partial evaluation
|
condition , however , all feature
|
N04-1027 |
this occurs despite acceptable
|
partial evaluation
|
results . By partial results
|
D14-1209 |
search-aware versions using these
|
partial evaluation
|
metrics . 3.1 Solution 1 : Simple
|
J96-3004 |
Evaluation In this section we present a
|
partial evaluation
|
of the current system , in three
|
J97-3004 |
obtained because techniques such as
|
partial evaluation
|
can be applied . For example
|
J97-3004 |
this enables the application of
|
partial evaluation
|
techniques . The first consideration
|
C96-2106 |
Stestoft , 1993 ) . Analogous to
|
partial evaluation
|
of definite clauses , we can
|
J95-4003 |
trade-off will ensue . Excess of
|
partial evaluation
|
off-line increases the size of
|
D11-1050 |
yields highest f-scores in full and
|
partial evaluation
|
-- both with the full-size attribute
|
C96-2106 |
since they drive the derivation .
|
Partial evaluation
|
means here to substitute type
|
P03-1026 |
algorithm also requires an off-line
|
partial evaluation
|
of the grammar rules that increases
|
C02-1075 |
bottom-up passive chart parser or with
|
partial evaluation
|
in logic program - ming . The
|
E95-1025 |
value that may change , •
|
Partial evaluation
|
, • Functional notation
|
P03-1026 |
, unless those rules and their
|
partial evaluations
|
are folded together with local
|
E09-2015 |
aggressive optimizations ( type-driven
|
partial evaluation
|
) , and overloading resolution
|
E95-1025 |
optimisation of logic programs (
|
partial evaluation
|
, tabulation , indexing , program
|
J97-3004 |
increase . In languages such as C ,
|
partial evaluation
|
does not seem to be possible
|
C96-2106 |
participate in unification during
|
partial evaluation
|
. In contrast to the previous
|
C00-2155 |
bottom-up passive chart parser or to
|
partial evaluation
|
in logic programming ; see (
|