argusdusty
- Karma
- 16
- Created
- February 4, 2012 (14y ago)
- Submissions
- 0
Software Engineer at Google
Graduated with a Physics/Math double major from UC Berkeley May 2014.
www.github.com/argusdusty
Graduated with a Physics/Math double major from UC Berkeley May 2014.
www.github.com/argusdusty
I did say "requiring quadratic memory from every word." I'm not sure you can really call that linear - it's O(n m^2), where n is the number of words, and m is the average word length. It's not the O(n m) that Ferret…
Because a trie works great for prefix searches, but we want substring searches, so we'd have to modify the trie to be more like a suffix tree, in it's simplest form inserting each possible suffix into the trie and doing…
This is a good idea :) I'll probably add in a module for phonetic matching when I get the time.
Thanks for the heads-up. It should be working now.
The $150 per month includes several other servers we run. The server running our core app backend costs under half that, and handles our requirements just fine. Spending another $80 per month to save me development time…
Author here: They are unrelated. We did take the time to examine writing our own full search engine based on Lucene, like the aforementioned search library. The reasons why we didn't are briefly mentioned in the blog…