in reply to Re: non-exact regexp matches
in thread non-exact regexp matches

Thanks ! These are pretty cool (I could see come use for them in my work), but I'm looking for something which I could use a regexp: 
$str = "PolarBear";
$str =~ /[Pp]olar[Bb]e[ae]r/;

[download]
if $str is "polarbear" or "polarbeer" or "Polarbear" returns 0
if $str is "PolarBeat returns 1
if $str is "PelarBeat returns 2
etc,etc.

Replies are listed 'Best First'.
Re^3: non-exact regexp matches
by McMahon (Chaplain) on Jun 23, 2004 at 15:02 UTC
    Ah, I see. (Also didn't realize that String::Approx doesn't use regexes)

    So this is crazy, but it just might work: stick each letter of one string into one array, then each letter of the other string into the other array. Then use List::Compare to figure out how the two strings are different.

    List::Compare is my favorite hammer these days. =)
[reply]
      cool. This seems like a generalized way to go about it. Hope the performance is ok. I need to compare a 27 character reg-exp to a 1 million character string ! vince
[reply]
        Reply here when you do it, if you don't mind, I'm interested. I've only ever used List::Compare against arrays with a few thousand elements. Performance was quite acceptable under those conditions. .
[reply]
        You are talking about regexes, but your example shows the most trivial regex one can image, namely one that doesn't contain any characters that are special. Do you want to match any possible regex, or are you just looking for matching strings? The latter is far, far more easier than the former - and the latter doesn't need the regex engine at all.

        Abigail

[reply]

In Section Seekers of Perl Wisdom