3. The method of claim 2 , wherein the complementary information distance operation defines D min (x,y)=E min (x,y) that when executed yields an information distance between a first set of entities, and a second set of entities, that determines the most accurate entity by disregarding irrelevant information, where there may be irrelevant information in one or more of the sets, for the purpose of determining the most accurate entity.
3. The method of claim 2 , wherein the complementary information distance operation defines D min (x,y)=E min (x,y) that when executed yields an information distance between a first set of entities, and a second set of entities, that determines the most accurate entity by disregarding irrelevant information, where there may be irrelevant information in one or more of the sets, for the purpose of determining the most accurate entity. 5. The method of claim 3 wherein the information distance analysis operation, given Q and I, finds q such that it minimizes the sum of distances from Q to q, and q to I, thereby yielding the most accurate entity.