Use Demarau-Levenshtein for this purpose :) On Tue, May 24, 2011 at 10:24 PM, Akshata Sharma <akshatasharm...@gmail.com>wrote:
> what changes should we make in the edit distance algorithm to include the > swapping of adjacent elements so as to get min edit distance? > > eg. "pantera" can be converted into "aorta" by 4 edits. > "pantera” >>> “antera” >>> “antra” >>> “aotra” >>> “aorta” > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- -Aakash Johari (IIIT Allahabad) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
