18. A method as described in claim 17 , wherein the graph-intersection proximity metric of two said semantic graphs g 1 and g 2 includes: Finding, using an intersection heuristic, an informative graph, called gl *g 2 , that subsumes both a sub graph of gl and a subgraph of g 2 , wherein the informative graph's informativeness is directly related to the precision of the semantic objects it contains; and dividing an aggregate specificity of the informative graph gl *g 2 by an aggregate specificity of gl and g 2 .
17. A method as described in claim 13 , wherein the clustering further comprises clustering that is performed at least in part through the use of a graph intersection proximity metric.