title: Levenshten automata with weights
body: <p>I'm looking for an algorithm (and it's implementation on c#) for fast fuzzy string search in a dictionary. So far I found a method called Levenshtein Automata (described <a href="http://blog.notdot.net/2010/07/Damn-Cool-Algorithms-Levenshtein-Automata" rel="nofollow">here</a>). It seems very simular to what I need. But I would like to give different weights for different errors. Say it's common to confuse <code>s</code> and <code>c</code> so weight for such an error would be small. Also it would be nice to be able to take into account multiple-letters errors such as  <code>s</code> -> <code>ph</code> and so on.
  It there an algorith described such things?</p>