title: how to get a matching status of two string using Levenshtein distance
body: <p>is it possible to get a matching status from two compared strings, for example:</p>
  
  <pre><code>string 1 : this is a dog.
  string 2 : this is not a cat.
  </code></pre>
  
  <p>How do I generate the below string using Levenshtein distance, could anybody help?</p>
  
  <pre><code>string 1 : this is     a    dog.
  string 2 : this is not a cat   .
  Result   : ========++++==+++---=   &lt;&lt;&lt; like this.
  </code></pre>
  
  <p>I know a post has the solution that is what I need, but I have no permission to access the source code.
  Could anybody help please,any comments are appreciate.</p>