The disclosed embodiments relate generally to fact databases. More particularly, the disclosed embodiments relate to extracting facts from documents.
The internet provides access to a wealth of information. Documents created by authors all over the world are freely available for reading, indexing, and extraction of information. This incredible diversity of fact and opinion that make the internet the ultimate information source.
However, this same diversity of information creates a considerable challenge when extracting information. Information may be presented in a variety of formats, languages, and layouts. A human user may (or may not) be able to decipher individual documents to gather the information contained therein, but these differences may confuse or mislead an automated extraction system, resulting in information of little or no value. Extracting information from documents of various formats poses a formidable challenge to efforts to create an automated extraction system.
A system and method for extracting facts from documents. A fact is extracted from a first document. The attribute and value of the fact extracted from the first document is used as a seed attribute-value pair. A second document containing the seed attribute-value pair is analyzed to determine a contextual pattern used in the second document. The contextual pattern is used to extract other attribute-value pairs from the second document. The extracted attributes and values are stored as facts.
Embodiments of the present invention are now described with reference to the figures where like reference numbers indicate identical or functionally similar elements.
Document hosts 102 store documents and provide access to documents. A document is comprised of any machine-readable data including any combination of text, graphics, multimedia content, etc. A document may be encoded in a markup language, such as Hypertext Markup Language (HTML), i.e., a web page, in a interpreted language (e.g., JavaScript) or in any other computer readable or executable format. A document can include one or more hyperlinks to other documents. A typical document will include one or more facts within its content. A document stored in a document host 102 may be located and/or identified by a Uniform Resource Locator (URL), or Web address, or any other appropriate form of identification and/or location. A document host 102 is implemented by a computer system, and typically includes a server adapted to communicate over the network 104 via networking protocols (e.g., TCP/IP), as well as application and presentation protocols (e.g., HTTP, HTML, SOAP, D-HTML, Java). The documents stored by a host 102 are typically held in a file directory, a database, or other data repository. A host 102 can be implemented in any computing device (e.g., from a PDA or personal computer, a workstation, mini-computer, or mainframe, to a cluster or grid of computers), as well as in any processor architecture or operating system.
Janitors 110 operate to process facts extracted by importer 108. This processing can include but is not limited to, data cleansing, object merging, and fact induction. In one embodiment, there are a number of different janitors 110 that perform different types of data management operations on the facts. For example, one janitor 110 may traverse some set of facts in the repository 115 to find duplicate facts (that is, facts that convey the same factual information) and merge them. Another janitor 110 may also normalize facts into standard formats. Another janitor 110 may also remove unwanted facts from repository 115, such as facts related to pornographic content. Other types of janitors 110 may be implemented, depending on the types of data management functions desired, such as translation, compression, spelling or grammar correction, and the like.
Various janitors 110 act on facts to normalize attribute names, and values and delete duplicate and near-duplicate facts so an object does not have redundant information. For example, we might find on one page that Britney Spears' birthday is “Dec. 2, 1981” while on another page that her date of birth is “Dec. 2, 1981.” Birthday and Date of Birth might both be rewritten as Birthdate by one janitor and then another janitor might notice that Dec. 2, 1981 and Dec. 2, 1981 are different forms of the same date. It would choose the preferred form, remove the other fact and combine the source lists for the two facts. As a result when you look at the source pages for this fact, on some you'll find an exact match of the fact and on others text that is considered to be synonymous with the fact.
Build engine 112 builds and manages the repository 115. Service engine 114 is an interface for querying the repository 115. Service engine 114's main function is to process queries, score matching objects, and return them to the caller but it is also used by janitor 110.
Repository 115 stores factual information extracted from a plurality of documents that are located on document hosts 102. A document from which a particular fact may be extracted is a source document (or “source”) of that particular fact. In other words, a source of a fact includes that fact (or a synonymous fact) within its contents.
Repository 115 contains one or more facts. In one embodiment, each fact is associated with exactly one object. One implementation for this association includes in each fact an object ID that uniquely identifies the object of the association. In this manner, any number of facts may be associated with an individual object, by including the object ID for that object in the facts. In one embodiment, objects themselves are not physically stored in the repository 115, but rather are defined by the set or group of facts with the same associated object ID, as described below. Further details about facts in repository 115 are described below, in relation to
It should be appreciated that in practice at least some of the components of the data processing system 106 will be distributed over multiple computers, communicating over a network. For example, repository 115 may be deployed over multiple servers. As another example, the janitors 110 may be located on any number of different computers. For convenience of explanation, however, the components of the data processing system 106 are discussed as though they were implemented on a single computer.
In another embodiment, some or all of document hosts 102 are located on data processing system 106 instead of being coupled to data processing system 106 by a network. For example, importer 108 may import facts from a database that is a part of or associated with data processing system 106.
As described above, each fact is associated with an object ID 209 that identifies the object that the fact describes. Thus, each fact that is associated with a same entity (such as George Washington), will have the same object ID 209. In one embodiment, objects are not stored as separate data entities in memory. In this embodiment, the facts associated with an object contain the same object ID, but no physical object exists. In another embodiment, objects are stored as data entities in memory, and include references (for example, pointers or IDs) to the facts associated with the object. The logical data structure of a fact can take various forms; in general, a fact is represented by a tuple that includes a fact ID, an attribute, a value, and an object ID. The storage implementation of a fact can be in any underlying physical data structure.
Also, while the illustration of
Each fact 204 also may include one or more metrics 218. A metric provides an indication of the some quality of the fact. In some embodiments, the metrics include a confidence level and an importance level. The confidence level indicates the likelihood that the fact is correct. The importance level indicates the relevance of the fact to the object, compared to other facts for the same object. The importance level may optionally be viewed as a measure of how vital a fact is to an understanding of the entity or concept represented by the object.
Each fact 204 includes a list of one or more sources 220 that include the fact and from which the fact was extracted. Each source may be identified by a Uniform Resource Locator (URL), or Web address, or any other appropriate form of identification and/or location, such as a unique document identifier.
The facts illustrated in
Some embodiments include one or more specialized facts, such as a name fact 207 and a property fact 208. A name fact 207 is a fact that conveys a name for the entity or concept represented by the object ID. A name fact 207 includes an attribute 224 of “name” and a value, which is the name of the object. For example, for an object representing the country Spain, a name fact would have the value “Spain.” A name fact 207, being a special instance of a general fact 204, includes the same fields as any other fact 204; it has an attribute, a value, a fact ID, metrics, sources, etc. The attribute 224 of a name fact 207 indicates that the fact is a name fact, and the value is the actual name. The name may be a string of characters. An object ID may have one or more associated name facts, as many entities or concepts can have more than one name. For example, an object ID representing Spain may have associated name facts conveying the country's common name “Spain” and the official name “Kingdom of Spain.” As another example, an object ID representing the U.S. Patent and Trademark Office may have associated name facts conveying the agency's acronyms “PTO” and “USPTO” as well as the official name “United States Patent and Trademark Office.” If an object does have more than one associated name fact, one of the name facts may be designated as a primary name and other name facts may be designated as secondary names, either implicitly or explicitly.
A property fact 208 is a fact that conveys a statement about the entity or concept represented by the object ID. Property facts are generally used for summary information about an object. A property fact 208, being a special instance of a general fact 204, also includes the same parameters (such as attribute, value, fact ID, etc.) as other facts 204. The attribute field 226 of a property fact 208 indicates that the fact is a property fact (e.g., attribute is “property”) and the value is a string of text that conveys the statement of interest. For example, for the object ID representing Bill Clinton, the value of a property fact may be the text string “Bill Clinton was the 42nd President of the United States from 1993 to 2001.” “Some object IDs may have one or more associated property facts while other objects may have no associated property facts. It should be appreciated that the data structures shown in
As described previously, a collection of facts is associated with an object ID of an object. An object may become a null or empty object when facts are disassociated from the object. A null object can arise in a number of different ways. One type of null object is an object that has had all of its facts (including name facts) removed, leaving no facts associated with its object ID. Another type of null object is an object that has all of its associated facts other than name facts removed, leaving only its name fact(s). Alternatively, the object may be a null object only if all of its associated name facts are removed. A null object represents an entity or concept for which the data processing system 106 has no factual information and, as far as the data processing system 106 is concerned, does not exist. In some embodiments, facts of a null object may be left in the repository 115, but have their object ID values cleared (or have their importance to a negative value). However, the facts of the null object are treated as if they were removed from the repository 115. In some other embodiments, facts of null objects are physically removed from repository 115.
The importer 304 processes the document 302 and extracts facts 306. The importer 304 may employ any of a variety of methods for extracting the facts 306 from the document 302, such as one of those described in “Supplementing Search Results with Information of Interest” or in the other incorporated applications. For the purposes of illustration, a single document 302 is shown in the figure. In practice, importer 304 can process a plurality of documents 302 to extract the facts 306.
According to one embodiment of the present invention, the importer 304 identifies a predefined pattern in the document 302 and applies the predefined pattern to extract attribute-value pairs. The extracted attribute-value pairs are then stored as facts 306. As described in “Supplementing Search Results with Information of Interest”, a predefined pattern defines specific, predetermined sections of the document which are expected to contain attributes and values. For example, in an HTML document, the presence of a text block such as “<BR>*:*<BR>” (where ‘*’ can be any string) may indicate that the document contains an attribute-value pair organized according to the pattern “<BR>(attribute text):(value text)<BR>”. Such a pattern is predefined in the sense that it is one of a known list of patterns to be identified and applied for extraction in documents. Of course, not every predefined pattern will necessarily be found in every document; identifying the patterns contained in a document determines which (if any) of the predefined patterns may be used for extraction on that document with a reasonable expectation of producing valid attribute-value pairs. The extracted attribute-value pairs are stored in the facts 306.
An attribute-value pair is composed of an attribute and its associated value. An attribute-value pair may be stored as a fact, for example, by storing the attribute in the attribute field of the fact and the value in the value field of the fact. Extracting a fact is synonymous with extracting at least an attribute-value pair and storing the attribute and value as a fact.
In the example illustrated, document 302 contains at least some attribute-value pairs organized according to one of the predefined patterns recognizable by the importer 304. An example of a document containing attribute-value pairs organized according to one of the predefined patterns recognizable by the importer 304 is described herein with reference to
However, the document 302 may contain other attribute-value pairs organized differently, such that applying one of the predefined patterns recognizable by the importer 304 produces incomplete, inconsistent, or erroneous results. Similarly, a document such as the document 308 may contain attribute-value pairs organized in a manner different from those prescribed by the various predefined patterns. It is possible that, the importer 304 were applied to the document 308, none of the predefined patterns recognizable by the importer 304 would be identified in the document 308.
Advantageously, one embodiment of the present invention facilitates the extraction of attribute-value pairs organized according to a pattern not itself recognizable by the importer 304. According to one embodiment of the present invention, a janitor 310 receives the facts 306 and the document 308. If the document 308 contains the same (or similar) attribute-value pairs as at least some of the facts 306, the facts 306 may be used to identify a contextual pattern in the document 308. A contextual pattern is a pattern that is inferred on the basis of the context in which known attribute-value pairs appear in a document. An example of a contextual pattern in a document is described herein with reference to
According to one embodiment of the present invention the janitor 310 additionally corroborates the facts 306 using a corroborating document (not shown). For example, as a result of improperly applied predefined patterns (or the document 302 itself), some of the facts 306 may contain errors, inconsistent information, or other factual anomalies. If the attribute-value pair of the fact 306A cannot be found in any corroborating document, the janitor 310 may reduce the confidence score of the fact 306A. Alternatively, if the attribute-value pair of the fact 306A is identified in a corroborating document, the confidence score of the fact 306A can be increased, and a reference to the corroborating document can be added to the list of sources for that fact. Several exemplary methods for corroborating facts can be found in “Corroborating Facts Extracted from Multiple Sources.”
According to one embodiment of the present invention, a plurality of documents are used to import and corroborate a group of facts. From this group of imported facts, those associated with a common name may be aggregated to form the facts 306. The facts 306 may be normalized, merged and/or corroborated, and their confidence score may be adjusted accordingly (for example, by the janitor 310, or by another janitor). According to one embodiment of the present invention, only facts 306 having a confidence score above a threshold are used for identification of contextual patterns by the janitor 310. Corroborating facts beneficially improves the consistency of extracted facts, and can reduce the influence of improperly applied predefined patterns on the quality of the fact database.
The facts 306 and facts 312 may be associated with a common object. For example, the facts 306 may be extracted from the document 302 and stored as an object in an object repository. According to one embodiment of the present invention, the facts 306 may be associated with an object name. An exemplary method for associating an object name with an object is described in “Identifying a Unifying Subject of a Set of Facts”. According to one embodiment of the present invention, the object name (or another property associated with the facts 302) are used to retrieve the document 308. Using the object name to retrieve the document 308 is one example of a method for finding a document potentially containing attribute-value pairs common with the document 302. As another example, the corroboration janitor 306 could query a search engine for documents containing one of the attribute-value pairs of the facts 306. Other methods will be apparent to one of skill in the art without departing from the scope of the present invention.
According to one embodiment of the present invention, the facts 312 are further processed by a janitor (either the janitor 310 or another janitor). For example, the facts 312 can be merged with another set of facts (for example, the facts 306), normalized, corroborated, and/or given a confidence score. According to one embodiment of the present invention, facts 312 having a confidence score above a threshold are added to a fact repository.
The unsupervised fact extractor 314 identifies in document 313A a predefined pattern and applies that pattern to extract a “seed” attribute-value pair. The unsupervised fact extractor 314 uses the seed attribute-value pair to identify a contextual pattern, in either or both of the documents 313, and applies the contextual pattern to extract additional attribute-value pairs. A method used by the unsupervised fact extractor 314, according to one embodiment of the present invention, is described herein with reference to
The unsupervised fact extractor 314 organizes the extracted attribute-value pairs into an object 316. The unsupervised fact extractor 314 may also employ techniques for normalization, corroboration, confidence rating, and others such as those described in the applications incorporated by reference above. Other methods for processing the extracted facts to produce an object will be apparent to one of skill in the art without departing from the scope of the present invention. Furthermore, the unsupervised fact extractor 314 has been shown as receiving two documents and producing one object for the purposes of illustration only. In practice, the unsupervised fact extractor 314 may operate on any number of documents, to extract a plurality of facts to be organized into any number of objects.
By identifying both predefined and contextual patterns in the documents 313, the unsupervised fact extractor 314 is able to build objects containing more information than extractors relying on predefined patterns alone, and without the need for document-specific human tailoring or intervention.
However, the document 502 has several attribute-value pairs in common with the document 402. Specifically, the (name; Britney Spears) and (date of birth; Dec. 2, 1981) pairs are contained in both documents. The unsupervised fact extractor 314 can use one (or both) of these pairs as a seed attribute-value pair to identify a contextual pattern of other attribute-value pairs. For example, the (name; Britney Spears) pair might be contained in a context such as the following: <BR><B>Name</B><BR><I>Britney Spears</I>
Thus, using the information extracted from the document 402, the unsupervised fact extractor 314 might identify in document 502 a contextual pattern for attribute-value pairs organized as: <BR><B>(attribute)</B><BR><I>(value)</I>
The common pair comprised of (date of birth; Dec. 2, 1981) may be used to confirm this contextual pattern, since this pair might also be contained in a context such as: <BR><B>Date of Birth</B><BR><I>Dec. 2, 1981</I>
Once the unsupervised fact extractor 314 has identified a contextual pattern, the unsupervised fact extractor 314 uses the contextual pattern to extract additional facts from the document 502. Thus the unsupervised fact extractor 314 may extract from the document 502 the following attribute-value pairs using the predefined pattern: (Favorite Food; Chicken Parmesan), (Favorite Movie; Back to the Future), and (Profession; Singer-Songwriter).
For the purposes of illustration, the document 502 shows attribute-value pairs organized according to a single contextual pattern. Documents may contain multiple and various contextual patterns, or a mix of predefined patterns and contextual patterns. Furthermore, the examples of predefined patterns and contextual patterns illustrated herein as been selected for the purposes of illustration only. In some cases the attribute-value pattern used by document 502 may be recognizable as a predefined pattern, and conversely, in some cases the attribute-value pattern used by document 402 may not be recognizable as a predefined pattern. Given the scope and diversity of the internet, however, there will always be some documents containing attribute-value pairs not organized by a recognizable predefined pattern, and the ability to identify contextual patterns beneficially facilitates the extraction of at least some of these pairs.
The method begins with a document 302. The document 302 contains an attribute-value pair organized according to a predefined pattern. The unsupervised fact extractor 314 extracts 604 an attribute-value pair from the document 302, producing a seed attribute-value pair 606. According to one embodiment of the present invention, the unsupervised fact extractor 314 can extract 604 the attribute and value from the document by applying a predefined pattern; other methods for extracting 604 the attribute and value will be apparent to one of skill in the art without departing from the scope of the present invention. Additionally, the unsupervised fact extractor 314 may store the seed attribute-value pair 606 in a fact (not shown). According to one embodiment of the present invention, the fact in which the seed attribute-pair 606 is stored is associated with an object.
The unsupervised fact extractor 314 retrieves 608 a document 610 that contains the seed attribute-value pair 606 organized according to a contextual pattern.
According to one embodiment of the present invention, the unsupervised fact extractor 314 retrieves 608 the document 610 by searching (for example, on document hosts or in a document repository) for documents containing the attribute and value of the seed attribute-value pair. According to another embodiment of the present invention, the seed attribute-value pair is stored as a fact associated with an object. This object may have a name, and the unsupervised fact extractor 314 may retrieve 608 a document 610 by searching in a document repository for documents containing the object name. Other methods for retrieving 608 a document 610 will be apparent to one of skill in the art without departing from the scope of the present invention.
The unsupervised fact extractor 314 identifies 612 a contextual pattern associated with the seed attribute-value pair 606 and uses the pattern to extract an attribute-value pair 614 from the document 610. The attribute-value pair 614 may then be stored as a fact and processed by further janitors, importers, and object retrievers as appropriate. According to one embodiment of the present invention, the fact in which the attribute-value pair 614 is stored is associated with an object. The fact containing attribute-value pair 614 may be associated with the same object as the fact containing seed attribute-value pair 606, or it may be associated with a different object.
By extracting attributes and value using both predefined and contextual patterns, the unsupervised fact extractor 314 is able to collect a larger amount of information into facts than an extractor relying on either approach alone. Advantageously, information may be extracted into facts efficiently, accurately, and without need for human supervision.
Additionally, the unsupervised fact extractor 314 may also use the contextual pattern to extract another attribute-value pair from a third document. According to one embodiment of the present invention, the unsupervised fact extractor 314 determines if the third document is similar to the document 610, for example, by comparing the domain hosting the document 610 to the domain hosting the third document. Using the contextual pattern to extract another attribute-value pair from a third document may be responsive to the determination that the third document is similar to the document 610. Using the contextual pattern to extract another attribute-value pair from a third document advantageously facilitates the extracting of attribute-value pairs organized according to patterns not recognizable as predefined patterns, even from documents not containing a seed attribute-value pair.
While a method for extracting facts has been shown for the purposes of illustration as extracting a single seed attribute-value pair 606 and a single attribute-value pair 614, it will be apparent to one of skill in the art that in practice the unsupervised fact extractor 314 may extract 604 a plurality of attribute-value pairs and extract 612 a plurality of attribute-value pairs 614. When a plurality of attribute-value pairs are extracted 604, any number of that plurality may be used as seed attribute-value pairs 606. According to one embodiment of the present invention, extracting 612 additional attribute-value pairs from the document 610 is responsive to the number of seed-attribute-value pairs 606 contained in the document 610. According to another embodiment of the present invention, a first seed attribute-value pair 606 may be used to identify 612 a contextual pattern and a second seed attribute-value pair 606 may be used to verify that contextual pattern, for example, by determining if the second seed attribute-value pair 606 is organized in the document 610 according to the contextual pattern. By using a plurality of seed attribute-value pairs 606, the efficiency and accuracy of the unsupervised fact extractor 314 may be improved.
Reference in the specification to “one embodiment” or to “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiments is included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment.
Some portions of the above are presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of steps (instructions) leading to a desired result. The steps are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical, magnetic or optical signals capable of being stored, transferred, combined, compared and otherwise manipulated. It is convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like. Furthermore, it is also convenient at times, to refer to certain arrangements of steps requiring physical manipulations of physical quantities as modules or code devices, without loss of generality.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or “determining” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
Certain aspects of the present invention include process steps and instructions described herein in the form of an algorithm. It should be noted that the process steps and instructions of the present invention can be embodied in software, firmware or hardware, and when embodied in software, can be downloaded to reside on and be operated from different platforms used by a variety of operating systems.
The present invention also relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored in the computer. Such a computer program may be stored in a computer readable storage medium, such as, but is not limited to, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for storing electronic instructions, and each coupled to a computer system bus. Furthermore, the computers referred to in the specification may include a single processor or may be architectures employing multiple processor designs for increased computing capability.
The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general-purpose systems may also be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the required method steps. The required structure for a variety of these systems will appear from the description below. In addition, the present invention is not described with reference to any particular programming language. It will be appreciated that a variety of programming languages may be used to implement the teachings of the present invention as described herein, and any references below to specific languages are provided for disclosure of enablement and best mode of the present invention.
While the invention has been particularly shown and described with reference to a preferred embodiment and several alternate embodiments, it will be understood by persons skilled in the relevant art that various changes in form and details can be made therein without departing from the spirit and scope of the invention.
Finally, it should be noted that the language used in the specification has been principally selected for readability and instructional purposes, and may not have been selected to delineate or circumscribe the inventive subject matter. Accordingly, the disclosure of the present invention is intended to be illustrative, but not limiting, of the scope of the invention, which is set forth in the following claims.
This application is a continuation of U.S. application Ser. No. 11/394,414, entitled, “Unsupervised Extraction of Facts,” by Jonathan Betz and Shubin Zhao, filed on Mar. 31, 2006, which is a continuation-in-part of U.S. application Ser. No. 11/142,853, entitled, “Learning Facts from Semi-Structured Text,” by Shubin Zhao and Jonathan T. Betz, filed on May 31, 2005, now U.S. Pat. No. 7,769,579, issued on Aug. 3, 2010, all of which are hereby incorporated by reference. This application is related to the following applications, all of which are hereby incorporated by reference: U.S. application Ser. No. 11/024,784, entitled, “Supplementing Search Results with Information of Interest”, by Jonathan Betz, filed on Dec. 30, 2004;U.S. application Ser. No. 11/142,765, entitled, “Identifying the Unifying Subject of a Set of Facts”, by Jonathan Betz, filed on May 31, 2005;U.S. application Ser. No. 11/097,588, entitled, “Corroborating Facts Extracted from Multiple Sources”, by Jonathan Betz, filed on Mar. 31, 2005;U.S. application Ser. No. 11/366,162, entitled “Generating Structured Information,” filed Mar. 1, 2006, by Egon Pasztor and Daniel Egnor;U.S. application Ser. No. 11/357,748, entitled “Support for Object Search”, filed Feb. 17, 2006, by Alex Kehlenbeck, Andrew W. Hogue;U.S. application Ser. No. 11/342,290, entitled “Data Object Visualization”, filed on Jan. 27, 2006, by Andrew W. Hogue, David Vespe, Alex Kehlenbeck, Mike Gordon, Jeffrey C. Reynar, David Alpert;U.S. application Ser. No. 11/342,293, entitled “Data Object Visualization Using Maps”, filed on Jan. 27, 2006, by Andrew W. Hogue, David Vespe, Alex Kehlenbeck, Mike Gordon, Jeffrey C. Reynar, David Alpert;U.S. application Ser. No. 11/356,679, entitled “Query Language”, filed Feb. 17, 2006, by Andrew W. Hogue, Doug Rohde;U.S. application Ser. No. 11/356,837, entitled “Automatic Object Reference Identification and Linking in a Browseable Fact Repository”, filed Feb. 17, 2006, by Andrew W. Hogue;U.S. application Ser. No. 11/356,851, entitled “Browseable Fact Repository”, filed Feb. 17, 2006, by Andrew W. Hogue, Jonathan T. Betz;U.S. application Ser. No. 11/356,842, entitled “ID Persistence Through Normalization”, filed Feb. 17, 2006, by Jonathan T. Betz, Andrew W. Hogue;U.S. application Ser. No. 11/356,728, entitled “Annotation Framework”, filed Feb. 17, 2006, by Tom Richford, Jonathan T. Betz;U.S. application Ser. No. 11/341,069, entitled “Object Categorization for Information Extraction”, filed on Jan. 27, 2006, by Jonathan T. Betz;U.S. application Ser. No. 11/356,838, entitled “Modular Architecture for Entity Normalization”, filed Feb. 17, 2006, by Jonathan T. Betz, Farhan Shamsi;U.S. application Ser. No. 11/356,765, entitled “Attribute Entropy as a Signal in Object Normalization”, filed Feb. 17, 2006, by Jonathan T. Betz, Vivek Menezes;U.S. application Ser. No. 11/341,907, entitled “Designating Data Objects for Analysis”, filed on Jan. 27, 2006, by Andrew W. Hogue, David Vespe, Alex Kehlenbeck, Mike Gordon, Jeffrey C. Reynar, David Alpert;U.S. application Ser. No. 11/342,277, entitled “Data Object Visualization Using Graphs”, filed on Jan. 27, 2006, by Andrew W. Hogue, David Vespe, Alex Kehlenbeck, Mike Gordon, Jeffrey C. Reynar, David Alpert;U.S. application Ser. No. 11/394,508, entitled “Entity Normalization Via Name Normalization”, filed on Mar. 31, 2006, by Jonathan T. Betz;U.S. application Ser. No. 11/394,610, entitled “Determining Document Subject by Using Title and Anchor Text of Related Documents”, filed on Mar. 31, 2006, by Shubin Zhao;U.S. application Ser. No. 11/394,552, entitled “Anchor Text Summarization for Corroboration”, filed on Mar. 31, 2006, by Jonathan T. Betz and Shubin Zhao;U.S. application Ser. No. 11/399,857, entitled “Mechanism for Inferring Facts from a Fact Repository”, filed on Mar. 31, 2006, by Andrew Hogue and Jonathan Betz.
Number | Name | Date | Kind |
---|---|---|---|
5010478 | Deran | Apr 1991 | A |
5133075 | Risch | Jul 1992 | A |
5347653 | Flynn et al. | Sep 1994 | A |
5440730 | Elmasri et al. | Aug 1995 | A |
5475819 | Miller et al. | Dec 1995 | A |
5519608 | Kupiec | May 1996 | A |
5546507 | Staub | Aug 1996 | A |
5560005 | Hoover et al. | Sep 1996 | A |
5574898 | Leblang et al. | Nov 1996 | A |
5675785 | Hall et al. | Oct 1997 | A |
5680622 | Even | Oct 1997 | A |
5694590 | Thuraisingham et al. | Dec 1997 | A |
5701470 | Joy et al. | Dec 1997 | A |
5717911 | Madrid et al. | Feb 1998 | A |
5717951 | Yabumoto | Feb 1998 | A |
5724571 | Woods | Mar 1998 | A |
5778373 | Levy et al. | Jul 1998 | A |
5778378 | Rubin | Jul 1998 | A |
5787413 | Kauffman et al. | Jul 1998 | A |
5793966 | Amstein | Aug 1998 | A |
5802299 | Logan et al. | Sep 1998 | A |
5815415 | Bentley et al. | Sep 1998 | A |
5819210 | Maxwell, III et al. | Oct 1998 | A |
5819265 | Ravin et al. | Oct 1998 | A |
5822743 | Gupta et al. | Oct 1998 | A |
5826258 | Gupta et al. | Oct 1998 | A |
5838979 | Hart et al. | Nov 1998 | A |
5882743 | McConnell | Mar 1999 | A |
5909689 | Van Ryzin | Jun 1999 | A |
5920859 | Li | Jul 1999 | A |
5943670 | Prager | Aug 1999 | A |
5956718 | Prasad et al. | Sep 1999 | A |
5974254 | Hsu | Oct 1999 | A |
5987460 | Niwa et al. | Nov 1999 | A |
6006221 | Liddy et al. | Dec 1999 | A |
6018741 | Howland et al. | Jan 2000 | A |
6038560 | Wical | Mar 2000 | A |
6044366 | Graffe et al. | Mar 2000 | A |
6052693 | Smith et al. | Apr 2000 | A |
6064952 | Imanaka et al. | May 2000 | A |
6073130 | Jacobson et al. | Jun 2000 | A |
6078918 | Allen et al. | Jun 2000 | A |
6112203 | Bharat et al. | Aug 2000 | A |
6112210 | Nori et al. | Aug 2000 | A |
6122647 | Horowitz et al. | Sep 2000 | A |
6134555 | Chadha et al. | Oct 2000 | A |
6138270 | Hsu | Oct 2000 | A |
6182063 | Woods | Jan 2001 | B1 |
6202065 | Wills | Mar 2001 | B1 |
6212526 | Chaudhuri et al. | Apr 2001 | B1 |
6240546 | Lee et al. | May 2001 | B1 |
6263328 | Coden et al. | Jul 2001 | B1 |
6263358 | Lee et al. | Jul 2001 | B1 |
6266805 | Nwana et al. | Jul 2001 | B1 |
6285999 | Page | Sep 2001 | B1 |
6289338 | Stoffel et al. | Sep 2001 | B1 |
6311194 | Sheth et al. | Oct 2001 | B1 |
6314555 | Ndumu et al. | Nov 2001 | B1 |
6327574 | Kramer et al. | Dec 2001 | B1 |
6349275 | Schumacher et al. | Feb 2002 | B1 |
6377943 | Jakobsson | Apr 2002 | B1 |
6397228 | Lamburt et al. | May 2002 | B1 |
6438543 | Kazi et al. | Aug 2002 | B1 |
6470330 | Das et al. | Oct 2002 | B1 |
6473898 | Waugh et al. | Oct 2002 | B1 |
6487495 | Gale et al. | Nov 2002 | B1 |
6502102 | Haswell et al. | Dec 2002 | B1 |
6519631 | Rosenschein et al. | Feb 2003 | B1 |
6556991 | Borkovsky | Apr 2003 | B1 |
6565610 | Wang et al. | May 2003 | B1 |
6567846 | Garg et al. | May 2003 | B1 |
6567936 | Yang et al. | May 2003 | B1 |
6572661 | Stern | Jun 2003 | B1 |
6578032 | Chandrasekar et al. | Jun 2003 | B1 |
6584464 | Warthen | Jun 2003 | B1 |
6584646 | Fujita | Jul 2003 | B2 |
6594658 | Woods | Jul 2003 | B2 |
6606625 | Muslea et al. | Aug 2003 | B1 |
6606659 | Hegli et al. | Aug 2003 | B1 |
6609123 | Cazemier et al. | Aug 2003 | B1 |
6636742 | Torkki et al. | Oct 2003 | B1 |
6643641 | Snyder | Nov 2003 | B1 |
6665659 | Logan | Dec 2003 | B1 |
6665666 | Brown et al. | Dec 2003 | B1 |
6665837 | Dean et al. | Dec 2003 | B1 |
6675159 | Lin et al. | Jan 2004 | B1 |
6684205 | Modha et al. | Jan 2004 | B1 |
6693651 | Biebesheimer et al. | Feb 2004 | B2 |
6704726 | Amouroux | Mar 2004 | B1 |
6738767 | Chung et al. | May 2004 | B1 |
6745189 | Schreiber | Jun 2004 | B2 |
6754873 | Law et al. | Jun 2004 | B1 |
6763496 | Hennings et al. | Jul 2004 | B1 |
6799176 | Page | Sep 2004 | B1 |
6804667 | Martin | Oct 2004 | B1 |
6820081 | Kawai et al. | Nov 2004 | B1 |
6820093 | de la Huerga | Nov 2004 | B2 |
6823495 | Vedula et al. | Nov 2004 | B1 |
6832218 | Emens et al. | Dec 2004 | B1 |
6845354 | Kuo et al. | Jan 2005 | B1 |
6850896 | Kelman et al. | Feb 2005 | B1 |
6868411 | Shanahan | Mar 2005 | B2 |
6873982 | Bates et al. | Mar 2005 | B1 |
6873993 | Charlesworth et al. | Mar 2005 | B2 |
6886005 | Davis | Apr 2005 | B2 |
6886010 | Kostoff | Apr 2005 | B2 |
6901403 | Bata et al. | May 2005 | B1 |
6904429 | Sako et al. | Jun 2005 | B2 |
6957213 | Yuret | Oct 2005 | B1 |
6963880 | Pingte | Nov 2005 | B1 |
6965900 | Srinivasa | Nov 2005 | B2 |
6996572 | Chakrabarti et al. | Feb 2006 | B1 |
7003506 | Fisk | Feb 2006 | B1 |
7003522 | Reynar et al. | Feb 2006 | B1 |
7003719 | Rosenoff et al. | Feb 2006 | B1 |
7007228 | Carro | Feb 2006 | B1 |
7013308 | Tunstall-Pedoe | Mar 2006 | B1 |
7020662 | Boreham et al. | Mar 2006 | B2 |
7043521 | Eitel | May 2006 | B2 |
7051023 | Kapur et al. | May 2006 | B2 |
7076491 | Tsao | Jul 2006 | B2 |
7080073 | Jiang et al. | Jul 2006 | B1 |
7080085 | Choy et al. | Jul 2006 | B1 |
7100082 | Little et al. | Aug 2006 | B2 |
7143099 | Lecheler-Moore et al. | Nov 2006 | B2 |
7146536 | Bingham et al. | Dec 2006 | B2 |
7158980 | Shen | Jan 2007 | B2 |
7162499 | Lees et al. | Jan 2007 | B2 |
7165024 | Glover et al. | Jan 2007 | B2 |
7174504 | Tsao | Feb 2007 | B2 |
7181471 | Ibuki et al. | Feb 2007 | B1 |
7194380 | Barrow et al. | Mar 2007 | B2 |
7197449 | Hu et al. | Mar 2007 | B2 |
7216073 | Lavi et al. | May 2007 | B2 |
7233943 | Modha et al. | Jun 2007 | B2 |
7263565 | Tawara et al. | Aug 2007 | B2 |
7269587 | Page et al. | Sep 2007 | B1 |
7277879 | Varadarajan | Oct 2007 | B2 |
7302646 | Nomiyama et al. | Nov 2007 | B2 |
7305380 | Hoelzle et al. | Dec 2007 | B1 |
7325160 | Tsao | Jan 2008 | B2 |
7363312 | Goldsack | Apr 2008 | B2 |
7376895 | Tsao | May 2008 | B2 |
7409381 | Steel et al. | Aug 2008 | B1 |
7412078 | Kim | Aug 2008 | B2 |
7418736 | Ghanea-Hercock | Aug 2008 | B2 |
7454430 | Komissarchik et al. | Nov 2008 | B1 |
7472182 | Young et al. | Dec 2008 | B1 |
7483829 | Murakami et al. | Jan 2009 | B2 |
7493308 | Bair et al. | Feb 2009 | B1 |
7493317 | Geva | Feb 2009 | B2 |
7587387 | Hogue | Sep 2009 | B2 |
7644076 | Ramesh et al. | Jan 2010 | B1 |
7672971 | Betz et al. | Mar 2010 | B2 |
7685201 | Zeng et al. | Mar 2010 | B2 |
7698303 | Goodwin et al. | Apr 2010 | B2 |
7716225 | Dean et al. | May 2010 | B1 |
7747571 | Boggs | Jun 2010 | B2 |
7756823 | Young et al. | Jul 2010 | B2 |
7797282 | Kirshenbaum et al. | Sep 2010 | B1 |
7885918 | Statchuk | Feb 2011 | B2 |
7917154 | Fortescue et al. | Mar 2011 | B2 |
7953720 | Rohde et al. | May 2011 | B1 |
8024281 | Proctor et al. | Sep 2011 | B2 |
8065290 | Hogue | Nov 2011 | B2 |
8086690 | Heymans et al. | Dec 2011 | B1 |
8108501 | Birnie et al. | Jan 2012 | B2 |
8122026 | Laroco et al. | Feb 2012 | B1 |
8347202 | Vespe et al. | Jan 2013 | B1 |
8650175 | Hogue et al. | Feb 2014 | B2 |
8751498 | Yakovenko et al. | Jun 2014 | B2 |
8812435 | Zhao | Aug 2014 | B1 |
8825471 | Zhao et al. | Sep 2014 | B2 |
9092495 | Hogue et al. | Jul 2015 | B2 |
9208229 | Betz et al. | Dec 2015 | B2 |
20010021935 | Mills | Sep 2001 | A1 |
20020022956 | Ukrainczyk et al. | Feb 2002 | A1 |
20020038307 | Obradovic et al. | Mar 2002 | A1 |
20020042707 | Zhao et al. | Apr 2002 | A1 |
20020065845 | Naito et al. | May 2002 | A1 |
20020073115 | Davis | Jun 2002 | A1 |
20020083039 | Ferrari et al. | Jun 2002 | A1 |
20020087567 | Spiegler et al. | Jul 2002 | A1 |
20020107861 | Clendinning et al. | Aug 2002 | A1 |
20020147738 | Reader | Oct 2002 | A1 |
20020169770 | Kim et al. | Nov 2002 | A1 |
20020174099 | Raj et al. | Nov 2002 | A1 |
20020178448 | Te Kiefte et al. | Nov 2002 | A1 |
20020194172 | Schreiber | Dec 2002 | A1 |
20030018652 | Heckerman et al. | Jan 2003 | A1 |
20030058706 | Okamoto et al. | Mar 2003 | A1 |
20030069880 | Harrison et al. | Apr 2003 | A1 |
20030078902 | Leong et al. | Apr 2003 | A1 |
20030088607 | Ruellan et al. | May 2003 | A1 |
20030097357 | Ferrari et al. | May 2003 | A1 |
20030120644 | Shirota | Jun 2003 | A1 |
20030120675 | Stauber et al. | Jun 2003 | A1 |
20030126102 | Borthwick | Jul 2003 | A1 |
20030126152 | Rajak | Jul 2003 | A1 |
20030149567 | Schmitz et al. | Aug 2003 | A1 |
20030149699 | Tsao | Aug 2003 | A1 |
20030154071 | Shreve | Aug 2003 | A1 |
20030177110 | Okamoto et al. | Sep 2003 | A1 |
20030182310 | Charnock et al. | Sep 2003 | A1 |
20030195872 | Senn | Oct 2003 | A1 |
20030195877 | Ford et al. | Oct 2003 | A1 |
20030196052 | Bolik et al. | Oct 2003 | A1 |
20030204481 | Lau | Oct 2003 | A1 |
20030208354 | Lin et al. | Nov 2003 | A1 |
20040003067 | Ferrin | Jan 2004 | A1 |
20040006576 | Colbath et al. | Jan 2004 | A1 |
20040015481 | Zinda | Jan 2004 | A1 |
20040024739 | Copperman et al. | Feb 2004 | A1 |
20040059726 | Hunter et al. | Mar 2004 | A1 |
20040064447 | Simske et al. | Apr 2004 | A1 |
20040088292 | Dettinger et al. | May 2004 | A1 |
20040107125 | Guheen et al. | Jun 2004 | A1 |
20040122844 | Malloy et al. | Jun 2004 | A1 |
20040122846 | Chess et al. | Jun 2004 | A1 |
20040123240 | Gerstl et al. | Jun 2004 | A1 |
20040128624 | Arellano et al. | Jul 2004 | A1 |
20040143600 | Musgrove et al. | Jul 2004 | A1 |
20040153456 | Charnock et al. | Aug 2004 | A1 |
20040167870 | Wakefield et al. | Aug 2004 | A1 |
20040167907 | Wakefield et al. | Aug 2004 | A1 |
20040167911 | Wakefield et al. | Aug 2004 | A1 |
20040177015 | Galai et al. | Sep 2004 | A1 |
20040177080 | Doise et al. | Sep 2004 | A1 |
20040199923 | Russek | Oct 2004 | A1 |
20040243552 | Titemore et al. | Dec 2004 | A1 |
20040243614 | Boone et al. | Dec 2004 | A1 |
20040255237 | Tong | Dec 2004 | A1 |
20040260979 | Kumai | Dec 2004 | A1 |
20040267700 | Dumais et al. | Dec 2004 | A1 |
20040268237 | Jones et al. | Dec 2004 | A1 |
20050055365 | Ramakrishnan et al. | Mar 2005 | A1 |
20050076012 | Manber et al. | Apr 2005 | A1 |
20050080613 | Colledge et al. | Apr 2005 | A1 |
20050086211 | Mayer | Apr 2005 | A1 |
20050086222 | Wang et al. | Apr 2005 | A1 |
20050086251 | Hatscher et al. | Apr 2005 | A1 |
20050097150 | McKeon et al. | May 2005 | A1 |
20050108630 | Wasson et al. | May 2005 | A1 |
20050114324 | Mayer et al. | May 2005 | A1 |
20050125311 | Chidiac et al. | Jun 2005 | A1 |
20050138007 | Amitay et al. | Jun 2005 | A1 |
20050144241 | Stata et al. | Jun 2005 | A1 |
20050149576 | Marmaros et al. | Jul 2005 | A1 |
20050149851 | Mittal | Jul 2005 | A1 |
20050159851 | Engstrom et al. | Jul 2005 | A1 |
20050165781 | Kraft et al. | Jul 2005 | A1 |
20050187923 | Cipollone | Aug 2005 | A1 |
20050188217 | Ghanea-Hercock | Aug 2005 | A1 |
20050240615 | Barsness et al. | Oct 2005 | A1 |
20050256825 | Dettinger et al. | Nov 2005 | A1 |
20050278314 | Buchheit et al. | Dec 2005 | A1 |
20060036504 | Allocca et al. | Feb 2006 | A1 |
20060041375 | Witmer et al. | Feb 2006 | A1 |
20060041597 | Conrad et al. | Feb 2006 | A1 |
20060047691 | Humphreys et al. | Mar 2006 | A1 |
20060047838 | Chauhan | Mar 2006 | A1 |
20060053171 | Eldridge et al. | Mar 2006 | A1 |
20060053175 | Gardner et al. | Mar 2006 | A1 |
20060064411 | Gross et al. | Mar 2006 | A1 |
20060074824 | Li | Apr 2006 | A1 |
20060074910 | Yun et al. | Apr 2006 | A1 |
20060085465 | Nori et al. | Apr 2006 | A1 |
20060112110 | Maymir-Ducharme et al. | May 2006 | A1 |
20060123046 | Doise et al. | Jun 2006 | A1 |
20060129843 | Srinivasa et al. | Jun 2006 | A1 |
20060136585 | Mayfield et al. | Jun 2006 | A1 |
20060143227 | Helm et al. | Jun 2006 | A1 |
20060143603 | Kalthoff et al. | Jun 2006 | A1 |
20060149800 | Egnor et al. | Jul 2006 | A1 |
20060152755 | Curtis et al. | Jul 2006 | A1 |
20060167991 | Heikes et al. | Jul 2006 | A1 |
20060224582 | Hogue | Oct 2006 | A1 |
20060238919 | Bradley et al. | Oct 2006 | A1 |
20060242180 | Graf et al. | Oct 2006 | A1 |
20060248045 | Toledano et al. | Nov 2006 | A1 |
20060248456 | Bender et al. | Nov 2006 | A1 |
20060253418 | Charnock et al. | Nov 2006 | A1 |
20060259462 | Timmons | Nov 2006 | A1 |
20060277169 | Lunt et al. | Dec 2006 | A1 |
20060288268 | Srinivasan et al. | Dec 2006 | A1 |
20060293879 | Zhao et al. | Dec 2006 | A1 |
20070005593 | Self et al. | Jan 2007 | A1 |
20070005639 | Gaussier et al. | Jan 2007 | A1 |
20070016890 | Brunner et al. | Jan 2007 | A1 |
20070038610 | Omoigui | Feb 2007 | A1 |
20070043708 | Tunstall-Pedoe | Feb 2007 | A1 |
20070055656 | Tunstall-Pedoe | Mar 2007 | A1 |
20070073768 | Goradia | Mar 2007 | A1 |
20070094246 | Dill et al. | Apr 2007 | A1 |
20070100814 | Lee et al. | May 2007 | A1 |
20070106455 | Fuchs et al. | May 2007 | A1 |
20070130123 | Majumder | Jun 2007 | A1 |
20070143282 | Betz et al. | Jun 2007 | A1 |
20070143317 | Hogue et al. | Jun 2007 | A1 |
20070150800 | Betz et al. | Jun 2007 | A1 |
20070198451 | Kehlenbeck et al. | Aug 2007 | A1 |
20070198480 | Hogue et al. | Aug 2007 | A1 |
20070198481 | Hogue et al. | Aug 2007 | A1 |
20070198503 | Hogue et al. | Aug 2007 | A1 |
20070198577 | Betz et al. | Aug 2007 | A1 |
20070198598 | Betz et al. | Aug 2007 | A1 |
20070198600 | Betz | Aug 2007 | A1 |
20070203867 | Hogue et al. | Aug 2007 | A1 |
20070208773 | Tsao | Sep 2007 | A1 |
20070258642 | Thota et al. | Nov 2007 | A1 |
20070271268 | Fontoura et al. | Nov 2007 | A1 |
20080071739 | Kumar et al. | Mar 2008 | A1 |
20080104019 | Nath | May 2008 | A1 |
20090006359 | Liao | Jan 2009 | A1 |
20090119255 | Frank et al. | May 2009 | A1 |
20130191385 | Vespe et al. | Jul 2013 | A1 |
20140129538 | Hogue et al. | May 2014 | A1 |
20140289177 | Laroco et al. | Sep 2014 | A1 |
20140372478 | Zhao | Dec 2014 | A1 |
20140379743 | Yakovenko et al. | Dec 2014 | A1 |
Number | Date | Country |
---|---|---|
5-174020 | Jul 1993 | JP |
11-265400 | Sep 1999 | JP |
2002-157276 | May 2002 | JP |
2002-540506 | Nov 2002 | JP |
2003-281173 | Oct 2003 | JP |
WO 0127713 | Apr 2001 | WO |
WO 2004114163 | Dec 2004 | WO |
WO 2006104951 | Oct 2006 | WO |
Entry |
---|
Etzioni et al., Web-Scale Information Extraction in KnowItAll, 2004, ACM, Proceedings of the 13th international conference on World Wide Web, pp.={100-110}. |
Agichtein, Snowball estracting relations from large plain-text collections, Dec. 1999, 13 pgs. |
Andritsos, Information-theoretic tools for mining database structure from large data sets, Jun. 13-18, 2004, 12 pgs. |
Betz, Examiner's Answer, U.S. Appl. No. 11/097,688, Jul. 8, 2010, 18 pgs. |
Betz, Examiner's Answer, U.S. Appl. No. 11/394,414, Jan. 24, 2011, 31 pgs. |
Betz, Final Office Action, U.S. Appl. No. 11/394,552, Oct. 21, 2013, 22 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 11/097,688, Nov. 19, 2013, 17 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 11/142,740, Apr. 16, 2009, 7 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 11/142,765, Jul. 1, 2010, 14 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 11/341,069, Sep. 8, 2008, 6 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 11/394,414, Apr. 30, 2014, 12 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 12/939,981, Aug. 11, 2011, 7 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 12/939,981, Apr. 26, 2011, 11 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 13/302,755, Jan. 6, 2014, 9 pgs. |
Betz, Notice of Allowance, U.S. Appl. No. 13/302,755, Aug. 28, 2013, 6 pgs. |
Betz, Office Action, U.S. Appl. No. 11/097,688, Mar. 18, 2009, 13 pgs. |
Betz, Office Action, U.S. Appl. No. 11/097,688, Oct. 29, 2009, 11 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, Aug. 13, 2007, 12 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, May 17, 2007, 12 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, Jul. 23, 2008, 11 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, Dec. 26, 2007, 12 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, Jan. 27, 2009, 11 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,740, Apr. 30, 2008, 14 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Jan. 8, 2010, 17 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, May 9, 2008, 20 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Jan. 17, 2008, 16 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Oct. 17, 2007, 14 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Oct. 17, 2008, 17 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Jun. 18, 2007, 13 pgs. |
Betz, Office Action, U.S. Appl. No. 11/142,765, Apr. 28, 2009, 16 pgs. |
Betz, Office Action, U.S. Appl. No. 11/341,069, Apr. 1, 2008, 8 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,414, Mar. 5, 2010, 24 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,414, Sep. 15, 2009, 16 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Apr. 1, 2008, 14 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Aug. 4, 2010, 19 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Feb. 8, 2011, 22 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Jul. 8, 2011, 13 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Apr. 11, 2012, 15 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Nov. 12, 2008, 11 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Jan. 13, 2010, 15 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Mar. 13, 2009, 12 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Apr. 23, 2013, 21 pgs. |
Betz, Office Action, U.S. Appl. No. 11/394,552, Sep. 24, 2012, 21 pgs. |
Betz, Office Action, U.S. Appl. No. 12/939,981, Dec. 9, 2010, 12 pgs. |
Betz, Office Action, U.S. Appl. No. 13/302,755, Mar. 25, 2013, 15 pgs. |
Brill, An analysis of the askMSR question-answering system, Jul. 2002, 8 pgs. |
Brin, Extracting patterns and relations from the world wide web, 1999, 12 pgs. |
Brin, The anatomy of a large-scale hypertextual search engine, Apr. 14-18, 1998, 26 pgs. |
Bunescu, Using encyclopedia knowledge for named entity disambiguation, Dec. 28, 2006, 8 pgs. |
Chang, IEPAD: Information extraction based on pattern discovery, May 1-5, 2001, 8 pgs. |
Chen, A scheme for inference problems using rough sets and entropy, Aug. 31-Sep. 3, 2005, 10 pgs. |
Chu-Carroll, A multi-strategy and multi-source approach to question answering, 2006, 8 pgs. |
Cover, Entropy, relative entropy and mutual information, Chapter 2 Elements of Information Theory, 1991, 13 pgs. |
Craswell, Effective site finding using link anchor information, Sep. 9-12, 2001, 8 pgs. |
Dean, MapReduce: Simplified data processing on large clusters, 2004, 13 pgs. |
Dean, Using design recovery techniques to transform legacy systems, 2001, 10 pgs. |
Dong, Reference reconciliation in complex information spaces, 2005, 12 pgs. |
Downey, Learning text patterns for web information extraction and assessment, 2002, 6 pgs. |
Etzioni, Unsupervised named-entity extraction from the web: an experimental study, Feb. 28, 2005, 42 pgs. |
Etzioni, Web-scale information extraction in knowitall (preliminary results), May 17-22, 2004, 11 pgs. |
Freitag, Boosted wrapped induction, 2000, 7 pgs. |
Gao, Learning information extraction patterns from tabluar web pages without manual labelling, Oct. 13-17, 2009, 4 pgs. |
Gigablast, Web/Directory, printed Aug. 24, 2010, 1 pg. |
Google Inc., International Search Report / Written Opinion, PCT/US2006/007639, Sep. 13, 2006, 5 pgs. |
Google Inc., International Search Report / Written Opinion, PCT/US2006/010965, Jul. 5, 2006, 4 pgs. |
Google Inc., International Search Report / Written Opinion, PCT/US2006/019807, Dec. 18, 2006, 4 pgs. |
Google Inc., International Search Report / Written Opinion, PCT/US2007/061156, Feb. 11, 2008, 5 pgs. |
Google Inc., Office Action, CA 2603085, Sep. 18, 2012, 2 pgs. |
Google Inc., Office Action, CA 2610208, Sep. 21, 2011, 3 pgs. |
Google Inc., Office Action, EP 06784449.8, Mar. 26, 2012, 7 pgs. |
Google Inc., Office Action, JP 2008-504204, Oct. 12, 2011, 4 pgs. |
Gray, Entropy and information theory, 1990, 30 pgs. |
Guha, Disambiguating people in search, May 17-2, 2004, 9 pgs. |
Guha, Object co-identification on the semantic web, May 17-22, 2004, 9 pgs. |
Haveliwala, Topic-sensitive pagerank, May 7-11, 2002, 23 pgs. |
Hogue, Examiner's Answer, U.S. Appl. No. 11/142,748, Oct. 3, 2011, 23 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 11/097,689, Apr. 30, 2009, 8 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 11/356,837, Jan. 6, 2012, 12 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 11/356,837, Apr. 27, 2012, 7 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 12/546,578, Jan. 6, 2011, 8 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 12/546,578, Jul. 12, 2011, 10 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 13/206,457, Mar. 14, 2012, 9 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 13/549,361, Oct. 2, 2013, 9 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 13/549,361, Jun. 26, 2013, 8 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 13/603,354, Nov. 12, 2013, 9 pgs. |
Hogue, Notice of Allowance, U.S. Appl. No. 13/603,354, Jun. 26, 2013, 8 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/097,689, Oct. 3, 2008, 13 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/097,689, Apr. 9, 2008, 11 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/097,689, Jun. 21, 2007, 9 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/097,689, Nov. 27, 2007, 10 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Dec. 7, 2007, 13 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Jul. 13, 2010, 12 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Aug. 17, 2009, 14 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Nov. 17, 2010, 14 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, May 18, 2007, 9 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Jul. 22, 2008, 18 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Aug. 23, 2007, 13 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/142,748, Jan. 27, 2009, 17 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Jun. 3, 2011, 18 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Aug. 4, 2010, 20 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Feb. 8, 2011, 14 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, May 11, 2009, 18 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Feb. 19, 2010, 20 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Mar. 21, 2008, 15 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Oct. 27, 2009, 20 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/356,837, Sep. 30, 2008, 20 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Mar. 1, 2012, 25 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Mar. 3, 2011, 15 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Jan. 5, 2009, 21 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Jun. 8, 2009, 14 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Sep. 13, 2010, 13 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Jun. 24, 2011, 14 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Dec. 28, 2009, 11 pgs. |
Hogue, Office Action, U.S. Appl. No. 11/399,857, Mar. 31, 2008, 23 pgs. |
Hogue, Office Action, U.S. Appl. No. 12/546,578, Aug. 4, 2010, 10 pgs. |
Hogue, Office Action, U.S. Appl. No. 13/206,457, Oct. 28, 2011, 6 pgs. |
Hogue, Office Action, U.S. Appl. No. 13/549,361, Oct. 4, 2012, 18 pgs. |
Hogue, Office Action, U.S. Appl. No. 13/549,361, Mar. 6, 2013, 13 pgs. |
Hogue, Office Action, U.S. Appl. No. 13/603,354, Jan. 9, 2013, 5 pgs. |
Hogue, Tree pattern inference and matching for wrapper induction on the world wide web, Jun. 2004, 106 pgs. |
Hsu, Finite-state transducers for semi-structured text mining, 1999. |
Ilyas, Rank-aware query optimization, Jun. 13-18, 2004, 12 pgs. |
Information entropy, Wikipedia, May 3, 2006, 9 pgs. |
Jeh, Scaling personalized web search, May 20-24, 2003, 24 pgs. |
Ji, Re-ranking algorithms for name tagging, Jun. 2006, 8 pgs. |
Jones, Bootstrapping for text learning tasks, 1999, 12 pgs. |
Koeller, Approximate matching of textual domain attributes for information source integration, Jun. 17, 2005, 10 pgs. |
Kolodner, Indexing and retrieval strategies for natural language fact retrieval, Sep. 1983, 31 pgs. |
Kosala, Web mining research, Jul. 2000, 14 pgs. |
Kosseim, Answer formulation for question-answering, Oct. 1, 2007, 11 pgs. |
Laroco, Notice of Allowance, U.S. Appl. No. 11/551,657, May 13, 2011, 8 pgs. |
Laroco, Notice of Allowance, U.S. Appl. No. 11/551,657, Sep. 28, 2011, 8 pgs. |
Laroco, Notice of Allowance, U.S. Appl. No. 13/364,244, Aug. 6, 2013, 6 pgs. |
Laroco, Notice of Allowance, U.S. Appl. No. 13/364,244, Feb. 7, 2014, 5 pgs. |
Laroco, Office Action, U.S. Appl. No. 11/551,657, Aug. 1, 2008, 15 pgs. |
Laroco, Office Action, U.S. Appl. No. 11/551,657, Aug. 13, 2009, 16 pgs. |
Laroco, Office Action, U.S. Appl. No. 11/551,657, Nov. 17, 2010, 20 pgs. |
Laroco, Office Action, U.S. Appl. No. 11/551,657, Feb. 24, 2010, 17 pgs. |
Laroco, Office Action, U.S. Appl. No. 11/551,657, Jan. 28, 2009, 17 pgs. |
Laroco, Office Action, U.S. Appl. No. 13/364,244, Dec. 19, 2013, 5 pgs. |
Laroco, Office Action, U.S. Appl. No. 13/364,244, Jan. 30, 2013, 8 pgs. |
Lin, Question answering from the web using knowledge annotation and knowledge mining techniques, Nov. 3-8, 2003, 8 pgs. |
Liu, Mining data records in web pages, 2000, 10 pgs. |
MacKay, Information theory, inference and learning algorithms, 2003, 15 pgs. |
Mann, Unsupervised personal name disambiguation, 2003, 8 pgs. |
McCallum, Object consolidation by graph partitioning with a conditionally-trained distance metric, Aug. 24-27, 2003, 6 pgs. |
Merriam Webster Dictionary defines “normalize” as “to make conform to or reduce to a norm or standard”, 1865, 2 pgs. |
Merriam Webster Dictionary defines “value” as “a numerical quantity that is assigned or is determined by . . . ”, 1300, 2 pgs. |
Microsoft Computer Dictionary defines “normalize” as “adjust number within specific range”, May 1, 2002, 4 pgs. |
Microsoft Computer Dictionary defines “quantity” as a “number”, May 1, 2002, 4 pgs. |
Microsoft Computer Dictionary defines “value” as a “quantity”, May 1, 2002, 4 pgs. |
Mihalcea, PageRank on semantic networks with application to word sense disambiguation, Aug. 23-27, 2004, 7 pgs. |
Mihalcea, TextRank: bringing order into texts, Jul. 2004, 8 pgs. |
Nadeau, Unspervised named-entity recognition: generating gazetteers and resolving ambiguity, Aug. 1, 2006, 12 pgs. |
Nyberg, The JAVELIN question-answering system at TREC 2003, Nov. 18-21, 2003, 9 pgs. |
Ogden, Improving cross-language text retrieval with human interactions, Jan. 2000, 9 pgs. |
Page, The pagerank citation ranking: bringing order to the web, 1998, 17 pgs. |
Pawson, Sorting and grouping, Feb. 7, 2004, 19 pgs. |
Plaisant, Interface and data architecture for query preview in networked information systems, Jul. 1999, 28 pgs. |
Prager, IBM's piquant in TREC2003, Nov. 18-21, 2003, 10 pgs. |
Prager, Question answering using constraint satisfaction: QA-by-dossier-with-constraints, 2004, 8 pgs. |
Ramakrishnan, Is question answering an acquired skill?, May 17-22, 2004, 10 pgs. |
Richardson, Beyond page rank: machine learning for static ranking, May 23, 2006, 9 pgs. |
Richardson, The intelligent surfer: probabilistic combination of link and content information in pagerank, 2002, 8 pgs. |
Riloff, Learning dictionaries for information extraction by multi-level bootstrapping, 1999, 6 pgs. |
Rohde, Notice of Allowance, U.S. Appl. No. 11/097,690, Dec. 23, 2010, 8 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, May 1, 2008, 21 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, Jun. 9, 2010, 11 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, Oct. 15, 2008, 22 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, Aug. 27, 2009, 13 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, Apr. 28, 2009, 9 pgs. |
Rohde, Office Action, U.S. Appl. No. 11/097,690, Sep. 28, 2007, 17 pgs. |
Shamsi, Final Office Action, U.S. Appl. No. 13/171,296, Nov. 4, 2013, 29 pgs. |
Shamsi, Notice of Allowance, U.S. Appl. No. 11/781,891, Oct. 25, 2010, 7 pgs. |
Shamsi, Notice of Allowance, U.S. Appl. No. 11/781,891, May 27, 2010, 6 pgs. |
Shamsi, Office Action, U.S. Appl. No. 11/781,891, Nov. 16, 2009, 10 pgs. |
Shamsi, Office Action, U.S. Appl. No. 13/171,296, Apr. 3, 2013, 7 pgs. |
Shannon, a mathematical theory of communication, Oct. 1948, 55 pgs. |
Sun Microsystems, Attribute names, Feb. 17, 2004, 2 pgs. |
Vespe, Notice of Allowance, U.S. Appl. No. 11/686,217, Aug. 27, 2012, 11 pgs. |
Vespe, Notice of Allowance, U.S. Appl. No. 11/745,605, Jun. 13, 2011, 9 pgs. |
Vespe, Notice of Allowance, U.S. Appl. No. 11/745,605, Sep. 22, 2011, 9 pgs. |
Vespe, Notice of Allowance, U.S. Appl. No. 11/745,605, Mar. 28, 2012, 10 pgs. |
Vespe, Office Action, U.S. Appl. No. 11/686,217, Sep. 10, 2010, 14 pgs. |
Vespe, Office Action, U.S. Appl. No. 11/686,217, Jan. 26, 2012, 12 pgs. |
Vespe, Office Action, U.S. Appl. No. 11/686,217, Mar. 26, 2010, 13 pgs. |
Vespe, Office Action, U.S. Appl. No. 11/745,605, Apr. 8, 2010, 15 pgs. |
Vespe, Office Action, U.S. Appl. No. 11/745,605, Jul. 30, 2009, 17 pgs. |
Wang, Combining link and contents in clustering web search results to improve information interpretation, 2002, 9 pgs. |
Wirzenius, C preprocessor trick for implementing similar data types, Jan. 17, 2000, 9 pgs. |
Zhao, Corroborate and learn facts from the web, Aug. 12-15, 2007, 9 pgs. |
Zhao, Notice of Allowance, U.S. Appl. No. 11/394,610, May 11, 2009, 15 pgs. |
Zhao, Notice of Allowance, U.S. Appl. No. 11/941,382, Apr. 14, 2014, 5 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/142,853, Oct. 2, 2009, 10 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/142,853, Sep. 5, 2008, 9 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/142,853, Mar. 17, 2009, 9 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/142,853, Jan. 25, 2008, 7 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/394,610, Apr. 1, 2008, 18 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/394,610, Nov. 13, 2008, 18 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Sep. 8, 2011, 28 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Aug. 12, 2010, 23 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, May 24, 2012, 26 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Nov. 26, 2012, 24 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Jan. 27, 2011, 24 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Sep. 27, 2013, 30 pgs. |
Zhao, Office Action, U.S. Appl. No. 11/941,382, Dec. 29, 2009, 25 pgs. |
Notice of Allowance for U.S. Appl. No. 11/394,552, mailed Jul. 31, 2015, 15 Pages. |
Final Office Action for U.S. Appl. No. 13/171,296, mailed Apr. 2, 2015, 31 pages. |
Final Office Action for U.S. Appl. No. 13/732,157, mailed Dec. 24, 2015, 27 Pages. |
Non-Final Office Action for U.S. Appl. No. 13/732,157, mailed May 21, 2015, 9 pages. |
Final Office Action for U.S. Appl. No. 14/151,721, mailed Apr. 16, 2015, 15 pages. |
Final Office Action for U.S. Appl. No. 14/151,721, mailed Feb. 25, 2016, 14 Pages. |
Non-Final Office Action for U.S. Appl. No. 14/151,721, mailed Oct. 16, 2015, 17 pages. |
Notice of Allowance for U.S. Appl. No. 14/194,534, mailed Mar. 23, 2015, 7 pages. |
Final Office Action for U.S. Appl. No. 14/300,148, mailed Jun. 2, 2016, 13 pages. |
Non Final Office Action for U.S. Appl. No. 14/300,148, mailed Jan. 5, 2016, 16 Pages. |
Final Office Action for U.S. Appl. No. 14/457,869, mailed Jun. 1, 2016, 13 Pages. |
Non Final Office Action for U.S. Appl. No. 14/457,869, mailed Jan. 5, 2016, 16 Pages. |
Final Office Action for U.S. Appl. No. 14/463,393, mailed Feb. 12, 2016, 36 pages. |
Non Final Office Action for U.S. Appl. No. 14/463,393, mailed Jun. 26, 2015, 14 Pages. |
Office Action for EP Application No. EP06739646.5, mailed Jul. 1, 2015, 4 Pages. |
Gilster, “Get fast answers, easily”, Newsobserver.com (http://web.archive.org/web/20050308154148/http://newsobserver.com/business/technology/gilster/2003/story/1258931p-7372446c.html), May 14, 2003, 2 pages. |
Katz, et al., “Omnibase: Uniform Access to Heterogeneous Data for Question Answering”, Natural Language Processing and Information Systems, vol. 2553 of the series Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2002, pp. 230-234. |
Kwok, et al., “Scaling question answering to the web”, ACM Transactions on Information Systems, vol. 19, No. 3, Jul. 2001, pp. 242-262. |
Lam, et al., “Querying Web Data—The WebQA Approach”, Proceedings of the 3rd International Conference on Web Information Systems Engineering, IEEE, 2002, pp. 139-148. |
Lopez, et al., “AquaLog: An Ontology-Portable Question Answering System for the Semantic Web”, The Semantic Web: Research and Applications, vol. 3532 of the series Lecture Notes in Computer Science, Springer Berlin Heidelberg, 2005, pp. 546-562. |
Mahlin, et al., “DOrAM: Real Answers to Real Questions”, AAMA'02, ACM, 2002, pp. 792-793. |
Pradhan, et al., “Building a Foundation System for Producing Short Answers to Factual Questions”, Proceedings of the Eleventh Text Retrieval Conference (TREC 2002), NIST Special Publication SP 500-251, 2003, pp. 1-10. |
Number | Date | Country | |
---|---|---|---|
20140372473 A1 | Dec 2014 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11394414 | Mar 2006 | US |
Child | 14460117 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 11142853 | May 2005 | US |
Child | 11394414 | US |