Anonymous user
User talk:Dingowolf: Difference between revisions
→Levenshtein distance, recursive D solution: Thanks
m (greeting :)) |
|||
| (5 intermediate revisions by 3 users not shown) | |||
Line 1:
Somehow, I missed greeting you before. I see you've been contributing on and off for over a year, though. :)
{{User:Short Circuit/new user greeting}}--[[User:Short Circuit|Michael Mol]] 14:14, 14 October 2010 (UTC)▼
:Hi, I'm the same person as [[User:Badmadevil|Badmadevil]], sorry for not acknowledged that. [[User:Dingowolf|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. --[[User:Short Circuit|Michael Mol]] 15:12, 14 October 2010 (UTC)
::: This [[wp:Golden_Shield_Project|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 :) [[User:Dingowolf|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! --[[User:Short Circuit|Michael Mol]] 16:27, 14 October 2010 (UTC)
== Levenshtein distance, recursive D solution ==
▲{{User:Short Circuit/new user greeting}}--[[User:Short Circuit|Michael Mol]] 14:14, 14 October 2010 (UTC)
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? --[[User:Mwn3d|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 :
:#I don't use the hash/dict '''mem''', it seems not need;
:#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 : '''1'''ab, a'''2'''b, ab'''3''',
:::*the right-insert candifates are : ab'''5''', a'''4'''b, '''3'''ab.
:But I can't test long strings input, it cost a lot of time.
:bye :) [[User:Dingowolf|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. --[[User:Mwn3d|Mwn3d]] 04:22, 13 January 2011 (UTC)
| |||