title: Levenshtein edit distance algorithm that supports Transposition of two adjacent letters in C#
body: <p>i'm searching for an algorithm for computing Levenshtein edit distance that also supports the case in which two adjacent letters are transposed that is implemented in C#. </p>
  
  <p>for example the word "animals"  and  "ainmals" :
  switching between the letters "n" and "i" 
  wont be scored as two replacements -which will make a big distance -
  but instead on will be scored as a transpose of two letters -much more less distance-</p>
  
  <p>what i reached so far in searching </p>
  
  <ul>
  <li><a href="http://www.dotnetperls.com/levenshtein" rel="nofollow noreferrer">computing Lichtenstein distance</a>  but it doesn't contain replacements</li>
  <li><a href="https://stackoverflow.com/questions/878114/is-there-an-edit-distance-algorithm-that-takes-chunk-transposition-into-accoun">this question</a> </li>
  </ul>