phrase search
- From: nicolas_laurent545@xxxxxxxxxxx
- Date: 29 Sep 2006 06:25:29 -0700
Not mathematician, could someone explains to me in plain words what
this pseudo code means. If you provide an example it would be very
appreciated. I understand the first part.
Many thanks
Find set of documents D in which all keywords (k1...km) in phrase occur
(using AND query processing).
Intitialize empty set, R, of retrieved documents.
For each document, d, in D:
Get array, Pi ,of positions of occurrences for each ki in d
Find shortest array Ps of the Pi's
For each position p of keyword ks in Ps
For each keyword ki except ks
Use binary search to find a position (p - s + i) in
the array Pi
If correct position for every keyword found, add d to R
Return R
.
- Follow-Ups:
- Re: phrase search
- From: Ross A. Finlayson
- Re: phrase search
- Prev by Date: Re: My investigations into Godels Incompleteness Theorem
- Next by Date: Re: My investigations into Godels Incompleteness Theorem
- Previous by thread: Re: My investigations into Godels Incompleteness Theorem
- Next by thread: Re: phrase search
- Index(es):
Relevant Pages
|