Re:Levenshtein Distance
by bryondowd on Thursday August 22, 2019 @08:22PM
(#20773620)
Can't think on a real word example, but abc would match bcd in the above algo, as both permute to bc, but they are distance 2. So, any case where one letter is deleted and another is added at a different position.
[ Parent
| on HN ]
Boat and Oats is a real world example with Levenshtein distance 2 that would pass through the algo
Re:Levenshtein Distance
by apendleton on Friday August 23, 2019 @10:52AM
(#20778230)
Yeah, that's the crux -- two different real words storing the same variant but having omitted different letters.
Re:Levenshtein Distance
by developer2 on Monday August 26, 2019 @10:24PM
(#20805795)
Haha, I knew the answer was going to be obvious, and it was so obviously obvious. Thanks for answering. :)