Source: http://www.google.com/patents/US20020091688?dq=6,563,928
Timestamp: 2016-05-04 02:39:06
Document Index: 141935181

Matched Legal Cases: ['application No. 09', 'application No.09', 'Application No. 60', 'application No. 09', 'application No. 09', 'application No. 09', 'application No. 09', 'Application No. 60', 'application No. 09', 'application No. 09', 'Application No. 60']

Patent US20020091688 - Computer method and apparatus for extracting data from web pages - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsComputer method and apparatus for extracting information from a Web page is disclosed. The invention apparatus is formed of an extractor coupled to receive Web pages from a source. The extractor uses natural language processing to extract desired information from the Web page. A storage subsystem receives...http://www.google.com/patents/US20020091688?utm_source=gb-gplus-sharePatent US20020091688 - Computer method and apparatus for extracting data from web pagesAdvanced Patent SearchPublication numberUS20020091688 A1Publication typeApplicationApplication numberUS 09/910,169Publication dateJul 11, 2002Filing dateJul 20, 2001Priority dateJul 31, 2000Also published asUS6618717, US6778986, US6983282, US7054886, US7065483, US7356761, US20020032740, US20020052928, US20020059251, US20020138525, WO2002010955A2, WO2002010955A3, WO2002010956A2, WO2002010956A3, WO2002010957A2, WO2002010957A3, WO2002010957A8, WO2002010960A2, WO2002010960A3, WO2002010982A2, WO2002010982A3Publication number09910169, 910169, US 2002/0091688 A1, US 2002/091688 A1, US 20020091688 A1, US 20020091688A1, US 2002091688 A1, US 2002091688A1, US-A1-20020091688, US-A1-2002091688, US2002/0091688A1, US2002/091688A1, US20020091688 A1, US20020091688A1, US2002091688 A1, US2002091688A1InventorsMichel Decary, Jonathan Stern, Kosmas Karadimitriou, Jeremy Rothman-ShoreOriginal AssigneeEliyon Technologies CorporationExport CitationBiBTeX, EndNote, RefManPatent Citations (47), Referenced by (45), Classifications (27), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetComputer method and apparatus for extracting data from web pages
BRIEF DESCRIPTION OF THE DRAWINGS [0066] The foregoing and other objects, features and advantages of the invention will be apparent from the following more particular description of preferred embodiments of the invention, as illustrated in the accompanying drawings in which like reference characters refer to the same parts throughout the different views. The drawings are not necessarily to scale, emphasis instead being placed upon illustrating the principles of the invention. [0067] [0067]FIG. 1 is a flow diagram of an extractor process for processing a document in the preferred embodiment of FIG. 4. [0068] [0068]FIG. 2 is a flow diagram of functions performed during lexical analysis in the extractor process of FIG. 1. [0069] [0069]FIG. 3 is a flow chart of post-processing actions performed on information extracted from a Web page by the extractor of FIG. 1. [0070] [0070]FIG. 4 is a schematic view of a computer system embodying the present invention. [0071] [0071]FIGS. 5a and 5 b are block diagrams of working database records storing infonnation extracted by the extractor of FIG. 1. DETAILED DESCRIPTION OF THE INVENTION [0072] With reference to FIG. 4, a computer system 40 embodying the present invention is composed of the following three major components: [0073] The Crawler 11 [0074] The component referred to as “Crawler” 11 is a software robot that “crawls” the Web visiting and traversing Web sites with the goal of identifying and retrieving pages 12 with relevant and interesting information. [0075] The Extractor 41 [0076] The “Extractor” 41 is the component that performs data extraction on the pages 12 retrieved by the Crawler 11. This data extraction in general is based on Natural Language Processing techniques and uses a variety of rules to identify and extract the relevant and interesting pieces of information. [0077] The Loader 43 [0078] Data produced by the extractor 41 are saved into a database 45 by the “Loader” 43. This component 43 also performs many post-processing tasks to clean-up and refine the data before storing information in database 45. These tasks include duplicate removal, resolving of aliases, correlating data produced from different Web sites, filtering and/or combining information, etc. [0079] In the preferred embodiment, the Crawler 11 is a version of the software robot described in U.S. patent application No. 09/821,908 filed on Mar. 30, 2001 for a “Computer Method and Apparatus for Collecting People and Organization Information from Web Sites” and assigned to the assignee of the present invention. Specific rules are used to identify pages that contain organization information or relevant people information (e.g. name, employment, contact info, etc). For example, pages with a street address of the organization, press release pages, product list pages, pages that contain information about the management team, employee directory, etc. All the interesting pages 12 that the Crawler 11 collects are then passed (through a local storage 48) to the Extractor 41 for further processing and data extraction. [0080] The role of the Extractor 41 is to extract information about people and/or organizations from a single Web page. For people, the extractor 41 has to find all mentions of a person, identify information related to people and associate it with the right person. For organizations, the extractor 41 must identify all occurrences of organization names, identify information related to the organizations and recognize descriptive paragraphs of texts related to an organization. [0081] The original source of data on which the extractor 41 operates is in the form of text (in possibly different formats: plain text, html, rtf, etc.). Alternatively, these texts are converted to a standard format where the boundary of each sentence is clearly located and in which each individual line of text is assigned various types (sentence, header line, copyright notice, other indications of purpose, etc.) and is associated with a series of style elements (bold, underlined, font size, etc). [0082] Before specific data extraction is applied, the text is analyzed with Natural Language Processing (NLP) tools in order to obtain the following information [0083] The part-of-speech (e.g.: noun, verb, etc.) of all words in the text [0084] The position and boundaries of all noun phrases (any succession of nouns and adjectives) in the text. [0085] The semantic type of some or all noun phrases in the text [0086] The syntactic structure of all sentences in the text (e.g.: verbs and their subject, object and complements). [0087] In the preferred embodiment of the present invention, these are obtained through the NLP techniques described in U.S. patent application No.09/585,320 filed on Jun. 2, 2000 for a “Method and Apparatus for Deriving Information from Written Text”. [0088] The Extractor 41 relies on rules and algorithms to identify people and organizations and to identify and link related information. Those rules and algorithms have many possible variations. In general, a variation on a rule or algorithm will result in a trade-off between coverage and accuracy. Depending on the final application for the extracted data, higher accuracy or higher coverage may be desirable. For instance, if the data is used as a database for a general search engine, more coverage is desirable even at the cost of lower accuracy. On the other hand, for instance, if the data is used to create mailing lists, higher accuracy is desirable. Everything that is described hereafter is understood in this context and the description of specific rules and algorithms is done in a general way and are meant to include such variations. [0089] [0089]FIG. 1 illustrates the document processing performed by the Extractor 41 in the preferred embodiment. First, the Extractor 41 transforms the subject document (Web page) into a canonical or standardized form (step 111). The way information about a person or organization is expressed and the meaning of such information varies according to the kind of Web page on which the information appear and, in particular, to the type of section inside a page (e.g.: board of directors, contacts at the end of a press release, staff list, member list, organization URL, stock ticker symbol, organization mission, product description, etc.). The type of a page is obtained through a process described in Invention 3 as disclosed in the related Provisional Application No. 60/221,750 filed on Jul. 31, 2000 for a “Computer Database Method and Apparatus”, now pending as U.S. patent application No. 09/768,869, filed Jan. 24, 2001. However, for a particular page type, it is necessary to recognize different sections within the page and to discover the overall structure of the page. For this, Applicants have devised various methods as follows. [0090] Recursively identifying the page structure: Many pages contain lists of elements often within a hierarchy. Once noun phrase types, specific headers and style tags have been identified, it is possible to deduce the overall structure of the page by recursively looking for patterns using the method described later in step 114. For instance, a page could consist of a list of states, then within each state a list of city, then within each city a list of companies and then within each company, a mailing address and a list of people. This is recognized by first locating the boundary of the smaller most embedded sections by identifying header lines that are more prominent than what follows OR by locating clusters of repeated patterns using the method of Step 114 (discussed later). At this point, clusters and headers at a higher level can then be detected to recognize higher level of hierarchies. Ultimately, this produces a structure of the complete page which can allow, among other things, to attribute the correct semantic type to noun phrases that could not be identified through regular noun phrase classification. [0091] Recognizing Specific Headers: Applicants have devised mechanism to recognize specific headers and specific elements within a page (e.g.: navigation map, copyright notice, index). This mechanism is based on rules that specify specific keywords or family of keywords along with the way those keywords should appear (e.g.: by themselves, preceded by an organization name, at the end of a line, etc.). Some headers will allow to deduce specific special information. [0092] Assigning Style Tags to lines: In order to recognize the structure of a page, it is necessary to recognize that some lines are more prominent than others and that different lines correspond to the same structural element. In order to do this, it is necessary, at least, to compute a style tag for each line on the page (step 112, FIG. 1). Because style elements can ultimately vary for each letter, this tag must be a high level abbreviation of styles found on the line in such a way that similar lines can be compared. The style tag combines, among others, the following information: bold, italic, underline, center, font size, bullet. For each of the first three style elements, at least the first word must be in bold, italics or underlined, respectively, in order for the element to be set to true. The style tag indicates “font size” determined by the biggest size on the line. Other variations are possible as long as interline comparison is meaningful. [0093] After the line type is identified in step 112, Extractor 41 performs a lexical analysis 113 as further illustrated in FIG. 2 and detailed next. [0094] Inside a text, all relevant pieces of information (names of people, titles, names of organizations, phone numbers, fax numbers, addresses, etc.) must be identified as such (step 21, FIG. 2). This is achieved through Natural Language Processing where the text is morphologically analyzed to retrieve all noun phrases and to assign a semantic type to those noun phrases. A similar process is followed for other types of noun phrases that are of interest. For instance, in one preferred embodiment of the invention, this has been done, among others, for: Title, Responsibility, City, State, Country, Educational Institution, Phone Number, e-mail address, etc. Other noun phrase types can also be defined following the same method. [0095] Noun Phrase Detection: With the use of a tagger/disambiguator 23, the lexical analysis 113 recognizes all noun phrases in a text. The noun phrase recognition mechanism is rendered more precise by adding to the dictionary some lexical elements useful for name recognition. Those words are coupled with a corresponding semantic flag: [0096] List of all common first names (SURNAME flag) [0097] List of all common addresses, e.g.: Mr. Ms. Dr., etc. (ADDRESS flag) [0098] List of all common name suffixes, e.g.: jr., III, esq., etc. (NAME_SUFFIX flag) [0099] List of all common organization name identifiers, e.g., Corp., Inc., Ltd., LLC, etc. [0100] List of all common organization name beginning keyword, e.g., Bank, League, Society, Association, etc. [0101] Noun Phrase Typing: With the use of a noun phrase classifier joiner, the lexical analysis 113 identifies all noun phrases that could potentially correspond to a person's or organization's name (step 25). An example noun phrase classifier joiner is disclosed in U.S. patent application No. 09/585,320 filed Jun. 2, 2000, herein incorporated by reference. In order to identify such noun phrases, rules describing the composition of a NAME must be defined. Those rules define what are the different parts of a name and the different order in which they can appear. In the preferred embodiment, names of people have seven possible parts: Address, FirstName, Initial, MiddleName, NameParticle (e.g.: van, de), LastName, NameSuffix. [0102] Names of organizations have specific organization keywords at the end (e.g., Inc., Ltd., LLD, etc.) or at the beginning (e.g., Bank of, Association, League of, etc.) Certain organization names are followed by a respective stock ticker symbol (e.g., “. . . Acme (NASDAQ:ACME) . . . ”). [0103] Each rule describes a possible combination of those parts where such combination can serve as a valid name. Each rule is a succession of “tokens”. Each token specifies 4 things (elements in parenthesis are the symbols used in the preferred implementation): [0104] if the token is optional or not (+ or −) [0105] if the word must be capitalized (C), not capitalized (S) or either way (M) [0106] the semantic type of the word (@ followed by a type), in one implementation, PL stands for pointed letters: 1 or 2 initials followed by a period [0107] the part of the name to which this word corresponds (“!” followed by a part name) [0108] The following is a subset of the rules used in an example implementation +1C@ADDRESS!Address +1C!FirstName −1C@PL!Initial +1C!LastName −1M@NSUF!NameSuffix +1C@ADDRESS!Address +1C!LastName −1M@NSUF!NameSuffix +1C@ADDRESS!Address +1C!FirstName +1C!MiddleName +1C!LastName −1M@NSUF!NameSuffix +1C@SURNAME!FirstName +1C@PL!Initial −1M@NSUF!NameSuffix +1C@SURNAME!FirstName −1C@PL!Initial +1C!LastName −1M@NSUF!NameSuffix +1C@SURNAME!FirstName +1C!MiddleName +1C!LastName −1M@NSUF!NameSuffix +1C!FirstName +1C@PL!Initial +1C!LastName −1M@NSUF!NameSuffix +1C!FirstName +1C!LastName +1M@NSUF!NameSuffix +1C@PL!FirstName +1C!LastName −1M@NSUF!NameSuffix +1C@PL!FirstName +1C!MiddleName +1C!LastName −1M@NSUF!NameSuffix [0109] All unrecognized capitalized noun phrases on a page are compared with all domains on the page. Those domains come from either: e-mail addresses, links, and/or explicit URLs. When a domain is matched, the unknown noun phrase is retyped as being an organization name. Matching is done by scanning each letter of the domain from left to right trying to match at least the first letter of each word in the noun phrase (backtracking if necessary). For instance “Federal Express” will match “FedEx”, “International Business Machines” will match “IBM”. A domain may contain more than one string separated by a period (“.”). For instance “Apple Corporation” will match “info.apple”. Different conditions may be imposed on the match depending on the desired trade-off between coverage and accuracy. In particular, it is possible to allow that not all words in the noun phrase be matched to at least one letter of the domain. For instance, a maximum number of unmatched words may be specified. [0110] Referring now to noun phrase semantics (step 27, FIG. 2), noun phrase joining and splitting are performed where appropriate as follows. [0111] Noun Phrase Joining: In some cases, names of people span across more than one noun phrase. In particular, this is the case when commas “,” appear within a name (e.g.: “John Smith, Jr.”, “Smith, John”). With the use of a noun phrase joiner (see patent application No. 09/585,320 filed on Jun. 2, 2000 for a “Method and Apparatus for Deriving Information from Written Text”), rules have been defined to (i) detect such construction, (ii) join the different parts in a single noun phrase and (iii) assign the correct name part to each word. [0112] Noun Phrase Splitting: In many cases, improper punctuation or irregular format create a situation where the name of a person is immediately followed by a title or something else (e.g.: “John Smith Vice-President”). With the use of a noun phrase splitter (see patent application No. 09/585,320 filed on Jun. 2, 2000 for a “Method and Apparatus for Deriving Information from Written Text”), rules are defined to (i) detect such constructions, (ii) split the noun phrase into two parts at the appropriate point, and (iii) reanalyze the name so that correct name parts are assigned. [0113] In some cases, the rules and algorithms described so far are not sufficient to identify the type of a particular noun phrase. This usually happens when the noun phrase is not surrounded by sufficient evidence. For example, there is not enough evidence to recognize a noun phrase such as “Kobir Malesh” as a NAME if it is not preceded by an address, does not contain a middle initial, and does not contain a known surname. However, analyzing the larger context where this noun phrase appears, it maybe found that it is part of a list that follows a specific pattern, for example: [0114] John Williams, CEO and President, ADA Inc. [0115] Ted Brown, COO, Leda Corp. [0116] Kobir Malesh, President, Round Technologies Corp. [0117] Likewise, some organization names use a different format and may be recognized by a certain pattern. For instance, law firms often have names of the pattern “Name, Name . . . & Name”. [0118] In these cases, identifying the pattern within the text offers a way to assign the proper type to the unknown noun phrase. Thus, step 114 pattern detection follows or is employed with the lexical analysis of step 113 in FIG. 1. [0119] Rules are defined that recognize the repetition of certain line types and noun phrases (for instance a succession of lines where a NAME is followed by a TITLE) and that can reassign the proper type to noun phrases recognized as being part of such a pattern. For the purpose of pattern matching in step 114, only lines without verbs are considered for retyping (not sentences) and any succession of sentences and breaks are considered as one element. A pattern is recognized when at least two combinations of lines, sentences and breaks, with the same number of elements contain the same type of noun phrase in the same position on the same line. Furthermore, many variations are possible depending on the desired trade-off between coverage and accuracy. Those trade-offs concern: [0120] The minimum number of repetitions of the pattern [0121] The maximum number of unknown noun phrases in the pattern [0122] A requirement or not to respect the line style (bold, italic, etc.) [0123] A requirement or not that a pattern element must occur immediately before or after the pattern element in which a noun phrase will be retyped [0124] A requirement or not that a pattern should not occur before the first or after the last recognized pattern (i.e. extending the pattern one element above or below). [0125] Accepting or not, extra lines in a pattern element. [0126] Referring back to FIG. 1, name aliasing monitoring and processing 115 follows pattern detection step 114. Name Aliasing is performed on known names as follows. Once all names have been identified on a page, it is necessary to indicate which names refer to the same entity (person or organization). This is done by comparing all names 2 by 2. Two names are considered referring to the same person if at least the first name or last name matches and no parts present in both are conflicting. Furthermore, first name matching includes (i) identity of names (“Robert”=“Robert”), (ii) Conversion of name to initial (“Robert”=“R.”), (iii) Conversion of name to nickname (“Robert”=“Bob”). When looking for a potential alias for a name, it is preferable to look at other names in the inverse order in which they appeared starting at the name that it is attempted to alias. Information from all aliases of the same name are then combined into one general name (e.g.: “John Smith”+“Mr. Smith”=“Mr. John Smith”). [0127] Organization name aliasing resolves IBM, International Business Machines Corporation, IBM Corp., IBM Corporation, and International Business Machines Corp. to the same organization. This is accomplished first by finding each word in the shorter name within the longer name. Organization identifiers such as Corporation are aliased so that Corp. and Corporation match each other. If all of the words in the shorter string match words in the longer string and in the right order and there are no leftover words in the shorter string, they are said to match (indicate the same organization). If there are leftover words in one string or the other (but not both) that are basic organization identifiers, like Corporation, they are also said to match. [0128] If the names do not match according to the above process, but the shorter name contains an acronym, the aliasing step 115 checks if there is a string of words in the longer name such that one can construct the acronym by taking one or more letters from each word, in the right order. For example, IBM and International Business Machines Corp. or FedEx Corporation and Federal Express Corp. or Digital Equipment Corporation and DEC or American Express and AMEX. If there is such a group of words, the names are said to match. [0129] Name Aliasing for unclassified noun phrases is performed as follows. Names that could not be recognized through normal noun phrase classification 113, pattern detection 114 or special construction can still be discovered by comparing them to the list of names found on the page. The Extractor 41 program looks at all capitalized noun phrases of one to three words that did not receive any semantic type. It then tries to see if any of those could match one of the names found. This is done by considering one word noun phrases as either a first name or last name, 2 words noun phrases as “first name”+“last name”, and, 3 words noun phrases as “first name”+“middle name”+“last name”. It then applies the aliasing mechanism described above. This would allow for instance to link “Kobir” to “Mr. Kobir Malesh”. [0130] Name Rejection: In some cases, names identified through the methods described will not be valid people's name or organization names. Different methods are used to reject names that were recognized by mistake: [0131] Immediate context: for instance names preceded by “the” or “at”
[0159] First noun phrase of first paragraph is clearly an organization name [0160] Main verb is a key description verb in the present tense (e.g.: be, provide, develop, market, produce, create) [0161] Paragraph has key “description” nouns: (e.g.: leader, solution, mission, need, goal, service, product) [0162] For a single page, the organization description is the paragraph with the highest score, plus all immediately preceding and following paragraphs that have been considered. If another organization description already exists (i.e., was previously identified) when a new one is computed, the best one will be chosen according to the following rules: [0163] The description with the highest single paragraph score is chosen [0164] If equal, the description with the highest combined score is chosen [0165] If equal, the longest description is chosen. [0166] Information about a person or organization can also be found outside of its cluster. The following cases are recognized in the preferred embodiment. [0167] If a person's cluster is included inside an organization cluster, then this organization can be attached to titles given for this person. [0168] If a title in the singular form appears immediately before a person cluster and this title is not part of another cluster, it can be included in the cluster. [0169] Continuing with FIG. 1, specific document information is next detected at step 117. Knowing the type of a page (see Invention 3 as disclosed in the related Provisional Application No. 60/221,750 filed on Jul. 31, 2000 for a “Computer Database Method and Apparatus”) enables one to locate information that will affect people and organization records or affect the way clusters are constructed. For instance: [0170] Press release pages generally contain dates that can be used to datestamp information extracted from such pages. [0171] Press release pages generally concern one specific organization. It can be assumed that people mentioned with titles but without an organization name can be linked to this press release organization. [0172] Press release pages often contain a contact section at the end which has a recognizable format. If this contact section mentions a different organization than the organization which is the subject of the press release, it can be assumed that the different organization is a public relation company for the press release organization. [0173] The press release organization can be identified among a list of noun phrase candidates using a Bayesian Engine or heuristics. Relevant tests can make use of the following information: presence in the first sentence of first paragraph, presence in the contact section, number of occurences and aliases, stock ticker symbol matching, subject of verbs like “announced”, following the word “about”, etc. [0174] When pieces of personal information appear in a connected sentence, the logical relationship between each element (e.g.: title, company/organization, date) is expressed through the rules of the English language. In order to understand how those pieces of information are related, Natural Language Processing is employed in information extraction step 118. Sentences are syntactically parsed to obtain lexical frames representing potential relationships between words (see patent application No. 09/585,320 filed on Jun. 2, 2000 for a “Method and Apparatus for Deriving Information from Written Text”). Alternatively, those relationships can also be obtained through other NLP methods such as deterministic parsing. Those syntactical relations (or trees) are then searched for the appearance of pre-defined patterns corresponding to information that is of interest to the Extractor 41. Those patterns are referred to as “Semantic Frames”. [0175] In the preferred embodiment, a list of semantic frames are defined for (a) sentences that express a relationship of employment between a company and a person. This includes, for instance, such semantic frames as “work Subject: [PERSON] as:[TITLE] for: [COMPANY]”, and, (b) sentences that express that a person holds a certain degree, for instance “graduated Subject:[PERSON] from:[INSTITUTION] with:[DEGREE] in:[DISCIPLINE]”. Included in the former are semantic frames that recognize an organization as an object of certain verbs, such as “joined” (as in “. . . joined ACME in 1998”) and “was employed” (as in “. . . was employed by ACME . . . ”). Other semantic frames for other types of personal or organization information can be defined using the same method. Semantic frames can also indicate how the resulting database record 16, 17 should be constructed from elements matching the frame (see patent application No. 09/585,320 filed on Jun. 2, 2000 for a “Method and Apparatus for Deriving Information from Written Text”). Once a sentence has been parsed, all possible semantic frames are applied. Successful matches lead to the creation of database or working records 16, 17 (FIG. 4). [0176] In one embodiment, the database/working records 16, 17 are structured as follows and illustrated in FIGS. 5a and 5 b. There is one working record 16 a, 17 a for each “extracted” person or organization, i.e., extracted data pertaining to an individual or organization, respectively. The working record 16 a in FIG. 5a stores the name of the person using respective fields for a prefix (Dr., Mr., Ms., etc.), first name, middle name, last name and suffix (M.D., Ph.D. . . . ). [0177] Keyed by the person's name are one or more employment records 16 b, i.e., a different employment record 16 b for each position of employment held by the subject person. Each employment record 16 b has a field indicating title of the person's position and corresponding organization's/employer's name and dates that position/title was held. The employment record 16 b also has a flag (bit field) 51 indicating whether this employment record represents the person's primary employment. There are also fields indicating the geographic location of the respective employer (city, state, region) and a link to personal contact data records 16 e for the subject person. The contact data records 16 e include the person's street address, phone number, facsimile number and email address. [0178] Also keyed by the subject person's name are one or more education records 16 c, i.e., a different education record 16 c for each degree earned by the person. Each education record 16 c has a respective field for indicating degree earned, major (or field of study), institution awarding the degree and graduation date. [0179] A copy of the biographical text or original text from which Extractor 41 reaped the information for records 16 a, b, c, e is stored in a record 16 d. Record 16 d is keyed by the subject person's name. [0180] In a like manner for organizations, there is one working record 17 a per subject organization. The main working record 17 a indicates name of the organization, stock ticker symbol (if any) and a unique identification code 19 which links or points to records 16 of individuals associated with the organization. Keyed off the organization name are site records 17 b containing address, phone/fax number and domain URL for each of the various sites of the organization. Product records 17 c hold product information, one record 17 c per product. History records 17 d store organization mission statement, organization description and other historical company information in a time ordered fashion, i.e., a different record 17 d for each different year of the organization's existence. [0181] Other records 16, 17 with other fields of information are suitable. [0182] Returning to FIG. 1, the method described in the above information extraction 118 discussion requires that the sentence be successfully parsed. For some complex sentences, this is difficult to obtain. For this reason, Applicants also provide an alternative method. In that method, a list of rules is created where each rule describes a pattern to be found in a sentence. The pattern consists of a list of tokens where each token is either a noun phrase type or a specific word. Patterns must appear in succession but not necessarily without interruption. For instance: “=COMPANY announced=NAME will join=TITLE” would match the sentence “Acme Pluming inc. yesterday announced that Mr. John will join our company as Vice-President of sales”. Each pattern also comprises information about how the resulting database record 16, 17 should be constructed from elements matching the working pattern. This includes, for example, a record type and a field name or position for all matching elements. [0183] Finally, some information of interest within sentences are not expressed through syntax but simply by concatenating pieces of information with the use of punctuation. For instance, “Mr. John Smith, President, Acme inc., will give a talk . . . ”. Rules are employed to recognize such occurrences. Those rules are sensitive to the succession of specific noun phrase types and punctuation within a sentence. [0184] A person's or organization's name can appear along with relevant information on a non-sentence line separated by punctuation or formatting characters or within a succession of lines. Different methods have been devised by Applicants to construct desired database records 16, 17 from those cases. [0185] In particular, a series of rules are utilized to express how pertinent information can appear. Those rules state the type and order of noun phrases and how to create the corresponding database records 16, 17. For instance, the succession in three different lines of a NAME, then a TITLE, and then a COMPANY can allow the creation of a work record comprising those 3 elements. Within some specific header or some specific groups of lines (as recognized through the methods described in step 111), it is possible to know with more accuracy how the information is going to be presented. Rules similar to the rules presented are then written but those rules only apply to specific sections. [0186] Exemplary pseudo code for information extraction 118 in the preferred embodiment is as follows. Information Extraction 118 FOR_EACH line Li in the document that is part of a cluster for at least 1 person or organization IF Li is part of a cluster for more than 1 person/organization Divide line into parts corresponding to each person/organization END_IF IF Li is a sentence Associate information to person/organization by establishing relationship between elements in the sentence By parsing: Parse the sentence Extract information from sentence by associating syntactic relationship with semantic relationship By pattern matching: Look for special patterns of specific words and semantic types in the sentence and associate information with person/organization Identify if information is past or present ELSE Associate relevant items of information to person/organization (e.g. title, stock ticker symbol, address, phone number, etc) END_IF END_FOR [0187] Further it is useful to associate a list 17 e (FIG. 5b) of keywords to a particular organization. This enables searches for organizations operating in certain domains or related to certain activities or products. In a preferred embodiment, keywords describing an organization are computed by calculating the recurrence of all noun phrases within interesting pages or all pages. As a function of the trade-off between coverage and accuracy some or all of the following rules are activated: [0188] Pages used for keyword searching: [0189] All pages for which a potential organization description was found are used, OR/AND [0190] all pages mentioning the organization name are used, OR/AND [0191] all other pages are used [0192] Keywords to retain for computation: [0193] all noun phrases that occur more than n times on a page, OR/AND [0194] all noun phrases with at least n words [0195] Keywords to retain at the end of the process: [0196] the n most frequent keywords, OR/AND [0197] all keywords that appear more than n times, OR/AND [0198] all keywords that appear on n pages or more, OR/AND [0199] all keywords [0200] Furthermore, the list 17 e of keywords may be complemented by the list of keywords appearing in meta-tags on the organization Web site. [0201] Continuing with FIG. 1, post-processing 119 follows information extraction 118. Methods and algorithms described above extract “literal” information. That is, information that is explicit in the page and where elements of information are very close to one another (within the same sentence or within the same immediate group of lines). However, in many cases, relevant information can be deduced from a larger context. Applicants have discovered various methods to identify such information in post-processing step 119 illustrated in detail in FIG. 3 and discussed next. [0202] Beginning with step 31 certain title modifiers are removed and record 16, 17 tense is affected. As information is extracted on a noun phrase basis, certain adjectival modifiers might be present at the beginning of a title. Such modifiers are inspected and depending on their meaning are: [0203] simply removed (for instance, “Excellent Director of Marketing”) [0204] removed, affecting the record time field (for instance, “Former President”) [0205] left (for instance, “Robotic Division Manager”) [0206] Next organization names are detected in extracted job title information (step 33). That is, as information is extracted on a noun phrase basis, organization names might be included at the beginning of titles (for instance: “Acme President” and “International Robotic Association Vice-President of public relations”). Those names are recognized and separated at step 33. This is done by evaluating different split points in the title and attempting to identify the string resulting from such a split as an organization name by (a) matching with other occurrences of organization names on the page or site, (b) recognizing an organization name through semantic typing rules, (c) matching with a list of names of well-known organizations, or (d) matching the organization name against domain names appearing in URLs on the page. [0207] Connecting people with company/organization through page type and headers is performed at step 35 (FIG. 3). When a page contains a list of names of people working for a certain organization, the organization will often be mentioned only once or not at all (in the case where those people work for the organization on the Web site in which this page was found). To that end, people can be linked to the correct organization through different methods as follows: [0208] (a) By recognizing the page as a staff list with the use of a Bayesian engine (see Invention 3 as disclosed in the related Provisional Application No. 60/221,750 filed on Jul. 31, 2000 for a “Computer Database Method and Apparatus”). In that case, the post-processing program 119 can assume that all people with titles mentioned on the page work for the organization to which the Web site belongs. [0209] (b) By identifying (through the method described in step 111 of FIG. 1) that the list(s) of people names is/are headed by an organization name. People can then be associated with the organization whose name is in this header. [0210] (c) By recognizing special “staff” headers through the method described in step 111 of FIG. 1. Those headers can vary in nature and can also help in distinguishing between different kinds of roles within an organization (e.g.: “Board of directors”, “Executive Officers”, etc.). [0211] (d) Connecting people with organizations in Press Release: Typically, when a press release concerns an organization, the organization is mentioned in the first sentence. Often, people connected with this organization will be mentioned later in the text without mentioning again the organization name. Extracted names of people can be then connected to the organization mentioned in the press release (as long as the document is identified as a press release and the person is mentioned with a title but without an organization). [0212] (e) Connecting people with organization through e-mail: Often, an e-mail address can be attached to a person's name but no corresponding organization name can be found through the above methods. In that case, if the domain in the email address can be matched with any of the organization names that appear on that page (or an abbreviation of such names) the person is linked to the corresponding organization at step 35 (FIG. 3). [0213] Deducing organization names in biographical texts follows in step 37 of FIG. 3. When a paragraph of text describes the history of a person at an organization, normally the organization name will not be repeated in each sentence but can be assumed from the context. Applicants have devised a method to establish a logical relation across different sentences in a text in order to identify such occurrences. This method relies on the type and tense of the verb in each sentence and on the presence of particular adverbs and dates. For instance if sentence A states that a person worked (in the past) at a certain organization X and sentence B states that the same person was promoted (passive tense) to a certain position, it can be assumed that the organization in sentence B is X. Further evidence can be obtained by the presence of some adverbs (e.g.: “then”, “later”, etc.) and dates (e.g.: “in September 98”). In the preferred embodiment, Applicants utilize rules that express those cases. Those rules express conditions to be found in pairs of sentences. [0214] Once all information for a person or organization has been extracted from a page, it is necessary to identify which of the different elements of information is the most important for this person/organization (e.g.: which title is the main title for this person or which occupation is the current most important one, or which name is the current one for this organization). Also, when there is a chronology of past employment or company history, it is necessary to order this information. This is accomplished at step 39 (FIG. 3) as follows. [0215] First the main record 16, 17 is identified. This is based on a certain order of preference: [0216] information on lines is preferred to information in sentences [0217] information on more prominent lines is preferable [0218] present tense sentences are preferred to past [0219] explicit information is preferred to deduced information [0220] Next, the chronology is established. It cannot be assumed that a biography will present the order of employment in a strict uniform fashion. Biographical texts must be analyzed to differentiate between different styles. In the preferred embodiment, step 39 does this in two prongs. In one prong, an ordering of employment at each different organization is made. This may be from (i) past to present, or, (ii) from present to past. This only indicates the general order of groups of sentences related to the same organization but not the order within each paragraph. [0221] In the second prong, step 39 places in order the extracted titles or the subject person within the same organization. Each paragraph or group of lines can use a different style and different paragraphs within the same biographies can have different styles. There are three possibilities: (i) from most recent, (ii) from least recent, (iii) the first sentence is the most recent position but then it continues with the least recent and onwards. [0222] Rules for establishing this chronology are based on keywords (e.g.: “started”, “joined”, “later”, etc.), explicit dates, and sentence construction (e.g.: “X came from Acme where . . . ”). Similarly, chronology of organizations history (events) is established through respective rules based on keywords, explicit dates and sentence construction. [0223] Information extracted through the processes described here will contain a certain proportion of errors. Those errors can be due to a variety of sources such as orthographic and grammatical mistakes in documents, non-standard document formats, highly complex documents, etc. Many methods to detect and possibly correct errors are employed in the post-processing phase 119. This includes among others: (i) reformatting and standardization of titles, (ii) reformatting and standardization of organization names. [0224] Furthermore, because various methods are used to locate and link information and because each method can have different trade-offs between coverage and accuracy, it is possible to associate a confidence level with all pieces of information with the collection of information within a record 16, 17 (FIG. 4). This level of confidence can be used to establish a rank between different records 16, 17 or to reject or hide certain records 16, 17. [0225] Referring back to FIG. 4, the loader 43 is responsive to the working records 16, 17 produced by Extractor 41. In the preferred embodiment, loader 43 identifies whether two records 16 relate to the same person at the same current position or whether two records 17 relate to the same organization. In addition, it is very common in a language to use different words and abbreviations that basically mean the same thing. In order for the loader 43 to properly identify people and organizations and to collect all relevant data about them it is necessary to identify and resolve all such aliases, a process called aliasing resolution. The loader 43 accomplishes detection/ deletion of effectively duplicate records 16, 17 and aliasing resolution of people names, organization names and titles as follows. [0226] Each individual person can appear in multiple locations on the Web, either on several pages within a Web site or on multiple Web sites. In order to provide the maximum value in the results database 45 (FIG. 4), these different references must be combined so that all of the information about a person can be presented. [0227] The first step towards identifying two people as being the same actual person is to match the names. A name consists of five parts: a prefix (Mr., Ms., Dr., etc.), a first name (Jennifer, Jen, William, Bill, etc.), a middle name (Alex, A., etc.), a last name (Johnson, Smith, Jones, etc.), and a suffix (Jr., Sr., III, etc.). [0228] In order for two given names of individuals to match, the last name must match exactly. The first names must either match exactly, or they must be valid aliases or “nicknames” for each other (Jim and James, for example). A list of valid first name aliases compiled from U.S. Census data is employed by loader 43. [0229] The prefix, suffix, and middle names must not conflict, but do not necessarily need to match. This means that if one of the given names has one of these fields, but the other does not, they can match. So, Mr. Jean Smith and Jean A. Smith III are valid matches, but Mr. Jean A. Smith and Ms. Jean A. Smith are not. Similarly, abbreviations can be matched, so Jean Angus Smith and Jean A. Smith match. [0230] Once a potential match has been identified, the organization names as stored in corresponding employment records 16 b must be compared to see if they match. Many organizations will have two people with the same name, so a match between the organization names and the person's name is not a 100% guarantee that they are the same person. However, the odds that both people will be found on the Internet by this system are low, so they can generally be considered to be the same person. Errors of this nature are considered acceptable. [0231] Matching two given organization names is complicated, since IBM, International Business Machines Corporation, IBM Corp., IBM Corporation, and International Business Machines Corp. are all the same organization. The first step is to find each word in the longer name within the smaller name. Organization identifiers such as “Corporation” must be aliased so that “Corp.” and “Corporation” match each other. If all of the words in the longer string match words in the shorter string in the right order and there are no leftover words in the shorter string, they can be said to match. If there are leftover words in one string or the other (but not both) that are basic organization identifiers, like “Corporation”, they can also be said to match. [0232] If the loader 43 does not produce a match, but the shorter name contains an acronym or a word with all capital letters, the loader 43 checks if there is a string of words in the longer name that (i) start with those letters, in order or that (ii) one can construct the acronym by taking one or more letters from each word in the right order. For example, IBM and International Business Machines Corp. or American Express and AMEX. If there is such a group of words, the given strings can be said to match. [0233] Another test for organization name matching is to compare the organization Web site domains, if known. For example, if www.dragon.com is the Web site domain for both Dragon Systems Inc. and DSI, then it can be inferred that DSI is probably an alias of Dragon Systems Inc (the smaller string is usually considered to be an alias of the longer string). [0234] A person in their lifetime can be associated with several organizations. Because information on the Internet can be dated, it is important to compare all organizations that a person has worked for when trying to find a match in organizations. [0235] Locale can also be a factor in matching organizations. Many peoples' organizations are mentioned in relation to their geographical location (“The Internet is extraordinary,” said Jonathan Stern, CEO of Corex Technologies in Cambridge, Mass.). If locale information for the organization is available, it must not conflict. So, “Corex” matches “Corex in Cambridge, Mass.” and “Corex in Massachusetts”, but “Corex in Trenton, N.J.” does not match “Corex in Massachusetts”. [0236] Titles can also be written in different ways yet mean basically the same. For example Vice President and VP are completely interchangeable. The loader program 43 contains a list of common shorthand for titles including: VP, CEO (for Chief Executive Officer), CIO (Chief Information Officer), etc. [0237] In addition, words within the title can shuffle without changing the meaning for example: Vice President of Marketing or Marketing VP, Director of Quality Assurance and QA Director. Titles are aliased if they have identical meaning in English, as defined by the Extractor 41. [0238] The problem can be even bigger when the title is paraphrased. For example the title President and title CEO are interchangeable in many small companies, the title Manager and the title Director are many times swapped. For this reason, the loader program 43 also contains a list of titles that are likely to be swapped. [0239] At the database 45 level, the same process used to conclude that two given organizations are the same can be used to tie a person to an organization as well as to another person. Information about an organization is also stored in the database 45, including the host name, the location of the organization, a description, etc. By storing the database id 19 (FIGS. 5a, 5 b) of the organization that the person works for, sophisticated queries can be run that will search for people based on the organization they work for, in addition to information about the person itself. For example, assume that a person in the database 45, John Smith, is a software engineer who works for Dragon Systems, a speech recognition software company. A search can be performed for software engineers who work for companies involved in speech recognition, even if nowhere in the information about John Smith himself does it mention speech recognition. [0240] While this invention has been particularly shown and described with references to preferred embodiments thereof, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the invention encompassed by the appended claims. [0241] For example, the term “organization” is meant to refer to various entities such as companies, business entities, non-profit groups, associations, etc. As such, individuals associated with any such organizations may be employees, staff, officers, members, and so forth. The foregoing discussion is understood to encompass these roles/positions and broader interpretations of the terms “organization” and “employment” or relationship to an organization. [0242] The Loader 43 may also normalize the extracted data before storing records 16, 17 in database 45. Normalizing includes case usage (upper case letters versus lower case letters), punctuation, usage of special characters, spacing and the like. [0243] It is understood that the various described modules (crawler 11, extractor 41 and loader 43) may be implemented in various combinations, architectures and the like. Distributed processing, network processing and so forth may execute these modules. Likewise the above-described fimctions and operations in the preferred embodiment of extractor 41 and loader 43 are for purposes of illustration and not limitation. Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4270182 *Dec 30, 1974May 26, 1981Asija Satya PAutomated information input, storage, and retrieval systemUS5319777 *Oct 16, 1990Jun 7, 1994Sinper CorporationSystem and method for storing and retrieving information from a multidimensional arrayUS5764906 *Nov 7, 1995Jun 9, 1998Netword LlcUniversal electronic resource denotation, request and delivery systemUS5813006 *May 6, 1996Sep 22, 1998Banyan Systems, Inc.On-line directory service with registration systemUS5835905 *Apr 9, 1997Nov 10, 1998Xerox CorporationSystem for predicting documents relevant to focus documents by spreading activation through network representations of a linked collection of documentsUS5895470 *Apr 9, 1997Apr 20, 1999Xerox CorporationSystem for categorizing documents in a linked collection of documentsUS5918236 *Jun 28, 1996Jun 29, 1999Oracle CorporationPoint of view gists and generic gists in a document browsing systemUS5923850 *Jun 28, 1996Jul 13, 1999Sun Microsystems, Inc.Historical asset information data storage schemaUS5924090 *May 1, 1997Jul 13, 1999Northern Light Technology LlcMethod and apparatus for searching a database of recordsUS6052693 *Jul 2, 1996Apr 18, 2000Harlequin Group PlcSystem for assembling large databases through information extracted from text sourcesUS6065016 *Aug 6, 1996May 16, 2000At&T CorporationUniversal directory serviceUS6076088 *Feb 6, 1997Jun 13, 2000Paik; WoojinInformation extraction system and method using concept relation concept (CRC) triplesUS6094653 *Dec 29, 1997Jul 25, 2000Nec CorporationDocument classification method and apparatus thereforUS6112203 *Apr 9, 1998Aug 29, 2000Altavista CompanyMethod for ranking documents in a hyperlinked environment using connectivity and selective content analysisUS6122647 *May 19, 1998Sep 19, 2000Perspecta, Inc.Dynamic generation of contextual links in hypertext documentsUS6128613 *Apr 29, 1998Oct 3, 2000The Chinese University Of Hong KongMethod and apparatus for establishing topic word classes based on an entropy cost function to retrieve documents represented by the topic wordsUS6212552 *Jan 15, 1998Apr 3, 2001At&T Corp.Declarative message addressingUS6253198 *May 11, 1999Jun 26, 2001Search Mechanics, Inc.Process for maintaining ongoing registration for pages on a given search engineUS6260033 *Nov 16, 1998Jul 10, 2001Curtis M. TatsuokaMethod for remediation based on knowledge and/or functionalityUS6266664 *Oct 1, 1998Jul 24, 2001Rulespace, Inc.Method for scanning, analyzing and rating digital information contentUS6269369 *Nov 2, 1997Jul 31, 2001Amazon.Com Holdings, Inc.Networked personal contact managerUS6301614 *Nov 2, 1999Oct 9, 2001Alta Vista CompanySystem and method for efficient representation of data set addresses in a web crawlerUS6314409 *Oct 26, 1998Nov 6, 2001Veridian Information SolutionsSystem for controlling access and distribution of digital propertyUS6336108 *Dec 23, 1998Jan 1, 2002Microsoft CorporationSpeech recognition with mixtures of bayesian networksUS6336139 *Jun 3, 1998Jan 1, 2002International Business Machines CorporationSystem, method and computer program product for event correlation in a distributed computing environmentUS6349309 *May 24, 1999Feb 19, 2002International Business Machines CorporationSystem and method for detecting clusters of information with application to e-commerceUS6377936 *Jan 27, 2000Apr 23, 2002At&T Corp.Method for performing targeted marketing over a large computer networkUS6389436 *Dec 15, 1997May 14, 2002International Business Machines CorporationEnhanced hypertext categorization using hyperlinksUS6418432 *Apr 9, 1997Jul 9, 2002At&T CorporationSystem and method for finding information in a distributed information system using query learning and meta searchUS6463430 *Jul 10, 2000Oct 8, 2002Mohomine, Inc.Devices and methods for generating and managing a databaseUS6466940 *Feb 11, 1998Oct 15, 2002Dudley John MillsBuilding a database of CCG values of web pages from extracted attributesUS6493703 *May 11, 1999Dec 10, 2002Prophet Financial SystemsSystem and method for implementing intelligent online community message boardUS6529891 *Dec 23, 1998Mar 4, 2003Microsoft CorporationAutomatic determination of the number of clusters by mixtures of bayesian networksUS6553364 *Sep 28, 1999Apr 22, 2003Yahoo! Inc.Information retrieval from hierarchical compound documentsUS6556964 *Jul 23, 2001Apr 29, 2003Ihc Health ServicesProbabilistic system for natural language processingUS6601026 *Sep 17, 1999Jul 29, 2003Discern Communications, Inc.Information retrieval by natural language queryingUS6618717 *Nov 1, 2000Sep 9, 2003Eliyon Technologies CorporationComputer method and apparatus for determining content owner of a websiteUS6640224 *Feb 4, 2000Oct 28, 2003International Business Machines CorporationSystem and method for dynamic index-probe optimizations for high-dimensional similarity searchUS6654768 *Apr 16, 2002Nov 25, 2003Onepin, LlcMethod and apparatus for storing and retrieving business contact information in a computer systemUS6668256 *Jan 19, 2001Dec 23, 2003Autonomy Corporation LtdAlgorithm for automatic selection of discriminant term combinations for document categorizationUS6675162 *May 7, 2001Jan 6, 2004Microsoft CorporationMethod for scanning, analyzing and handling various kinds of digital information contentUS6697793 *Mar 2, 2001Feb 24, 2004The United States Of America As Represented By The Administrator Of The National Aeronautics And Space AdministrationSystem, method and apparatus for generating phrases from a databaseUS6745161 *Jul 10, 2000Jun 1, 2004Discern Communications, Inc.System and method for incorporating concept-based retrieval within boolean search enginesUS6859797 *Mar 9, 2000Feb 22, 2005Sanyo France Calculatrices Electroniques, S.F.C.E.Process for the identification of a documentUS20010009017 *Feb 21, 2001Jul 19, 2001Alexandros BilirisDeclarative message addressingUS20030221163 *Feb 21, 2003Nov 27, 2003Nec Laboratories America, Inc.Using web structure for classifying and describing web pagesUS20030225763 *Apr 14, 2003Dec 4, 2003Microsoft CorporationSelf-improving system and method for classifying pages on the world wide web* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS7100117 *Nov 13, 2000Aug 29, 2006Lg Electronics Inc.Data information display method of data broadcasting receiver and apparatus thereofUS7215757Oct 21, 2004May 8, 2007Sbc Services, Inc.System and method to provide automated scripting for customer service representativesUS7228496 *Jul 8, 2003Jun 5, 2007Kabushiki Kaisha ToshibaDocument editing method, document editing system, server apparatus, and document editing programUS7305612 *Mar 31, 2003Dec 4, 2007Siemens Corporate Research, Inc.Systems and methods for automatic form segmentation for raster-based passive electronic documentsUS7409393Jul 28, 2004Aug 5, 2008Mybizintel Inc.Data gathering and distribution systemUS7669119 *Feb 23, 2010Alexa InternetCorrelation-based information extraction from markup language documentsUS7672833Mar 2, 2010Fair Isaac CorporationMethod and apparatus for automatic entity disambiguationUS7725476Jun 14, 2005May 25, 2010International Business Machines CorporationSystem and method for automated data retrieval based on data placed in clipboard memoryUS7849093Oct 14, 2005Dec 7, 2010Microsoft CorporationSearches over a collection of items through classification and display of media galleriesUS7954053Jan 6, 2010May 31, 2011Alexa InternaetExtraction of datapoints from markup language documentsUS8230323 *Jul 24, 2012Sra International, Inc.Content distribution system and methodUS8244726 *Aug 14, 2012Bruce MatessoComputer-aided extraction of semantics from keywords to confirm match of buyer offers to seller bidsUS8630996 *May 5, 2005Jan 14, 2014At&T Intellectual Property I, L.P.Identifying duplicate entries in a historical databaseUS8706723 *Jun 22, 2011Apr 22, 2014Jostle CorporationName-search system and methodUS8793152 *May 20, 2010Jul 29, 2014Joseph Ruston BishopMining of distributed scientific data for enriched product/contact valuationUS9069860Jan 27, 2014Jun 30, 2015Semantic Search Technologies LlcComputer-aided extraction of semantics from keywords to confirm match of buyer offers to seller bidsUS9092524 *Oct 12, 2011Jul 28, 2015Microsoft Technology Licensing, LlcTopics in relevance ranking model for web searchUS20020194379 *Apr 23, 2001Dec 19, 2002Bennett Scott WilliamContent distribution system and methodUS20040010755 *Jul 8, 2003Jan 15, 2004Shinichiro HamadaDocument editing method, document editing system, server apparatus, and document editing programUS20040194035 *Mar 31, 2003Sep 30, 2004Amit ChakrabortySystems and methods for automatic form segmentation for raster-based passive electronic documentsUS20040205484 *May 1, 2002Oct 14, 2004Pennington Stanford E.System and method for dynamically generating customized pagesUS20050053224 *Oct 21, 2004Mar 10, 2005Sbc Services, Inc.System and method to provide automated scripting for customer service representativesUS20060026114 *Jul 28, 2004Feb 2, 2006Ken GregoireData gathering and distribution systemUS20060036609 *Aug 10, 2005Feb 16, 2006Saora Kabushiki KaishaMethod and apparatus for processing data acquired via internetUS20060123000 *Dec 2, 2005Jun 8, 2006Jonathan BaxterMachine learning system for extracting structured records from web pages and other text sourcesUS20060190979 *Apr 21, 2006Aug 24, 2006Chwa Duk CData information display method of data broadcasting receiver and apparatus thereofUS20060212305 *Sep 23, 2005Sep 21, 2006Jobster, Inc.Method and apparatus for ranking candidates using connection information provided by candidatesUS20060212448 *Mar 18, 2005Sep 21, 2006Bogle Phillip LMethod and apparatus for ranking candidatesUS20060253426 *May 5, 2005Nov 9, 2006Sbc Knowledge Ventures LpIdentifying duplicate entries in a historical databaseUS20070067285 *Sep 22, 2005Mar 22, 2007Matthias BlumeMethod and apparatus for automatic entity disambiguationUS20070088678 *Oct 14, 2005Apr 19, 2007Microsoft CorporationFinding and displaying galleries for users of searchUS20070206757 *May 8, 2007Sep 6, 2007Pennington Stanford E JrSystem and method to provide automated scripting for customer service representativesUS20070294646 *Nov 29, 2006Dec 20, 2007Sybase, Inc.System and Method for Delivering Mobile RSS ContentUS20080065737 *Aug 3, 2006Mar 13, 2008Yahoo! Inc.Electronic document information extractionUS20100107055 *Jan 6, 2010Apr 29, 2010Orelind Greger JExtraction of datapoints from markup language documentsUS20100299184 *May 20, 2010Nov 25, 2010Joseph Ruston BishopMining of distributed scientific data for enriched product/contact valuationUS20110314001 *Jun 18, 2010Dec 22, 2011Microsoft CorporationPerforming query expansion based upon statistical analysis of structured dataUS20120030200 *Feb 2, 2012Microsoft CorporationTopics in relevance ranking model for web searchUS20120330947 *Dec 27, 2012Jostle CorporationName-Search System and MethodUS20130191391 *Jul 23, 2012Jul 25, 2013Cbs Interactive, Inc.Personalization engine for building a dynamic classification dictionaryUS20140207733 *Mar 24, 2014Jul 24, 2014Willow Acquisition CorporationSystem and method for collecting and processing dataUS20140280114 *Mar 15, 2013Sep 18, 2014Google Inc.Question answering using entity references in unstructured dataEP1669896A2 *Nov 24, 2005Jun 14, 2006Panscient Pty Ltd.A machine learning system for extracting structured records from web pages and other text sourcesWO2007038292A2 *Sep 22, 2006Apr 5, 2007Fair Isaac CorporationMethod and apparatus for automatic entity disambiguationWO2007038292A3 *Sep 22, 2006Apr 16, 2009Fair Isaac CorpMethod and apparatus for automatic entity disambiguation* Cited by examinerClassifications U.S. Classification1/1, 707/E17.108, 707/E17.109, 707/999.006International ClassificationG06F15/16, G06F7/00, G09G5/00, G06F15/00, G06N5/04, G06F15/18, A61C13/09, A61C13/00, G06F17/00, G06F17/30Cooperative ClassificationY10S707/99937, Y10S707/99945, Y10S707/99943, Y10S707/99948, Y10S707/959, Y10S707/99933, Y10S707/99936, Y10S707/99935, G06F17/30864, G06F17/30867European ClassificationG06F17/30S, G06F17/30W1F, G06F17/30W1Legal EventsDateCodeEventDescriptionJul 28, 2004ASAssignmentOwner name: ELIYON TECHNOLOGIES CORPORATION, MASSACHUSETTSFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:DECARY, MICHEL;STERN, JONATHAN;KARADIMITRIOU, KOSMAS;ANDOTHERS;REEL/FRAME:014917/0074Effective date: 20040722May 5, 2005ASAssignmentOwner name: ZOOM INFORMATION INC., MASSACHUSETTSFree format text: CHANGE OF NAME;ASSIGNOR:ELIYON TECHNOLOGIES CORPORATION;REEL/FRAME:016182/0815Effective date: 20041126Sep 5, 2006CCCertificate of correctionJul 2, 2009FPAYFee paymentYear of fee payment: 4Sep 5, 2013FPAYFee paymentYear of fee payment: 8RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services