Beefy Boxes and Bandwidth Generously Provided by pair Networks
more useful options
 
PerlMonks  

Re2: New simple search

by blakem (Monsignor)
on Jul 09, 2002 at 05:32 UTC ( #180418=note: print w/ replies, xml ) Need Help??


in reply to (tye)Re: New simple search
in thread New simple search

I like the points system.... Though I might tweak the definition of a full-word. How about "a substring bounded by non-letters (or the ends of the string)". Something like (^|[^A-Za-z])ide([^A-Za-z]|$) That approach has worked well for me in my search engine attempt. Especially considering titles like 'Using CGI::Cookie with HTML::Template'

-Blake


Comment on Re2: New simple search
Download Code
(tye)Re2: New simple search
by tye (Cardinal) on Jul 09, 2002 at 13:55 UTC

    Like I said, I don't want to go back to using a regex for simple search and your definition only makes sense for words of letters. And, like I said, I don't really want to get this complicated and figure out and document which cases should have which kind of word boundary rules (consider "don't", "qq'", "'hi'", "0x", "%s", etc.)

    Like I said, Super Search will allow more control over boundaries to use with your search terms.

            - tye (but my friends call me "Tye")
      Ah, I see. I thought you were vowing not to accept regular expressions in the user input. Anyway, I like the non-letter boundaries, but sticking with whitespace is almost as good and probably quite a bit quicker.

      -Blake

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others perusing the Monastery: (17)
As of 2015-07-02 10:02 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (33 votes), past polls