CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 23553-23714 JSONTXT

Annnotations TAB JSON ListView MergeView

    CORD-19_Custom_license_subset

    {"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T182","span":{"begin":0,"end":161},"obj":"Sentence"}],"text":"In order to prune the estimation calls in Greedy(k, R), a natural idea is to employ the Cost-Effective Lazy Forward selection (CELF) algorithm proposed in [24] ."}

    CORD-19-Sentences

    {"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T182","span":{"begin":0,"end":161},"obj":"Sentence"},{"id":"TextSentencer_T182","span":{"begin":0,"end":161},"obj":"Sentence"},{"id":"T98056","span":{"begin":0,"end":161},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"In order to prune the estimation calls in Greedy(k, R), a natural idea is to employ the Cost-Effective Lazy Forward selection (CELF) algorithm proposed in [24] ."}