in reply to Match Algorithm: How close of a match

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.

  • Comment on Re: Match Algorithm: How close of a match