tech,11-1-J05-1003,bq |
rerank the output of an existing
<term>
|
probabilistic
parser
|
</term>
. The base
<term>
parser
</term>
produces
|
#8660
This article considers approaches which rerank the output of an existing probabilistic parser. |
tech,2-2-J05-1003,bq |
probabilistic parser
</term>
. The base
<term>
|
parser
|
</term>
produces a set of
<term>
candidate
|
#8665
The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. |
other,7-2-J05-1003,bq |
<term>
parser
</term>
produces a set of
<term>
|
candidate
parses
|
</term>
for each input
<term>
sentence
</term>
|
#8670
The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. |
other,12-2-J05-1003,bq |
candidate parses
</term>
for each input
<term>
|
sentence
|
</term>
, with associated
<term>
probabilities
|
#8675
The base parser produces a set of candidate parses for each input sentence , with associated probabilities that define an initial ranking of these parses. |
other,16-2-J05-1003,bq |
<term>
sentence
</term>
, with associated
<term>
|
probabilities
|
</term>
that define an initial
<term>
ranking
|
#8679
The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. |
other,21-2-J05-1003,bq |
probabilities
</term>
that define an initial
<term>
|
ranking
|
</term>
of these
<term>
parses
</term>
. A second
|
#8684
The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses. |
other,24-2-J05-1003,bq |
initial
<term>
ranking
</term>
of these
<term>
|
parses
|
</term>
. A second
<term>
model
</term>
then
|
#8687
The base parser produces a set of candidate parses for each input sentence, with associated probabilities that define an initial ranking of these parses . |
tech,2-3-J05-1003,bq |
these
<term>
parses
</term>
. A second
<term>
|
model
|
</term>
then attempts to improve upon this
|
#8691
A second model then attempts to improve upon this initial ranking, using additional features of the tree as evidence. |
other,10-3-J05-1003,bq |
attempts to improve upon this initial
<term>
|
ranking
|
</term>
, using additional
<term>
features
|
#8699
A second model then attempts to improve upon this initial ranking , using additional features of the tree as evidence. |
other,14-3-J05-1003,bq |
<term>
ranking
</term>
, using additional
<term>
|
features
|
</term>
of the
<term>
tree
</term>
as evidence
|
#8703
A second model then attempts to improve upon this initial ranking, using additional features of the tree as evidence. |
other,17-3-J05-1003,bq |
additional
<term>
features
</term>
of the
<term>
|
tree
|
</term>
as evidence . The strength of our
|
#8706
A second model then attempts to improve upon this initial ranking, using additional features of the tree as evidence. |
tech,4-4-J05-1003,bq |
as evidence . The strength of our
<term>
|
approach
|
</term>
is that it allows a
<term>
tree
</term>
|
#8714
The 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 these features into account. |
other,10-4-J05-1003,bq |
approach
</term>
is that it allows a
<term>
|
tree
|
</term>
to be represented as an arbitrary
|
#8720
The 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 these features into account. |
other,19-4-J05-1003,bq |
represented as an arbitrary set of
<term>
|
features
|
</term>
, without concerns about how these
|
#8729
The 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 these features into account. |
other,26-4-J05-1003,bq |
without concerns about how these
<term>
|
features
|
</term>
interact or overlap and without
|
#8736
The 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 these features into account. |
other,37-4-J05-1003,bq |
and without the need to define a
<term>
|
derivation
|
</term>
or a
<term>
generative model
</term>
|
#8747
The 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 these features into account. |
tech,40-4-J05-1003,bq |
define a
<term>
derivation
</term>
or a
<term>
|
generative
model
|
</term>
which takes these
<term>
features
</term>
|
#8750
The 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 these features into account. |
other,45-4-J05-1003,bq |
generative model
</term>
which takes these
<term>
|
features
|
</term>
into account . We introduce a new
|
#8755
The 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 these features into account. |
tech,4-5-J05-1003,bq |
into account . We introduce a new
<term>
|
method
|
</term>
for the
<term>
reranking task
</term>
|
#8763
We introduce a new method for the reranking task, based on the boosting approach to ranking problems described in Freund et al. (1998). |
tech,7-5-J05-1003,bq |
introduce a new
<term>
method
</term>
for the
<term>
|
reranking
task
|
</term>
, based on the
<term>
boosting approach
|
#8766
We introduce a new method for the reranking task, based on the boosting approach to ranking problems described in Freund et al. (1998). |