CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 24728-24870
Annnotations
CORD-19_Custom_license_subset
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
T189 | 0-142 | Sentence | denotes | Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm. |
CORD-19-Sentences
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
TextSentencer_T189 | 0-142 | Sentence | denotes | Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm. |
TextSentencer_T189 | 0-142 | Sentence | denotes | Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm. |
T4804 | 0-142 | Sentence | denotes | Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm. |
Epistemic_Statements
Id | Subject | Object | Predicate | Lexical cue |
---|---|---|---|---|
T75 | 0-142 | Epistemic_statement | denotes | Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm. |