Similarity search is a fundamental algorithmic primitive, widely used in many computer science disciplines. Given set of points S and radius parameter r > 0, the -near neighbor ( -NN) problem asks for data structure that, given any query point q , returns p within distance at most from q. In this paper, we study -NN light individual fairness providing equal opportunities: all that are should...

Two lexical decision experiments, using words that were selected and closely matched on several criteria associated with lexical access provide evidence of facilitatory effects of orthographic neighborhood size and no significant evidence of inhibitory effects of orthographic neighborhood frequency on lexical access. The words used in Experiment 1 had few neighbors that were higher in frequency...