Edit Distance

Two types of edit distance quantify the cost to transform between two strings. The Hamming distance gives the number of disagreements between words, usually of the same length. The Levenshtein distance is the number of one-element changes (adding, deleting, or substituting) needed to go from one word to the other.

(62 lines omitted)
comments
 
Powered by Wolfram Mathematica
Give us your feedback
Give us your feedback

Source page:




 often  occasionally  never

Note: Please do not include anything you consider confidential or proprietary. Your message and contact information may be shared with the author of any specific Demonstration for which you give feedback, but will not otherwise be published or distributed.
Privacy Policy »

Note: To run this Demonstration you need the free
Mathematica Player
or Mathematica 7+
Download or upgrade to Mathematica Player 7
I already have Mathematica Player or Mathematica 7+