title: Levenshtein Distance/string matching algorithm for phrases
body: <p>I have two spreadsheets that each give information about a bunch of applications running on my work's network. They were created by two separate people, who never ever seemed to correspond.</p>
  
  <p>As a result, the names they have given the applications are not constant between sheets. They are, however, similar. For example, one might call an application "Office 2010", the other "MS Office 10" or something.</p>
  
  <p>I have looked up the Levenshtein algorithm, but this seems to apply only to single words or phrases where the word order is constant, and only the spelling differs. (I am not a computer scientist; feel free to correct me on this).</p>
  
  <p>Therefore I am looking for an algorithm that, for each name in one sheet, can cycle through every name in the other sheet and find the closest match. Doesn't have to be perfect, anything will help.</p>
  
  <p>Any ideas? Thanks to all who can help out.</p>