A lexon reuse mechanism for scalable ontology base expansion

    Background

    The Ontology Base can be interpreted as a universal reusable set of building blocks for ontologies. The problem here is: how to construct this practically?

    Apprenticeship / thesis

    The aim is to develop a CASE tool, within the framework of the DOGMA Server, that aids the ontology engineer with adding lexons to the ontology base. This expansion, however, should be well controlled; so the key requirement of the tool is that it should motivate reuse of lexons already residing in the ontology base and demotivate arbitrary creation of lexons. For each candidate lexon it should be analysed if there is an extant lexon in the base that can be reused for it. This can be (partly) achieved by consulting the DOGMA Concept Definition Server and applying several heuristics that analyse possible "equivalence" between lexons (e.g., Porter stemming algo, longest common substring, Hamming, etc.). Validation of your algorithm naturally follows.

    Environment

    Java / Eclipse platform

    Required skills

    Notion of data semantics.

    Contact

    Pieter De Leenheer