Interested in implementing list of list functionality? about edit-distance HOT 3 CLOSED

I'm not sure I understand your question. Could you elaborate?

from edit-distance.

Currently the algorithm works with list of list
['a','b',['c','d','e']] but it will treat the third list as one element that it can remove or substitute.

Would it be possible to consider elements and if it is a list, to be able to move it and add element to the inner list itself?

An example:
a : ['a','b',['c','d','e']]
b : ['a',['c','d'], 'b']

Instead of deleting the third element and adding ['c','d'] in the second position
You would move the third element to the second position and remove the inner element 'e'.
(I realize this would be a tie but sometimes it would be better to do the second approach)

Hopefully that makes sense, let me know what you think

from edit-distance.

I'm still not sure I completely understand. But it sounds like you're trying to compute the edit distance recursively? So the inner distance between [c d] and [c d e] is 1, and thus that's the substitution cost in the outer list. It seems like you could probably do that, by doing a recursion instead of just doing a regular identity comparison.

But, why do you want to? What's the problem you're trying to solve? Perhaps there's a better approach.

from edit-distance.