Method and system for comparing document versions encoded in a hierarchical representation

3. The method of claim 2, wherein the first and second search sequences are depth first search sequences.

4. The method of claim 2, wherein the first and second search sequences are breadth first search sequences.

6. The method of claim 5, wherein the resynchronization process is to determine whether at least one element of the content corresponding to the third node is an automatic numbering code and in dependence thereon, render the numbering and compare the numbering result to the content corresponding to the fourth node.

7. The method of claim 5, wherein the resynchronization process is applied to a DOCX type document, and further comprising determining whether the reference data object for the first hierarchy is at the start of a field and the reference data object for the other hierarchy is at a ‘field start instruction node’ and, in dependence on the determination, moving the first reference data object to the end of the field and the second reference data object to after the ‘field end node,’ respectively.

8. The method of claim 5, wherein the resynchronization process is to determine correspondences between field objects comprising the content corresponding to the respective first and second nodes in the respective first and second hierarchies and allowing special characters comprising the content corresponding to one node to be matched to their corresponding field object corresponding to the other node.

9. The method of claim 5 wherein the resynchronization process is to test the match between a next predetermined number of characters associated with each corresponding first and second node on a character by character basis with varying offsets in order to determine an offset value with the best possible match and then adjust the position of the first and second reference data objects to refer to a third and fourth nodes using the determined offset value.

10. A computer system comprised of at least one central processing unit and one mass data storage device and computer memory, said computer memory comprised of data representing a series of instructions that when executed by the central processing unit causes the computer system to perform the method claimed by claim 1.

11. A non-transitory computer readable media comprised of data representing a series of instructions that when executed by a computer system, causes it to perform the method claimed by claim 1.

12. The method of claim 1 further comprising: tracking the location of a content move change in a content move source comprising the first hierarchy by updating the location of the second reference data object corresponding to the second hierarchy to a reference of position within a move change destination that corresponds to the location of the move source in the first hierarchy.

13. The method of claim 1, wherein the first and second representations are data files of two different document encoding types.

14. The method of claim 1, wherein at least one node in the second hierarchy is comprised of a location data that represents a desired position for a text corresponding to the location data to appear when the second representation is displayed.

17. The system of claim 16 wherein the first and second search sequences are depth first search sequences.

18. The system of claim 16, wherein the first and second search sequences are breadth first search sequences.

20. The system of claim 15, wherein the first and second representations are data files of two different document encoding types.

21. The system of claim 15, wherein at least one node in the second hierarchy is comprised of a location data that represents a desired position for a text corresponding to the location data to appear when the second representation is displayed.