User talk:Dingowolf

From Rosetta Code

Somehow, I missed greeting you before. I see you've been contributing on and off for over a year, though. :) Welcome to Rosetta Code! I'm Mike, and I noticed you created an account.

Some quick things you should be aware of:

Template:Mylang Helps you show what languages you're familiar with, and helps us become aware of skills with languages we haven't seen.
Category:Unimplemented tasks by language A place to find tasks missing solutions in various languages.
Blogs, twitter, facebook... We have them, and are interested in yours.
Special:Webchat Logs you into #rosettacode on the Freenode IRC channel. Not usually the most active communications medium, but occasionally helpful. It's logged at
Rosetta Code:Village Pump A general Q/A and discussion area.
Rosetta Code:Finances For most of Rosetta Code's history, expenses have been paid out of my pocket. I can't afford that much longer, and so you can see the state of Rosetta Code's finances, and how you may help. If you enjoy or are excited about the site, please consider reading through it.

Sorry for the boilerplate; it can be a bit difficult giving an individual greeting to each person. If you post information about your technical interests and background, I'll probably read it. If you already have put that kind of information on your user page, I probably already have; I'm always interested in how people do and can benefit from Rosetta Code.--Michael Mol 14:14, 14 October 2010 (UTC)

Hi, I'm the same person as Badmadevil, sorry for not acknowledged that. dingowolf 15:05, 14 October 2010 (UTC)
Ah. Good to see you again! I thought we lost you when RC was blocked by a national firewall. Good to know it isn't any longer. --Michael Mol 15:12, 14 October 2010 (UTC)
This firewall? Not really, I live in Hong Kong, which is pretty free of internet censorship due to one country, two systems. Moreover, I don't think rosetta code is blocked (at least not totally). The cause of my absence is a personal issue that I can't connect to internet for a while :) dingowolf 16:23, 14 October 2010 (UTC)
Ah. Rosetta Code was blocked for a time, and it happened to coincide with the beginning of your absence. In any case, welcome back! --Michael Mol 16:27, 14 October 2010 (UTC)

Levenshtein distance, recursive D solution

Did you test it with both of the test cases I listed in the broken Java version? Did you change the algorithm at all? What did i do wrong? --Mwn3d 01:18, 13 January 2011 (UTC)

I test the recursive version with D library Levenshtein distance function, it pass some short random string samples. I think my algorithm is almost the same as yours, except :
  1. I don't use the hash/dict mem, it seems not need;
  2. The insertion should be from both left and right direction, and each direction should have 1 plus length of shorter string numbers of insertions/candidates, eg. if input are "ab", "12345",
  • the left-insert candifates are : 1ab, a2b, ab3,
  • the right-insert candifates are : ab5, a4b, 3ab.
But I can't test long strings input, it cost a lot of time.
bye :) dingowolf 04:00, 13 January 2011 (UTC)
Good thoughts. The "mem" thing was leftover from me trying to memoize it. It also helped debug some earlier problems. I'll try out your suggestions eventually and see what happens. Thanks. --Mwn3d 04:22, 13 January 2011 (UTC)