An efficient nearest neighbours search algorithm for full-text documents

A new algorithm is proposed for finding nearest neighbours in large full-text document collections. We show that our algorithm is more effective than others by evaluating on a collection of up to $1.5\cdot 10^6$ Webdocuments.