Reputation
5,210
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
9 42 92
Impact
~763k people reached

Oct
21
comment Definition of a Software bug. Blizzard Entertainment insists that my “bug” is not a bug at all. Are they right?
@TeleShoTTgun: I consider it a bug within in the chatting use cases, I've replied on the forum. Also, I've seen other times that the match results broke unrelated to your issue so there definitely is a bug in the code that is prone to broken connections. Doing a soft reconnect at the start and the end of the match would be an easy solution that fixes numerous problems...
Oct
3
awarded  Nice Question
Sep
30
revised What does SVN do better than Git?
https://code.google.com/p/tortoisegit/, https://code.google.com/p/msysgit/, if it's less supported please explain why. Also, bold and italic all over is annoying to read... :)
Sep
30
awarded  Popular Question
Sep
29
revised Tabs versus spaces—what is the proper indentation character for everything, in every situation, ever?
added 1 characters in body
Sep
29
comment Tabs versus spaces—what is the proper indentation character for everything, in every situation, ever?
@insta: Ye pirates make insta kills with yer mighty swords, I'm dead serious.
Sep
18
comment Should a software developer carry business cards?
A more digital up-to-date alternative is to send a Contact Card between mobiles using Bluetooth; but, you'll have to enable Bluetooth first and it's not widely used by people... ^^
Sep
18
revised Should a software developer carry business cards?
Split paragraphs, linkified things (some) people might not know, corrected GutHub --> GitHub.
Sep
15
awarded  Nice Question
Sep
15
awarded  Nice Question
Sep
10
awarded  Yearling
Aug
23
awarded  Good Question
Aug
23
awarded  Nice Question
Aug
21
awarded  Notable Question
Aug
18
comment How do I cluster strings based on a relation between two strings?
+1 Excellent answer. For the cosine distance function, do I just need to make two vectors where I use 1 if a word exists and 0 if it does not exist? An implementation I could see is to sort both strings by lexical order and then add a 1 if it exists and a 0 if it does not exist. Or can I somehow base myself on existing pairs of which it knows they are already duplicate? Or would that be too inefficient?
Aug
18
comment How do I cluster strings based on a relation between two strings?
+1 Found the PDFs but I found them to include too much mathematical information and statistics (based on pictures rather than text) that kind of sets me back, it's nice to know it's called that way though.
Aug
18
accepted How do I cluster strings based on a relation between two strings?
Aug
17
awarded  Favorite Question
Aug
15
comment How do I cluster strings based on a relation between two strings?
Glad that you see it, sometimes there are those beneficial details we don't come up with at first... :(
Aug
15
comment How do I cluster strings based on a relation between two strings?
The problem is realistic, it's not really hard to figure out that weather really cold raining shares three words with weather really cold today and good music radio station shared none. Again, I don't care about the actual meaning or interpretation of the sentence, if it were negated it would still be a duplicate because it is about the same topic. Sorry that my example was not clear enough, I should have mentioned "word occurrence" as that is what makes "I see the sunshine outside" the least relevant.