Timeline for Efficient map data structure supporting approximate lookup
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 22, 2016 at 17:18 | comment | added | BlueRaja - Danny Pflughoeft | Fast and Easy Levenshtein distance using a Trie | |
| May 26, 2012 at 17:16 | history | tweeted | twitter.com/#!/StackCompSci/status/206433603012403201 | ||
| May 26, 2012 at 16:54 | answer | added | Sasho Nikolov | timeline score: 20 | |
| May 26, 2012 at 14:44 | comment | added | Raphael | Closely related to the point of being an almost-duplicate: Efficient data structures for building a fast spell checker | |
| May 26, 2012 at 14:41 | history | edited | Raphael |
edited tags
|
|
| May 26, 2012 at 14:23 | answer | added | Juho | timeline score: 13 | |
| May 26, 2012 at 13:48 | comment | added | merijn | mrm, as far as I can tell BK-trees still look at quite a large portion of the entire tree. But that might be premature optimisation on my side, I guess? | |
| May 26, 2012 at 13:46 | history | edited | Juho | CC BY-SA 3.0 |
added link
|
| May 26, 2012 at 13:41 | history | edited | merijn | CC BY-SA 3.0 |
added 373 characters in body
|
| May 26, 2012 at 13:26 | comment | added | edA-qa mort-ora-y | Are there any conditions on the input string, and the size of the number of items in the map? How efficient does insertion to the map have to be? | |
| May 26, 2012 at 13:11 | history | asked | merijn | CC BY-SA 3.0 |