I have two partitions of $[1 \ldots n]$ and am looking for the edit distance between them.
By this, I want to find the minimal number of single transitions of a node into a different group that are necessary to go from partition A to partition B.
For example the distance from {0 1} {2 3} {4}
into {0} {1} {2 3 4}
would be two
After searching I came across this paper, but a) I am not sure if they are taking into account the ordering of the groups (something I don't care about) in their distance b) I am not sure how it works and c) There are no references.
Any help appreciated