Thanks for responding.
On Fri, Oct 28, 2011 at 1:12 AM, Felipe Hummel wrote:
> For the indexing part, you can 'insert' the term multiple times (term-weight
> times) constructing the document String manually. That is not very typical,
> you would normally feed Lucene with the original documents fo
For the indexing part, you can 'insert' the term multiple times (term-weight
times) constructing the document String manually. That is not very typical,
you would normally feed Lucene with the original documents for it to parse
and index.
The query processing could be done similar as you said.
Jus
Any pointers/suggestions on my approach ?
On 10/22/11, prasenjit mukherjee wrote:
> My use case is the following :
> Given an n-dimensional vector ( only +ve quadrants/points ) find its
> closest neighbours. I would like to try out with lucene's default
> ranking. Here is how a typical document
