Match Algorithm: How close of a match

zer has asked for the wisdom of the Perl Monks concerning the following question:

Good morning,

Is there anything available that I can compair two strings to determine how closely they match each other? I am thinking there should be a perl module for this but I can't seem to find any.

Alternately, I would likely program this myself. Perhaps there is an algorithm or some experience in the monestary that could point me in the right direction so I don't end up recreating the wheel.

I have text that was munged up by an application. I need to be able to crossreference that text with the original as the munged up text has changes i need to make to the original.

Thanks for all the help!

Comment on Match Algorithm: How close of a match

Replies are listed 'Best First'.
Re: Match Algorithm: How close of a match by zwon (Abbot) on Aug 17, 2010 at 15:42 UTC
You can start with Text::Levenshtein.	[reply]
Re: Match Algorithm: How close of a match by Fletch (Bishop) on Aug 17, 2010 at 15:43 UTC
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.	[reply]
Re: Match Algorithm: How close of a match by jethro (Monsignor) on Aug 17, 2010 at 15:50 UTC
Usually the levenshtein distance is used for this. Search CPAN for the name and you will find Text::Levenshtein and Text::LevenshteinXS. And there are other algorithms, Text::WagnerFischer and Text::PhraseDistance	[reply]
Re: Match Algorithm: How close of a match by planetscape (Chancellor) on Aug 17, 2010 at 18:25 UTC
I believe there are also many interesting links referenced in Brainstorming session: detecting plagiarism. HTH, planetscape	[reply]
Re: Match Algorithm: How close of a match by afoken (Chancellor) on Aug 17, 2010 at 20:32 UTC
A negated hint: Don't use soundex. At least not until you know your input fits into the very narrow scope of the soundex algorithm. Alexander -- Today I will gladly share my knowledge and experience, for there are no sweeter words than "I told you so". ;-)	[reply]
Re: Match Algorithm: How close of a match by Ratazong (Monsignor) on Aug 18, 2010 at 06:51 UTC
You may also be interested in the following thread: Fuzzy text matching... again, especially in the node by Limbic~Region. HTH, Rata	[reply]

Back to Seekers of Perl Wisdom