CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 24728-24870 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T189","span":{"begin":0,"end":142},"obj":"Sentence"}],"text":"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

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T189","span":{"begin":0,"end":142},"obj":"Sentence"},{"id":"TextSentencer_T189","span":{"begin":0,"end":142},"obj":"Sentence"},{"id":"T4804","span":{"begin":0,"end":142},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"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

    {"project":"Epistemic_Statements","denotations":[{"id":"T75","span":{"begin":0,"end":142},"obj":"Epistemic_statement"}],"text":"Based on the bound, we propose a new greedy algorithm Upper Bound based Greedy (UBG for short), which outperforms the original CELF algorithm."}