Passage Search

[Giulio Cesare Solaroli <gi...@gmail.com>]

Hi all,

reading some posts in Steve Green's weblog, I found the description of
a "Passage search"
(http://blogs.sun.com/roller/page/searchguy/20050126).

Translated into Lucene words, this looks like a nice score algorithm
that could be applied to rank the matching documents.

Does anybody have any idea on how the suggested approach stands up to
Lucene current algorithm, and how difficult would be to inplement also
the "Passage search" scoring?

Thanks for your attention.

Regards,

Giulio Cesare Solaroli

---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-dev-help@jakarta.apache.org

Re: Passage Search

[jian chen <ch...@gmail.com>]

True, the span query accomplishes large part of the passage search.
However, correct me if I am wrong, it seems to me that the span query
only matches all words you specified. there is a limitation there
compared to passage search or cover density search, which matches some
of the user input keywords.

I guess in order to do passage/cover density ranking, it would be
efficient to load the inverted document all at once for a document and
give a score for that document.

Is my analysis correct? Sorry in advance if any of the facts are wrong. 

Cheers,

Jian


On Thu, 27 Jan 2005 14:45:49 -0800, David Spencer
<da...@tropo.com> wrote:
> Giulio Cesare Solaroli wrote:
> 
> > Hi all,
> >
> > reading some posts in Steve Green's weblog, I found the description of
> > a "Passage search"
> > (http://blogs.sun.com/roller/page/searchguy/20050126).
> >
> > Translated into Lucene words, this looks like a nice score algorithm
> > that could be applied to rank the matching documents.
> >
> > Does anybody have any idea on how the suggested approach stands up to
> > Lucene current algorithm, and how difficult would be to inplement also
> > the "Passage search" scoring?
> 
> Isn't this called a "span query" in Lucene?
> 
> http://jakarta.apache.org/lucene/docs/api/org/apache/lucene/search/spans/package-summary.html
> >
> > Thanks for your attention.
> >
> > Regards,
> >
> > Giulio Cesare Solaroli
> >
> > ---------------------------------------------------------------------
> > To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
> > For additional commands, e-mail: lucene-dev-help@jakarta.apache.org
> >
> 
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
> For additional commands, e-mail: lucene-dev-help@jakarta.apache.org
> 
>

---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-dev-help@jakarta.apache.org

Re: Passage Search

[David Spencer <da...@tropo.com>]

Giulio Cesare Solaroli wrote:

> Hi all,
> 
> reading some posts in Steve Green's weblog, I found the description of
> a "Passage search"
> (http://blogs.sun.com/roller/page/searchguy/20050126).
> 
> Translated into Lucene words, this looks like a nice score algorithm
> that could be applied to rank the matching documents.
> 
> Does anybody have any idea on how the suggested approach stands up to
> Lucene current algorithm, and how difficult would be to inplement also
> the "Passage search" scoring?

Isn't this called a "span query" in Lucene?

http://jakarta.apache.org/lucene/docs/api/org/apache/lucene/search/spans/package-summary.html
> 
> Thanks for your attention.
> 
> Regards,
> 
> Giulio Cesare Solaroli
> 
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
> For additional commands, e-mail: lucene-dev-help@jakarta.apache.org
> 


---------------------------------------------------------------------
To unsubscribe, e-mail: lucene-dev-unsubscribe@jakarta.apache.org
For additional commands, e-mail: lucene-dev-help@jakarta.apache.org