## 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.

This entry was posted on Wednesday, August 29th, 2012 at 6:00 am and is filed under LD #24. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.