Fast, memory efficient Levenshtein algorithm

Sten Hjelmqvist

Rate me:

4.76/5 (34 votes)

26 Mar 2012CPOL5 min read

219.8K

6.1K

A version of the Levenshtein algorithm that uses 2*Min(StrLen1,StrLen2) bytes instead of StrLen1*StrLen2 bytes.

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

29 Jun 2012Horatiu-Andrei Stoianovici

This is an alternative for "Fast, memory efficient Levenshtein algorithm"

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Written By

Sten Hjelmqvist

Software Developer (Senior) SEB bank

Sweden

I work as a developer in the 'Risk control' department at SEB bank in Stockholm,Sweden and I have been designing software since the early 80's.