Thanks for the suggestion
Imagine, for instance, a regexp like this
$pattern="[^D]{2,3}FGR{2}..H";There is not fuzzyness on this. From a list of strings, some will match and some will NOT match this regular expression. The question is: considering ONLY substitutions, allow a maximum of 2 mismatches when evaluating if the string matches or not to $pattern. This will result in the migration of some strings from the 'non-matching group' to the 'matching group'.
How to do this in Perl?
In reply to Re^4: approximate regular expression
by jrblas
in thread approximate regular expression
by jrblas
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |