1 / 9

Edit Distance

Learn how to compute the minimum total cost of basic operations (delete, insert, substitute) to convert one string to another using Edit Distance. Discover Dynamic Programming solutions and visualize problems as path finding. Practice with a 3-step formula quiz and table filling exercises. Download the Machine Learning Toolbox to run editDistance in MATLAB for precise results. Understand boundary conditions and layer-by-layer filling techniques for efficient computation. Master Edit Distance solutions through guided exercises.

mwilford
Download Presentation

Edit Distance

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Edit Distance 張智星 (Roger Jang) jang@mirlab.org http://mirlab.org/jang 多媒體資訊檢索實驗室 台灣大學 資訊工程系

  2. Edit Distance • Edit distance • The minimum total cost of the basic operations (delete with cost 1, insert with cost 1, substitute with cost 2) that are required to convert a string into another. • Used in “diff” command of unix.

  3. DP for Edit Distance: 3-step Formula Quiz!

  4. DP for Edit Distance: Table Filling (1/2) • All DP problems can be visualized as path finding…

  5. DP for Edit Distance: Table Filling (2/2) • To create this plot • Download Machine Learning Toolbox • Run editDistance('prosperity', 'properties', [2 1 1], 1) under MATLAB • A 45-degree back-tracking path indicates a “substitute” or “equal”.

  6. DP for Edit Distance: Table Filling • Hints • Create a (m+1)*(n+1) matrix for table filling • Fill row 0 and column 0 first to establish the base cases of boundary conditions • Fill all the other elements in a layer-by-layer manner.

  7. DP for Edit Distance: Solution

  8. Exercise

  9. Solution

More Related