MATLAB and Simulink resources for Arduino, LEGO, and Raspberry Pi

Learn moreOpportunities for recent engineering grads.

Apply TodayInspired by the Cody problem found here.

The Levenshtein distance is a charater-based string metric used to measure the difference between two strings (for details, look here). In this problem, you need to implement a word-based version of the Levenshtein distance.

Given two strings, compute the minimum number of *word*-edits to transform one string into another. The allowable edits are insertion, deletion, or substitution of a single *word*. Assume words are case-insensitive. Contractions and hyphenated words are allowed, but you may ignore other punctuation.

**Example**

If

s1 = 'I do not like MATLAB' s2 = 'I love MATLAB a lot'

then

d = 4

because at least four edits are required to transform s1 into s2 (substitution on the last four words).

14 correct solutions
12 incorrect solutions

Last solution submitted on Nov 27, 2014

1 Comment

Tim
on 20 Jul 2012

With regexp assistance from 115643.

2 Comments