| 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,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 . |
| 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,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,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. |
| other,23-7-J05-1003,bq | evidence from an additional 500,000 <term> | features | </term> over <term> parse trees </term> that | #8822 The method combined the log-likelihood under a baseline model (that of Collins [1999]) with evidence from an additional 500,000 features over parse trees that were not included in the original model. |
