Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: pattern matching with heuristics

by Anonymous Monk
on Jul 07, 2000 at 18:11 UTC ( [id://21480]=note: print w/replies, xml ) Need Help??


in reply to pattern matching with heuristics

Well, it's not strictly Perl, but it may be usefull anyway. If you are using a file to store these titles over time and that file is in a format that you can use one of the DBI modules to search against, you could craft a SQL query to do near matches. SQL offers the LIKE select type, which I have used to get approximate information in the past. I have never used String::Approx, so I can't offer you a speed comparision, but using the SQL way was plenty fast enough to be used in a web search without noticed latency. http://w3.one.net/~jhoffman/sqltut.htm#Using_LIKE

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others exploiting the Monastery: (5)
As of 2024-04-19 16:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found