{"author_name":"rjhunter","cat":"LD #24","comments":[],"epoch":1346238000,"likes":0,"metadata":{"p_key":"51638","p_author":"rjhunter","p_authorkey":"16057","p_urlkey":"87333","p_title":"Algorithms and optimisation","p_cat":"LD #24","p_event":"LD24","p_time":"1346238000","p_likes":"0","p_comments":"0","p_status":"UPD5","us_key":"16057","us_name":"rjhunter","us_username":"rjhunter","event_start":"1345766400","event_key":"12","event_name":"LD24"},"text":"<p>## 4pm (43 hours to go)<\/p>\n <p>Researching algorithms around word changes. Levenshtein distances seem to be the big thing. I start wondering if I&#8217;ll run into speed issues with naively running through a whole dictionary (~50k words). I wish I was stronger at computer science &#8212; 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.<\/p>\n <p>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.<\/p>","time":"August 29th, 2012 6:00 am","title":"Algorithms and optimisation"}