2
$\begingroup$

I am looking for an extension for Levenshtein distance (Edit distance) for multi dimensional strings (2D and 3D). I am not sure if there is a formal definition for multi dimensional or not, but here is what I am talking about:

1-D string: is the regular string

2-D string: is something like a list of 1-D strings like

dfdsfdsfdsf
dsffgdfdgfdsdaf
dsfdsf
fdgfdgfdg

N-D string: is list of (N-1)-D strings

$\endgroup$
  • 1
    $\begingroup$ I am not sure what you are asking about? $\endgroup$ – Jeremy Sep 14 '13 at 9:55
  • 3
    $\begingroup$ Voting to close as unclear. Why do you want such an extension? $\endgroup$ – Jeffε Sep 14 '13 at 13:57
  • 3
    $\begingroup$ What do you want to extend it to? To the distance between such lists? What do you say that distance would be? $\endgroup$ – reinierpost Sep 14 '13 at 14:04
  • 2
    $\begingroup$ A related (but more precise) question: stackoverflow.com/questions/16399597/… $\endgroup$ – J.-E. Pin Sep 14 '13 at 14:06
  • 1
    $\begingroup$ Thanks for your comments. I want to use this distance in Kernel machine for learning some structure. In my problem, I need to model Location and Words simultaneously. I think the edit distance for Graphs can be modified for my application $\endgroup$ – iampat Sep 16 '13 at 21:35

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.