Perl-Sensitive Sunglasses | |
PerlMonks |
Match Algorithm: How close of a matchby zer (Deacon) |
on Aug 17, 2010 at 15:34 UTC ( [id://855527]=perlquestion: print w/replies, xml ) | Need Help?? |
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!
Back to
Seekers of Perl Wisdom
|
|