shadox,
Take a look at this node posted yesterday, though Text::Levenshtein is usually the standard answer.
I would do something like the following:
Set a maximum threshold, so if the closest match exceeded this threshold it would be set aside for human interaction
Iterate over each state calculating the similarity distance and select the shortest distance
Set aside for human interaction any match between two states that was close, perhaps only by a distance of 1
Write a log for changes until you feel confident/comfortable it is doing the right thing
Cheers - L~R
-
Are you posting in the right place? Check out Where do I post X? to know for sure.
-
Posts may use any of the Perl Monks Approved HTML tags. Currently these include the following:
<code> <a> <b> <big>
<blockquote> <br /> <dd>
<dl> <dt> <em> <font>
<h1> <h2> <h3> <h4>
<h5> <h6> <hr /> <i>
<li> <nbsp> <ol> <p>
<small> <strike> <strong>
<sub> <sup> <table>
<td> <th> <tr> <tt>
<u> <ul>
-
Snippets of code should be wrapped in
<code> tags not
<pre> tags. In fact, <pre>
tags should generally be avoided. If they must
be used, extreme care should be
taken to ensure that their contents do not
have long lines (<70 chars), in order to prevent
horizontal scrolling (and possible janitor
intervention).
-
Want more info? How to link
or How to display code and escape characters
are good places to start.
|