[jdom-interest] fusing xml files

[Mike Brenner]

Step 1. Use an ontology in OWL format to determine which tags are related and how related they are.
Step 2. Weight each of the relationships (arrows) in the ontology) with a number.
Step 3. Create a semantic distance metric by walking the OWL tree, adding up the
	weights of the branches you must travel to get from each tag to each other tag.
Step 4. Sort the tag pairs in reverse order of increasing semantic distance.
Step 5. Use JDOM to read the first xml file into a HashMap of HashMaps of HashMaps.
Step 6. Same for the second xml file.
Step 7. Using the tag pair with the least semantic weight (closest distance to each other),
	ask the user's permission to merge that pair. If given, carry out a simple
	recursive merge loop (use the algorithm in Dijkstra's Discipline of Programming
	for the merge loop, and recursively walk all the children of the HashMap of HashMaps
	for the recursive part) to bring together those tags.
Step 8. Continue through all the tag pairs.

> "J. Albers" wrote:
> What i'm trying to make is some application that takes 2 XML files and tries to fuse them together semi-automatically. So the elements that are the same get fused right away, and then the rest of the elements from the files is listed, and one can select the elements that are the same but have different names in different files and fuse them.