Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

RE: pattern matching with heuristics

by Ovid (Cardinal)
on Jul 06, 2000 at 23:28 UTC ( #21370=note: print w/replies, xml ) Need Help??


in reply to pattern matching with heuristics

ZZamboni is right about using String::Approx to get this done. But be forewarned: String::Approx runs about as fast as a one-legged dog. I don't remember how much slower (the info is in the Perl Cookbook which I can't find since I moved, sniff, sniff), but I seem to recall it's something like 10 times slower than a typical regex. Thus, you don't want to use if if you can avoid it, and if you can't, try to avoid iterating over it.

Cheers,
Ovid

Update: kudra has her copy of the Cookbook (I'm so jealous) and says that it is 10-40 times slower. If she's wrong, we'll all just fly over to the Netherlands and have a little "chat" with her about supplying us with innacurate data. Then we'll party.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (4)
As of 2021-11-29 13:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?