US 7,542,969 B1
Domain knowledge-assisted information processing
Alain T. Rappaport, Woodside, Calif. (US); Dan Adamson, Dallas, Tex. (US); and Leo Shih, Palo Alto, Calif. (US)
Assigned to Microsoft Corporation, Redmond, Wash. (US)
Filed on Nov. 03, 2005, as Appl. No. 11/265,994.
Claims priority of provisional application 60/624558, filed on Nov. 03, 2004.
Claims priority of provisional application 60/677620, filed on May 04, 2005.
Claims priority of provisional application 60/723642, filed on Oct. 04, 2005.
Int. Cl. G06F 7/00 (2006.01); G06F 17/30 (2006.01)
U.S. Cl. 707—4  [707/6] 30 Claims
OG exemplary drawing
 
1. A method of searching for information, comprising:
receiving a query;
providing the query to a first search engine that searches a set of data sources, the data sources having relationships to at least one ontology, the ontology modeling relationships between concepts in a domain and data source content containing information specific to the concepts;
receiving search results from the search engine;
analyzing the search results with one or more processors to determine at least one statistic corresponding to the search results and the query, wherein the statistic is based upon a relevance score for each of a plurality of concepts given the query, the relevance score expressed as

OG Complex Work Unit Drawing
where w(c) is a weighing function related to a concept c, w(i) is a weighing function for a data source item i, hc is a set of items related to the concept c, hq is a set of items related to the query q, and ƒ(hc, hq) is a normalized score function, wherein weighing function w (i) varies by data source;
providing a subset of the concepts to a user based on the relevance score; and
using a template to process domain specific rules and the subset of the concepts.