Looks pretty interesting. A lazy span implementation could certainly be
useful for certain highlighting situations. Barrier of entry looks a bit
high unfortunately, but the text def helps for anyone looking to learn
how the current spanquery stuff works.
Paul Elschot wrote:
A bit late in reacting, but you may also may want to take a look
at this:
Paolo Boldi, Sebastiano Vigna
Efficient Optimally Lazy Algorithms for Minimal-Interval Semantics
Oct 2007, arXiv:0710.1525v1
The algorithms used in the lucene spans package are surprisingly
similar. Nevertheless, there are some differences too, especially
in the queue ordering conditions.
Regards,
Paul Elschot
Op Thursday 28 August 2008 01:09:51 schreef Mark Miller:
Its a matter of speed. Once you know the document matches the query,
it would in general, make no sense to keep looking unless you had a
strong reason to factor it into scoring. So I don't think it makes
much sense to modify...now adding new Span classes...
Is there any
general interest in modifying NearSpanOrdered/NearSpanUnordered to
include all possible spans?
Thanks,
Nathan
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
---------------------------------------------------------------------
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
