@Mark, yeah, I meant using the bottom-up approach and passing that matrix as the accumulator. (I thought that I remembered seeing such an implementation in the goopy library, but when I looked today I didn't find any lev implementation at all.)
@Christian, yes, I missed the point of your question. When I hear the words "stack overflow" I reach for recur. On Mar 23, 1:32 am, Christian Schuhegger <christian.schuheg...@gmail.com> wrote: > Actually Mark is right. My point is not about the Levenshtein > distance. I've even found a quite nice and concise implementation here > on the list a few weeks ago: > "generic (works for any seq) levenshtein > distance"https://groups.google.com/group/clojure/browse_frm/thread/c5da3ac1b67... > > My point is about what the subject says: deep recursion, CPS, > trampolining and memoization. > > My question is: how to do that in idiomatic clojure in general? -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
