Package edu.iu.pcl.absurdist.absurdist

The main graph matching algorithm.

See:
Description

Class Summary

Absurdist	Class Absurdist provides the ABSURDIST II graph matching algorithms to compute the correspondence between two concept systems, and finds the optimal mappings between them.
Absurdist.Results	Used for reporting.
Concept	Class Concept specifies the data structure for a concept, which contains its name and some features.
ConceptSystem	Class ConceptSystem is the data model for a concept system specifying the semantic network between the concepts.
FeatureVectorConcept	This is a special subclass of Concept, in which each instance contains an internal feature vector used to compute external similarity.
FeatureVectorConcept.IVPair	An index-value pair; used as a component of fv.
Link	Node pair (i,j).
Relation	Class Relation Specifies the data structure for a relation, which contains its involved concepts and some features.
RelationModel	Class RelationModel is the model for a particular type of relation, including specifications on its inherent properties.

Package edu.iu.pcl.absurdist.absurdist Description

The main graph matching algorithm. Based on the "neural-net"-style ABSURDIST method described in this paper: Robert L. Goldstone, Brian J. Rogosky, "Using relations within conceptual systems to translate across conceptual systems". Cognition 84 (2002), 295-320.