D13-1122 |
. Besides , we also present a
|
heuristic strategy
|
to build a large-scale training
|
D13-1122 |
the model , we also present a
|
heuristic strategy
|
to build a large-scale noisy
|
D13-1122 |
Section 3.2.1 . Hence , we propose a
|
heuristic strategy
|
to collect training data from
|
D13-1122 |
ranking model . We also present a
|
heuristic strategy
|
to build a large-scale noisy
|
E14-4016 |
iteration of TBL , we use some
|
heuristic strategy
|
. The heuristic score h is defined
|
P91-1001 |
subsumes scope ambiguity and a
|
heuristics strategy
|
would not be a strong method
|
N12-1037 |
types . We devise a family of
|
heuristic strategies
|
to separate independent corrections
|
D13-1122 |
time-consuming , we present a
|
heuristic strategy
|
to collect training data . We
|
J03-1003 |
article , but we came across various
|
heuristic strategies
|
that would speed up the algorithm
|
C04-1117 |
. <title> Cognate Mapping -- A
|
Heuristic Strategy
|
for the Semi-Supervised Acquisition
|
P10-1052 |
approaches and will not discuss
|
heuristic strategies
|
such as grafting ( Perkins et
|
C88-1048 |
several predefined uniform and
|
heuristic strategies
|
, the user can define his own
|
P14-1128 |
over the segmented bitexts . The
|
heuristic strategy
|
of grow - diag-final-and ( Koehn
|
D15-1142 |
converted NE dictio - nary . The
|
heuristic strategy
|
of grow-diag-final-and ( Koehn
|
E83-1010 |
as a collection of alternative
|
heuristic strategies
|
representing those used in the
|
C04-1051 |
string edit distance , and ( 2 ) a
|
heuristic strategy
|
that pairs initial ( presumably
|
W04-0707 |
algorithm incorporating independent
|
heuristic strategies
|
for recognizing DN definite descriptions
|
C04-1051 |
On test data extracted by the
|
heuristic strategy
|
, however , performance of the
|
J13-4009 |
heuristic merging . We chose two
|
heuristic strategies
|
, the POS-match strategy , which
|
A88-1031 |
grammar has failed , must embody
|
heuristic strategies
|
, and these may well differ from
|