| tech,26-4-H05-1064,ak | <term> Training </term> and <term> decoding </term> with the <term> model </term> requires summing over an exponential number of hidden-variable assignments : the required summations can be computed efficiently and exactly using <term> dynamic programming </term> . | #5511 Training and decoding with the model requires summing over an exponential number of hidden-variable assignments: the required summations can be computed efficiently and exactly using dynamic programming . | |
| measure(ment),4-6-H05-1064,ak | The <term> model </term> gives an <term> F-measure improvement </term> of [ ? ] 1.25 % beyond the <term> base parser </term> , and an [ ? ] 0.25 % improvement beyond the <term> Collins ( 2000 ) reranker </term> . | #5531 The model gives an F-measure improvement of [?] 1.25% beyond the base parser, and an [?] 0.25% improvement beyond the Collins (2000) reranker. |
