Hi Jens,
sorry for resuming this old discussion but I'm working on this right
now (when I started the discussion it was in an evaluation state).
Il giorno 17/lug/2009, alle ore 08.22, Jens Lehmann ha scritto:
>
> Hello,
>
> Piero Molino schrieb:
>> Hi Jens,
>>
> [...]
>
Is there some kind
Hello,
Piero Molino schrieb:
> Hi Jens,
>
[...]
>
> This remembers me of leacock chodorow measure used in my research lab
> for calculating semantic distance in wordnet. The fact that there's a
> class wich is a kind of root is a good thing for this. There's something
> alse like that i shou
Hi Jens,
Il giorno 15/lug/09, alle ore 17:04, Jens Lehmann ha scritto:
Hello Piero,
Piero Molino schrieb:
Hello everyone,
Now, i don't know where to start from for doing this (my software is
in java). Wich dump should i use? Anyone knows reliable opensource
libraries for managing owl (i nev
Hello Piero,
Piero Molino schrieb:
> Hello everyone,
>
> Now, i don't know where to start from for doing this (my software is
> in java). Wich dump should i use? Anyone knows reliable opensource
> libraries for managing owl (i never used it before so i'm really new
> to it)?
There are se
Hello everyone,
i start begging pardon if it's not the right place to ask this
anyway:
I'm developing a software that navigates dbpedia instances and returns
the node that satisfies certain requirements. Those requirements
incude the "topological" distance between the actual node and ano