• From: Bill dehOra <BdehOra@i...>
• To: 'Peter Jones' <peterj@w...>,"'xml-dev@l...'" <xml-dev@l...>
• Date: Wed, 31 Jan 2001 15:10:19 +0000

:Please specify in more detail what you mean by graph distance.

How many hops you have to make to travel from one node to another, assuming
you actually have a path between them. In this case you're linking two term
definitions across across which imply term equivalence. My concern was that
if two definitions are far apart, the equivalence is weakened (Thanks to Len
for "semantic drift" and recalling a large chunk of my memory, I forgot that
one *completely*: <http://www.google.com/search?q=semantic+distance>).

Bill

--
Bill de hÓra  :  InterX  :  bdehora@i...

• Prev by Date: Re: Are we losing out because of grammars? (Re:Schemaambiguitydetection algorithm for RELAX (1/4))
• Next by Date: RE: Are we losing out because of grammars? (Re: Schema ambiguitydetection algorithm for RELAX (1/4))
• Previous by thread: RE: Are we losing out because of grammars? (Re: Schema ambiguitydetection algorithm for RELAX (1/4))
• Next by thread: RE: Are we losing out because of grammars? (Re: Schema ambiguitydetection algorithm for RELAX (1/4))
• Index(es):
  • Date
  • Thread