Statistical Matching of Two Ontologies

this paper, we investigate a simple statisticalmethod for matching two ontologies. The methodcan apply to any ontologies which are formulatedfrom is-a relationships. In our experiments, weused EDR and WordNet. This work is similar tothe work in (Utiyama and Hashida 1997). Theydefined the task as the MWM (Maximum WeightMatch) of bipartite graphs, an approach whichis basically common to most ontology matchingschemes. The information they used is partiallyfuzzy; i.e. for calculating the...