String::Approx? If that's not what you want the google fodder "Levenshtein distance" is probably a good starting point.
The cake is a lie.
The cake is a lie.
The cake is a lie.
In reply to Re: Match Algorithm: How close of a match
by Fletch
in thread Match Algorithm: How close of a match
by zer
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |