creichenbach

6 ms·

31.
by creichenbach 9y ago
I don't understand; what do you mean?
32.
by creichenbach 9y ago
Stemming is similar, but probably wouldn't help solving our problem because we're potentially dealing with word fragments shorter than a stem. Also, we're feeding the search query into a neural network, so we need to create a
33.
by creichenbach 9y ago
Yeah, Levenstein distance is pretty close to our goal metric of "similarity". The thing is that we're feeding the search query into a neural network, hence we need some kind of vector represenation.
34.
by creichenbach 9y ago
Ah, so we'd divide our word (fragment) into parts and treat the parts like words for usage with CBOW or skipgram?
35.
by creichenbach 9y ago
Only tangentially related, but we've recently tried to find an encoding of text that's "stable" with regards to it's characters (as opposed to stable wrt semantic meaning as here). That is, similar words (or fragmen
36.
Show HN: Simple drawing board made in pure HTML/CSS(jsfiddle.net)
2 points by creichenbach 9y ago|0 comments
37.
by creichenbach 9y ago
Same here. Every message (including sign-on/-off) creates a node in the DOM tree that never gets removed. That's about 15-20 per second at the moment, so this might cause the eventual crash.
38.
by creichenbach 9y ago
For those feeling adventurous: Input[1] is a proportional font made for coding. It's also highly customizable. [1]: http://input.fontbureau.com
39.
Show HN: AudioMerge – Merge music collections and resolve duplicates(cedricreichenbach.github.io)
2 points by creichenbach 10y ago|0 comments