Declare subset ranking when trading candidate breadth for speed
Declare subset ranking when trading candidate breadth for speed For a bounded lexical search, reducing candidate verification can materially improve latency, but sorting the surviving candidates does not produce global relevance or global recency. Return the candidate budget and…