Algorithm explained: Levenshtein edit di ...

Algorithm explained: Levenshtein edit distance

Oct 26, 2020

A little while ago I finished my bachelor's thesis about audio text alignment and stumbled upon the Needleman-Wunsch algorithm. This algorithm, together with its cousin, the Smith-Waterman algorithm, are both used in bioinformatics, but can also be used in NLP. One example is the Levenshtein edit distance: It counts the number of necessary edits to one string to transform it into another.

In this post I will explain how the algorithm works in detail and do a practical example with PHP.

Read the full article on!

Enjoy this post?

Buy Pascal Thormeier a coffee

More from Pascal Thormeier