Fuzzy string matching algorithm in Python
<p>I'm trying to find some sort of a good, fuzzy string matching algorithm. Direct matching doesn't work for me — this isn't too good because unless my strings are a 100% similar, the match fails. The <a href="http://en.wikipedia.org/wiki/Levenshtein_distance">Levenshtein</a> method doesn't work too well for strings as it works on a character level. I was looking for something along the lines of word level matching e.g.</p>

<blockquote>
  <p>String A: The quick brown fox.</p>
  
  <p>String B: The quick brown fox jumped
  over the lazy dog.</p>
  
  <p>These should match as all words in
  string A are in string B.</p>
</blockquote>

<p>Now, this is an oversimplified example but would anyone know a good, fuzzy string matching algorithm that works on a word level.</p>

<p>Thanks in advance.</p>
