namotco wrote: >
Let's say I want to search some text for "abc123". However, we know people can make typos and so they could have entered avc123 or abc223 or sbc123 or bc123 many other combinations... So I want to search for those possibilities as well. So how would I go about creating the proper regex?
I don't think a regex is appropriate in this case, but if you want to write something that guesses at what a misspelled string should have been then search the Web for Damerau-Levenshtein distance, which is very effective and the algorithm codes up fairly simply. Rob -- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] http://learn.perl.org/
