Class Absurdist provides the ABSURDIST II graph matching algorithms
to compute the correspondence between two concept systems, and
finds the optimal mappings between them.
How many achors do Concept i of this system and Concept iother
of the other system have in common? This can be used
in external similarity computations
Creates a concept system represented as a random graph,
categorized/randked/valued, directed/weighted/labeled as indicated,
with concepts of random categories and ranks, and randomly weighted/labeled relations.
The fv vector contained in each FeatureVectorConcept is
used to determine "distance" between concepts, instead
of the (d1,d2) pair in the parent Concept class.
Gets the requested value from the hash table or from the
Java system property aName
The Java system property, if given, overrides the value from the
hash table.
Create a system with a specified number of nodes and
"relation fulness", and its noisy copy with a specified noise
level; match them; repeat NRuns times.
Creates a hashtable that contains the parsed data
obtained from an open reader (which may, for example,
be associated with an open file), and then closes the
reader.