Algorithms and optimisation

Posted by
August 29th, 2012 6:00 am

## 4pm (43 hours to go)

Researching algorithms around word changes. Levenshtein distances seem to be the big thing. I start wondering if I’ll run into speed issues with naively running through a whole dictionary (~50k words). I wish I was stronger at computer science — algorithms and data structures might be very relevant here. I wonder about trading off time for space, pre-calculating the nearest neighbours for all of the words.

A quick in-browser test seems that doing string matching over 50k words is quick enough to not notice. 500k is a bit slower but still doable. I guess I can start without optimizing.


Leave a Reply

You must be logged in to post a comment.

[cache: storing page]