Levenshtein Distance (Part 2: Gotta Go Fast)

Read Original

This technical article is the second part of a series on the Levenshtein Distance algorithm. It starts with an unoptimized C# implementation and then details specific techniques to reduce memory overhead and increase computational speed, such as optimizing the required matrix storage.

Levenshtein Distance (Part 2: Gotta Go Fast)

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

No top articles yet