title: How do you implement Levenshtein distance in Delphi?
body: <p>I'm posting this in the spirit of answering your own questions.</p>
  
  <p>The question I had was: How can I implement the Levenshtein algorithm for calculating edit-distance between two strings, as <a href="http://en.wikipedia.org/wiki/Levenshtein_distance" rel="noreferrer">described here</a>, in Delphi?</p>
  
  <p>Just a note on performance:
  This thing is very fast.  On my desktop (2.33 Ghz dual-core, 2GB ram, WinXP), I can run through an array of 100K strings in less than one second.</p>