Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical

Re^4: Running SuperSearch off a fast full-text index.

by creamygoodness (Curate)
on Jun 10, 2007 at 22:03 UTC ( #620378=note: print w/replies, xml ) Need Help??

in reply to Re^3: Running SuperSearch off a fast full-text index.
in thread Running SuperSearch off a fast full-text index.

I didn't realize you were the author of KinoSearch, which you are also suggesting as a platform.

And I, in turn, was unaware that dmitri was my sock puppet. ;)

intelligent analysis of huge amounts of generic data can beat analysis of specialized data.

Sure, those techniques are powerful... The brute force "did you mean" stratagem[1] is tough to top, no question!

As for whether we'll be able to deliver an overall improvement on the PerlMonks search experience, I guess we'll just have to present something, and people can vote with their clicks.

[1] Major search engines decide what to suggest based on search history: what most people have typed in after misspelling something. This has proven superior to algorithms based on edit distance.

Marvin Humphrey
Rectangular Research ―
  • Comment on Re^4: Running SuperSearch off a fast full-text index.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://620378]
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others wandering the Monastery: (7)
As of 2021-10-21 12:37 GMT
Find Nodes?
    Voting Booth?
    My first memorable Perl project was:

    Results (83 votes). Check out past polls.