CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 24400-24600 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T187","span":{"begin":0,"end":200},"obj":"Sentence"}],"text":"The limitation leads to a rather fundamental question that, can we derive an upper bound of R({v}) which can be used to further prune unnecessary detection time estimations (MC calls) in Greedy(k, R)?"}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T187","span":{"begin":0,"end":200},"obj":"Sentence"},{"id":"TextSentencer_T187","span":{"begin":0,"end":200},"obj":"Sentence"},{"id":"T10394","span":{"begin":0,"end":200},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"The limitation leads to a rather fundamental question that, can we derive an upper bound of R({v}) which can be used to further prune unnecessary detection time estimations (MC calls) in Greedy(k, R)?"}

    Epistemic_Statements

    {"project":"Epistemic_Statements","denotations":[{"id":"T74","span":{"begin":0,"end":200},"obj":"Epistemic_statement"}],"text":"The limitation leads to a rather fundamental question that, can we derive an upper bound of R({v}) which can be used to further prune unnecessary detection time estimations (MC calls) in Greedy(k, R)?"}

    CORD-19-PD-MONDO

    {"project":"CORD-19-PD-MONDO","denotations":[{"id":"T13","span":{"begin":174,"end":176},"obj":"Disease"}],"attributes":[{"id":"A13","pred":"mondo_id","subj":"T13","obj":"http://purl.obolibrary.org/obo/MONDO_0007407"}],"text":"The limitation leads to a rather fundamental question that, can we derive an upper bound of R({v}) which can be used to further prune unnecessary detection time estimations (MC calls) in Greedy(k, R)?"}