Wednesday, December 08, 2004

Reverse Search

I don't know if this has already been done. But wouldn't it be interesting if you could specify a few links and see what string search you would have had to do to get those links with reasonable ranks?

I think it would be cool. Can see how sites are similar, if they are at all. It could even be used to cluster links together with phrased based matching, I wonder if the solution to the reverse search problem could be done in a different way that data mining algs do phrase-based document clustering...

3 Comments:

At December 8, 2004 at 10:34 PM, Blogger Alex Pilchin said...

yeah, that be cool.
I suppose something like this could be used to build something simular to a Semantic Web on top of a the web externally rather than getting people to change the web (ie internally). Analogous to a high-level language vs. assembly.

 
At December 8, 2004 at 11:05 PM, Blogger Ilyia Kaushansky said...

IMHO, the following problem is much more interesting:
Given a URL, find the smallest query that will bring the URL in the top 10.

 
At December 8, 2004 at 11:09 PM, Blogger Diego Matute said...

Thats a good point. That can also be slightly generalized to a set of links/ranks pairs.

 

Post a Comment

<< Home