com.articulate.sigma

Class Mapping

java.lang.Object

com.articulate.sigma.Mapping

public class Mapping
extends java.lang.Object

This code is copyright Articulate Software (c) 2004. This software is released under the GNU Public License . Users of this code also consent, by use of this code, to credit Articulate Software in any writings, briefings, publications, presentations, or other representations of any software which incorporates, builds on, or uses this code. Please cite the following article in any publication with references: Pease, A., (2003). The Sigma Ontology Development Environment, in Working Notes of the IJCAI-2003 Workshop on Ontology and Distributed Systems, August 9, Acapulco, Mexico.See also http://sigmakee.sourceforge.net This class maps ontologies. It includes embedded subclasses that implement specific mapping heuristics. This class also includes utilities for converting other ad-hoc formats to KIF

Field Summary

Fields

Modifier and Type	Field and Description
static java.util.TreeMap<java.lang.String,java.util.TreeMap<java.lang.Integer,java.lang.String>>	mappings
static char	termSeparator

Constructor Summary

Constructors

Constructor and Description
Mapping()

Method Summary

Modifier and Type	Method and Description
static void	convertYAGO(java.lang.String file, java.lang.String relName) Convert a YAGO file into KIF
static int	getJaroWinklerDistance(java.lang.String s1, java.lang.String s2) Jaro-Winkler Mapping Method implemented by Gerard de Melo
static int	getLevenshteinDistance(java.lang.String s, java.lang.String t) LevenshteinDistance(char s[1..m], char t[1..n]) courtesy of Wikipedia http://en.wikipedia.org/wiki/Levenshtein_distance int LevenshteinDistance(char s[1..m], char t[1..n])
static int	getSubstringDistance(java.lang.String term1, java.lang.String term2) Substring Mapping Method: returns 1 if the two strings are identical, scores >1 if one string is a substring of the other, and Integer.MAX_VALUE if there is no substring match This approach is based on: John Li, "LOM: A Lexicon-based Ontology Mapping Tool", Proceedings of the Performance Metrics for Intelligent Systems (PerMIS.'04), 2004.
static java.lang.String	getTermFormat(KB kb, java.lang.String term) Get the termFormat label for a term.
static boolean	isValidTerm(java.lang.String term) check whether a term is valid (worthy of being compared)
static void	main(java.lang.String[] args) A test method.
static void	mapOntologies(java.lang.String kbName1, java.lang.String kbName2, int threshold, java.lang.String matchMethod) Map ontologies through 4 methods: (1) identical term names (2) substrings of term names are equal (3) terms align to words in the same WordNet synset (4) extra "points" for having terms that align with the same structural arrangement
static java.lang.String	merge(java.util.TreeSet cbset, java.lang.String kbname1, java.lang.String kbname2) rename terms in KB kbname2 to conform to names in kbname1
static java.lang.String	normalize(java.lang.String s) Normalize a string by replacing all non-letter, non-digit characters with spaces, adding spaces on capitalization boundaries, and then converting to lower case
static java.lang.String	writeEquivalences(java.util.TreeSet cbset, java.lang.String kbname1, java.lang.String kbname2) Write synonymousExternalConcept expressions for term pairs given in cbset.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

mappings

public static java.util.TreeMap<java.lang.String,java.util.TreeMap<java.lang.Integer,java.lang.String>> mappings

termSeparator

public static char termSeparator

Constructor Detail

Mapping

public Mapping()

Method Detail

writeEquivalences

public static java.lang.String writeEquivalences(java.util.TreeSet cbset,
                                                 java.lang.String kbname1,
                                                 java.lang.String kbname2)
                                          throws java.io.IOException

Write synonymousExternalConcept expressions for term pairs given in cbset. They are strings of the form [checkbox|subcheckbox]_[T_]name1-name2 There's a known bug when ontology terms contain dashes.

Returns:

error messages if necessary

Throws:

java.io.IOException

merge

public static java.lang.String merge(java.util.TreeSet cbset,
                                     java.lang.String kbname1,
                                     java.lang.String kbname2)

rename terms in KB kbname2 to conform to names in kbname1

Returns:

error messages if necessary

convertYAGO

public static void convertYAGO(java.lang.String file,
                               java.lang.String relName)
                        throws java.io.IOException

Convert a YAGO file into KIF

Throws:

java.io.IOException

getTermFormat

public static java.lang.String getTermFormat(KB kb,
                                             java.lang.String term)

Get the termFormat label for a term. Return only the first such label. Return null if no label.

mapOntologies

public static void mapOntologies(java.lang.String kbName1,
                                 java.lang.String kbName2,
                                 int threshold,
                                 java.lang.String matchMethod)

Map ontologies through 4 methods: (1) identical term names (2) substrings of term names are equal (3) terms align to words in the same WordNet synset (4) extra "points" for having terms that align with the same structural arrangement

isValidTerm

public static boolean isValidTerm(java.lang.String term)

check whether a term is valid (worthy of being compared)

normalize

public static java.lang.String normalize(java.lang.String s)

Normalize a string by replacing all non-letter, non-digit characters with spaces, adding spaces on capitalization boundaries, and then converting to lower case

getSubstringDistance

public static int getSubstringDistance(java.lang.String term1,
                                       java.lang.String term2)

Substring Mapping Method: returns 1 if the two strings are identical, scores >1 if one string is a substring of the other, and Integer.MAX_VALUE if there is no substring match This approach is based on: John Li, "LOM: A Lexicon-based Ontology Mapping Tool", Proceedings of the Performance Metrics for Intelligent Systems (PerMIS.'04), 2004. *** This is not yet fully implemented here ***

getLevenshteinDistance

public static int getLevenshteinDistance(java.lang.String s,
                                         java.lang.String t)

LevenshteinDistance(char s[1..m], char t[1..n]) courtesy of Wikipedia http://en.wikipedia.org/wiki/Levenshtein_distance int LevenshteinDistance(char s[1..m], char t[1..n])

getJaroWinklerDistance

public static int getJaroWinklerDistance(java.lang.String s1,
                                         java.lang.String s2)

Jaro-Winkler Mapping Method implemented by Gerard de Melo

main

public static void main(java.lang.String[] args)

A test method.