Using Google distance to weight approximate ontology matches

Risto Gligorov, Warner ten Kate, Zharko Aleksovski, Frank van Harmelen · 2007

Discovering mappings between concept hierarchies is widely regarded as one of the hardest and most urgent problems facing the Semantic Web. The problem is even harder in domains where concepts are inherently vague and ill-defined, and cannot be given a crisp definition. A notion of approximate concept mapping is required in such domains, but until now, no such notion is vailable.

Read the paper · More papers on PaperTik