Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
kmike84
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
34 ms
·
151.
▲
by
kmike84
14y ago
This article may give a false impression that more complex models are better than less complex, and the only issue with complex models is that they require more computations. This is misleading and there should really be emphasis on bias-va
152.
▲
by
kmike84
14y ago
a minor remark: with the current `dawg` module implementation this should be import dawg with open('/usr/share/dict/words','r') as f: words = (w.strip() for w in f) d = dawg.DAWG(words, input_is_sorted=True)
153.
▲
by
kmike84
14y ago
I think the point of using data structures like DAWG is to reduce the memory consumption to the point it is feasable to store the whole dataset in memory. Practical DAWG application would be the following anyway: import dawg d = d
154.
▲
by
kmike84
14y ago
Well, nothing prevents this to be a 3-5 lines of Python with more suitable data structures: $ pip install dawg and then import dawg words = open('/usr/share/dict/words', 'r').read().splitlines() d = dawg.DAWG(words)
155.
▲
by
kmike84
14y ago
The compression of a trie may not be the best because of the node storage requirement. I've benchmarked the memory usage of some Python trie libraries here: http://kmike.ru/python-data-structures/ I also tried to compress "/usr/share/dict
156.
▲
by
kmike84
14y ago
Does DAWG really provide more sophisticated searches than a trie being basically a minimized automata for the trie?
157.
▲
by
kmike84
14y ago
In practice this mean that Linode offers 512MB RES/RSS memory (+swap) and Edis offers 512MB VIRT memory. VIRT memory limiting is very a serious issue for some software. For example, apache may use 10x VIRT memory because it is threads-based
158.
▲
by
kmike84
14y ago
For me the experience of managing open source repositories gets worse with recent bitbucket updates to the point that I'm in process of moving my open-source to github. How one is supposed to find what have bitbucketer done? Visit e.g. Ian
159.
▲
Fast Non-Standard Data Structures for Python
(kmike.ru)
2 points
by
kmike84
14y ago
|
0 comments
160.
▲
Memory-wise & fast trie for Python (may use 50x-100x less memory than dict)
(github.com)
4 points
by
kmike84
14y ago
|
0 comments