<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.2800.1276" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face=Arial size=2><FONT face="Times New Roman" size=3>Step 1. Use an
ontology in OWL format to determine which tags are related<BR>and how related
they are.<BR><BR>Any idea how this could be done? anyone? I searched the
internet for<BR>information on the OWL format, didn;t find very
much...<BR><BR>Grtz, Joachim.<BR><BR><BR>----- Original Message ----- <BR>From:
"Mike Brenner" <</FONT><A href="mailto:mikeb@mitre.org"><FONT
face="Times New Roman" size=3>mikeb@mitre.org</FONT></A><FONT
face="Times New Roman" size=3>><BR>To: "J. Albers" <</FONT><A
href="mailto:jalbers@cs.uu.nl"><FONT face="Times New Roman"
size=3>jalbers@cs.uu.nl</FONT></A><FONT face="Times New Roman" size=3>>;
<</FONT><A href="mailto:jdom-interest@jdom.org"><FONT face="Times New Roman"
size=3>jdom-interest@jdom.org</FONT></A><FONT face="Times New Roman"
size=3>><BR>Sent: Wednesday, January 28, 2004 2:01 PM<BR>Subject: Re:
[jdom-interest] fusing xml files<BR><BR><BR>> Step 1. Use an ontology in OWL
format to determine which tags are related<BR>and how related they are.<BR>>
Step 2. Weight each of the relationships (arrows) in the ontology) with
a<BR>number.<BR>> Step 3. Create a semantic distance metric by walking the
OWL tree, adding<BR>up the<BR>> weights of the branches you must travel to
get from each tag to each other<BR>tag.<BR>> Step 4. Sort the tag pairs in
reverse order of increasing semantic<BR>distance.<BR>> Step 5. Use JDOM to
read the first xml file into a HashMap of HashMaps of<BR>HashMaps.<BR>> Step
6. Same for the second xml file.<BR>> Step 7. Using the tag pair with the
least semantic weight (closest<BR>distance to each other),<BR>> ask the
user's permission to merge that pair. If given, carry out a simple<BR>>
recursive merge loop (use the algorithm in Dijkstra's Discipline
of<BR>Programming<BR>> for the merge loop, and recursively walk all the
children of the HashMap<BR>of HashMaps<BR>> for the recursive part) to bring
together those tags.<BR>> Step 8. Continue through all the tag
pairs.<BR>><BR>> > "J. Albers" wrote:<BR>> > What i'm trying to
make is some application that takes 2 XML files and<BR>tries to fuse them
together semi-automatically. So the elements that are the<BR>same get fused
right away, and then the rest of the elements from the files<BR>is listed, and
one can select the elements that are the same but have<BR>different names in
different files and fuse
them.<BR>><BR>></FONT><BR></FONT></DIV></BODY></HTML>