The article also introduces a new
<term>
algorithm
</term>
for the
<term>
boosting approach
</term>
which takes advantage of the
<term>
sparsity
</term>
of the
<term>
feature space
</term>
in the
<term>
parsing data
</term>
.
#8232The article also introduces a newalgorithm for the boosting approach which takes advantage of the sparsity of the feature space in the parsing data.
tech,8-10-J05-1003,ak
Experiments show significant efficiency gains for the new
<term>
algorithm
</term>
over the obvious implementation of the
<term>
boosting approach
</term>
.
#8260Experiments show significant efficiency gains for the newalgorithm over the obvious implementation of the boosting approach.
tech,1-2-J05-1003,ak
The
<term>
base parser
</term>
produces a set of
<term>
candidate parses
</term>
for each
<term>
input sentence
</term>
, with associated
<term>
probabilities
</term>
that define an initial
<term>
ranking
</term>
of these
<term>
parses
</term>
.
#8029Thebase parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses.
model,18-8-J05-1003,ak
The new
<term>
model
</term>
achieved 89.75 %
<term>
F-measure
</term>
, a 13 % relative decrease in
<term>
F-measure error
</term>
over the
<term>
baseline model ’s
</term>
score of 88.2 % .
#8218The new model achieved 89.75% F-measure, a 13% relative decrease in F-measure error over thebaseline model ’s score of 88.2%.
tech,9-9-J05-1003,ak
The article also introduces a new
<term>
algorithm
</term>
for the
<term>
boosting approach
</term>
which takes advantage of the
<term>
sparsity
</term>
of the
<term>
feature space
</term>
in the
<term>
parsing data
</term>
.
#8235The article also introduces a new algorithm for theboosting approach which takes advantage of the sparsity of the feature space in the parsing data.
tech,15-10-J05-1003,ak
Experiments show significant efficiency gains for the new
<term>
algorithm
</term>
over the obvious implementation of the
<term>
boosting approach
</term>
.
#8267Experiments show significant efficiency gains for the new algorithm over the obvious implementation of theboosting approach.
tech,13-5-J05-1003,ak
We introduce a new method for the
<term>
reranking task
</term>
, based on the
<term>
boosting approach to ranking problems
</term>
described in Freund et al. ( 1998 ) .
#8137We introduce a new method for the reranking task, based on theboosting approach to ranking problems described in Freund et al. (1998).
tech,3-6-J05-1003,ak
We apply the
<term>
boosting method
</term>
to parsing the
<term>
Wall Street Journal treebank
</term>
.
#8154We apply theboosting method to parsing the Wall Street Journal treebank.
other,7-2-J05-1003,ak
The
<term>
base parser
</term>
produces a set of
<term>
candidate parses
</term>
for each
<term>
input sentence
</term>
, with associated
<term>
probabilities
</term>
that define an initial
<term>
ranking
</term>
of these
<term>
parses
</term>
.
#8035The base parser produces a set ofcandidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses.
other,37-4-J05-1003,ak
The strength of our approach is that it allows a
<term>
tree
</term>
to be represented as an arbitrary set of
<term>
features
</term>
, without concerns about how these
<term>
features
</term>
interact or overlap and without the need to define a
<term>
derivation
</term>
or a
<term>
generative model
</term>
which takes these
<term>
features
</term>
into account .
#8112The strength of our approach is that it allows a tree to be represented as an arbitrary set of features, without concerns about how these features interact or overlap and without the need to define aderivation or a generative model which takes these features into account.
tech,21-11-J05-1003,ak
We argue that the method is an appealing alternative — in terms of both simplicity and efficiency — to work on
<term>
feature selection methods
</term>
within
<term>
log-linear ( maximum-entropy ) models
</term>
.
#8291We argue that the method is an appealing alternative—in terms of both simplicity and efficiency—to work onfeature selection methods within log-linear (maximum-entropy) models.
other,19-9-J05-1003,ak
The article also introduces a new
<term>
algorithm
</term>
for the
<term>
boosting approach
</term>
which takes advantage of the
<term>
sparsity
</term>
of the
<term>
feature space
</term>
in the
<term>
parsing data
</term>
.
#8245The article also introduces a new algorithm for the boosting approach which takes advantage of the sparsity of thefeature space in the parsing data.
other,14-3-J05-1003,ak
A second
<term>
model
</term>
then attempts to improve upon this initial
<term>
ranking
</term>
, using additional
<term>
features
</term>
of the
<term>
tree
</term>
as evidence .
#8068A second model then attempts to improve upon this initial ranking, using additionalfeatures of the tree as evidence.
other,19-4-J05-1003,ak
The strength of our approach is that it allows a
<term>
tree
</term>
to be represented as an arbitrary set of
<term>
features
</term>
, without concerns about how these
<term>
features
</term>
interact or overlap and without the need to define a
<term>
derivation
</term>
or a
<term>
generative model
</term>
which takes these
<term>
features
</term>
into account .
#8094The strength of our approach is that it allows a tree to be represented as an arbitrary set offeatures, without concerns about how these features interact or overlap and without the need to define a derivation or a generative model which takes these features into account.
other,26-4-J05-1003,ak
The strength of our approach is that it allows a
<term>
tree
</term>
to be represented as an arbitrary set of
<term>
features
</term>
, without concerns about how these
<term>
features
</term>
interact or overlap and without the need to define a
<term>
derivation
</term>
or a
<term>
generative model
</term>
which takes these
<term>
features
</term>
into account .
#8101The strength of our approach is that it allows a tree to be represented as an arbitrary set of features, without concerns about how thesefeatures interact or overlap and without the need to define a derivation or a generative model which takes these features into account.
other,45-4-J05-1003,ak
The strength of our approach is that it allows a
<term>
tree
</term>
to be represented as an arbitrary set of
<term>
features
</term>
, without concerns about how these
<term>
features
</term>
interact or overlap and without the need to define a
<term>
derivation
</term>
or a
<term>
generative model
</term>
which takes these
<term>
features
</term>
into account .
#8120The strength of our approach is that it allows a tree to be represented as an arbitrary set of features, without concerns about how these features interact or overlap and without the need to define a derivation or a generative model which takes thesefeatures into account.
other,23-7-J05-1003,ak
The method combined the
<term>
log-likelihood under a baseline model
</term>
( that of Collins [ 1999 ] ) with evidence from an additional 500,000
<term>
features
</term>
over
<term>
parse trees
</term>
that were not included in the original
<term>
model
</term>
.
#8187The method combined the log-likelihood under a baseline model (that of Collins [1999]) with evidence from an additional 500,000features over parse trees that were not included in the original model.
measure(ment),6-8-J05-1003,ak
The new
<term>
model
</term>
achieved 89.75 %
<term>
F-measure
</term>
, a 13 % relative decrease in
<term>
F-measure error
</term>
over the
<term>
baseline model ’s
</term>
score of 88.2 % .
#8206The new model achieved 89.75%F-measure, a 13% relative decrease in F-measure error over the baseline model’s score of 88.2%.
measure(ment),14-8-J05-1003,ak
The new
<term>
model
</term>
achieved 89.75 %
<term>
F-measure
</term>
, a 13 % relative decrease in
<term>
F-measure error
</term>
over the
<term>
baseline model ’s
</term>
score of 88.2 % .
#8214The new model achieved 89.75% F-measure, a 13% relative decrease inF-measure error over the baseline model’s score of 88.2%.
model,40-4-J05-1003,ak
The strength of our approach is that it allows a
<term>
tree
</term>
to be represented as an arbitrary set of
<term>
features
</term>
, without concerns about how these
<term>
features
</term>
interact or overlap and without the need to define a
<term>
derivation
</term>
or a
<term>
generative model
</term>
which takes these
<term>
features
</term>
into account .
#8115The strength of our approach is that it allows a tree to be represented as an arbitrary set of features, without concerns about how these features interact or overlap and without the need to define a derivation or agenerative model which takes these features into account.