|Publication number||US6944609 B2|
|Application number||US 09/982,204|
|Publication date||Sep 13, 2005|
|Filing date||Oct 18, 2001|
|Priority date||Oct 18, 2001|
|Also published as||US20030078914|
|Publication number||09982204, 982204, US 6944609 B2, US 6944609B2, US-B2-6944609, US6944609 B2, US6944609B2|
|Inventors||Michael J. Witbrock|
|Original Assignee||Lycos, Inc.|
|Export Citation||BiBTeX, EndNote, RefMan|
|Patent Citations (6), Referenced by (80), Classifications (9), Legal Events (4)|
|External Links: USPTO, USPTO Assignment, Espacenet|
This invention relates to using editorial feedback of various Internet objects.
The Internet can be viewed as a large collection of documents, for example, text files, web-pages, newsgroup postings or pictures. Internet search engines provide a means of searching through the vast amount of documents to produce a results list of the documents found which match the terms in a search query. Typically the results list is presented as a list of document summaries that includes hyperlinks (“links”) that connect each entry to the appropriate Internet document. The results list is generally ranked by relevance (in relation to the query), with each entry included in the list presented either higher or lower on the list according to the relevance ranking as determined by the search engine being used. The way in which these relevance rankings are determined is constantly evolving as the Internet continues to evolve.
Search engines apply different algorithms to “filter” the available documents and assign relevance rankings to the documents reviewed. The relevance rankings are generally stored in a search index which corresponds to documents for a specific search term (or related search terms).
Initially, Internet search engines applied “content-based” filtering which is simply examining the number of times that a query search term appeared within a document, such that the greater the number of times that a search term appeared, the more relevant the document was considered and the higher it was ranked. However, content-based filtering produces rankings which are easily manipulated by the author of the documents reviewed, that is, an author can fill their web-page with multiple copies of the words that they believe will be searched upon and thereby increase the alleged relevance of their web-page.
More advanced ranking methods apply “link analysis” algorithms, i.e., examining the links contained within a document to other documents with relatively high relevance rankings. However, as with the manipulation of terms in a web-page, as discussed above, an author can increase the number of links to other documents with high relevance rankings in order to increase the alleged relevance of their web-page.
Editor-controlled search engines use a “staff” of editors (paid or volunteer) to manually select and rank individual web-page documents contained in a results list for a specific search term from a ranked search index. Documents may have their rankings changed, or document may be added and removed from the index over time as the editors perform their reviews. Since there billions of web-page documents available on the Internet, and the number of documents continues to grow at a tremendous pace, the amount of labor needed to maintain a current and complete editor-controlled search index is very high. The Open Directory Project (ODP) is an example of a co-operative editing process that uses a large number of volunteer editors to assess and modify the relevance rankings of documents related to a search term or within a specific category. ODP applies rules to the editor selection process. The end result of ODP is a editor-controlled ranking index that can be searched directly, however, the editorial feedback is not used to improve the efficiency of an automated search engine algorithm.
According to an aspect of this invention a method for producing a results list for a search query includes producing a first results list of entries from a search algorithm, the first results list corresponding to a term in the search query, the first results list being ordered according to relevance rankings, modifying a feature of the first results lists by an editor, the modification being made according to an editorial rule, determining a reliability score for the editor, the reliability score being based upon the modification made the editor, combining the modification made by the editor in a combined search index, the combined modification being included in the combined search index according to the determined reliability of the editor, and using the combined search index to produce a second results list which corresponds to the term in the search query, the second results list being ordered according to relevance rankings.
One or more of the following features may also be included: producing a first results list that includes producing a first results list that corresponds to at least one search term, modifying a feature according to an editorial rule that includes modifying any feature of the first results list, modifying a feature according to an editorial rule that includes modifying an allowed changeable feature, the allowed changeable feature being one or more of relevance ranking, entry addition, entry deletion and document summary, modifying a feature includes modifying a feature within a pre-defined range or percentage, modifying an allowed changeable feature that includes modifying a feature within a pre-defined range or percentage, determining a reliability score that further includes comparing a ranking change for an entry by a first editor to a median ranking change for the entry by a second editor, determining a reliability score that further includes comparing a summary change for an entry to a previous summary contained in the first results list, determining a reliability score that further includes determining a difference in a number or a percentage of click-throughs which result from the editor modification, combining the modification made by the editor that further includes multiplying the reliability score by the feature modification, using the combined results to produce a second results list includes using the combined search index by a search engine and wherein the method is performed at least twice.
According to a further aspect of this invention a method for producing a results list for a search query, the method includes producing a first results list of entries from a search algorithm, the first results list corresponding to a term in a first search query, the first results list being ordered according to relevance rankings, modifying a feature of the first results lists by an editor, the modification being made according to an editorial rule, determining a reliability score for the editor, the reliability score being based upon the modification made the editor, combining the modification made by the editor in a combined search index, the combined modification being included in the combined search index according to the determined reliability of the editor, detecting a difference between the feature contained in the first results list and the corresponding modified feature contained in the combined search index, and determining a rule that corresponds to the detected difference or similarity.
One or more of the following features may also be included: producing a second results list from the search algorithm, the second results list corresponding to the term in the first search query and modifying the second results lists by applying the rule to a feature contained in the second results list, detecting a difference that further includes detecting a change to a relevance ranking feature, detecting a difference that further includes detecting an added feature, detecting a difference that further includes detecting a deleted feature and detecting a difference that further includes detecting a change to a document summary feature.
According to a further aspect of this invention a computer program product residing on a computer readable medium having a plurality of instructions stored thereon which, when executed by the processor, cause that processor to produce a first results list of entries from a search algorithm, the first resultst list corresponding to a term in a search query, the first results list being ordered according to relevance rankings, modify a feature of the first lists according to an editorial rule, determine a reliability score for the editorial modification, the reliability score being based upon the editorial modification, combine the editorial modification in a combined search index, the combined modification being includes in the combined search index according to the reliability score of the editor, and use the combined search index to produce a second results list which corresponds to the term in the search query, the second results lists being ordered according to relevance rankings.
One or more of the following features may also be included: wherein the instructions causing a computer to modify a feature of the first lists according to an editorial rule and further include instructions causing a computer to modify a feature according to an editorial rule, wherein the instruction causing a computer to modify a feature according to an editorial rule and further include instructions causing a computer to modify an allowed changeable feature, the allowed changeable feature being one or more of relevance ranking, entry addition, entry deletion and document summary, wherein the instructions causing a computer to determine a reliability score for the editorial modification and farther include instructions causing a computer to compare a ranking change for an entry by a first editor to a median ranking change for the entry by a second editor.
Embodiments of the invention may have one or more of the following advantages. For example, a combined editorial search index is created that automatically assesses the reliability of each editorial input, which reduces the potential of nefarious editorial input. In some embodiments, a combination of paid and un-paid editors are used in evaluating specific results lists, which further reduces the possibility of nefarious inputs from an editor being included in a search index. Some embodiments apply machine learning techniques to the combined editorial feedback search index, i.e., detecting a change in relevance rankings to a previously generated index for a specific search term, and then determining and storing a rule that reflects the detected change. The stored rule may then be re-played by a search engine, i.e., applying the stored rule to produce a refined results list for the specific search term. The stored rules may also be re-played by a search engine to re-rank results lists for a search term which has not been evaluated by the editorial process.
The details of one or more embodiments of the invention are set forth in the accompanying drawings and the description below. Other features, objects, and advantages of the invention will be apparent from the description and drawings, and from the claims.
Like reference symbols in the various drawings indicate like elements.
The Internet and the World Wide Web can be viewed as a collection of hyperlinked documents with search engines as a primary interface for document retrieval. Search engines (e.g., lycos.com) allow the user to enter a query and perform a search based on that query. A list of potential matches is then generated that provides links to potentially relevant documents.
When user 10 wishes to search for information on a specific topic, user 10 utilizes search engine 20 running on search engine server 22. User 10 enters a search query 24 into search engine 20, which provides a results list 26 of potential sources for information related to the search terms of query 24. Each entry 28 on results list 26 is a document summary for a specific relevant document (i.e., a web-page) 16 on the Internet. These documents 16 may be located on search engine server 22, Internet server 14, or any other server (not shown) on the network 12; and each document is associated with a uniform resource locator (URL) address. Typically, each entry 28 includes a hyperlink, which, when selected causes a display of the document associated with the URL.
When search engine 20 provides list 26 to user 10 in response to query 24, the individual entries in list 26 are arranged in accordance with their perceived level of relevance. Search engine 20 may determine the ranking of the entries 28 on list 26 by examining the documents themselves to determine certain factors, for example, the number of documents linked to the entry, or the presence of the search term within the document itself; etc. The ranking of the entries 28 on list 26 may also be determined from a previously stored search index of rankings in a database 40. As discussed above, a search index may be created by a search engine algorithm or by storing editor-created rankings.
Search engines can further enhance their document ranking accuracy by comparing stored queries (query-to-query relationships) to make suggestions to the user concerning modifications or supplemental search terms that would better tailor the user's query to the specific information they are searching for. Depending on which selection the user makes, the user's search will be appended and tailored accordingly.
An editor may be able to change rankings of an entry, but, only within a pre-defined limit, that is only allowing an editor to move an entry up or down in the rankings by a pre-defined number; or,
An editor may not be able to move an entry which is ranked at a pre-defined percentage above or below another entry; or,
An editor may not be allowed to add an entry to the results list unless the ranking associated with the new entry is at a certain pre-defined level; or,
An editor may not be allowed to change document summaries; or,
An editor may only be allowed to make partial changes to a document summary.
Please realize that the editorial rule process 310 applies a set of rules to control which features of a results list may be modified and how they may be modified.
The editorial changes made to the features of the results list 50 by editors 310A-310N are stored in modified results lists 350A-350N, respectively. Reliability process 320 then applies a set of rules to determine a reliability score for each editor. Reliability process 320 then uses the determined reliability score for each editor together with the changes stored in modified results list 350A-350N to weight the individual feature changes made by each editor into a combined editorial search index 360. The reliability process 320 provides quality control to the process 300, that is, avoiding the input of un-reliable editorial changes, or nefarious inputs (i.e., an editor who has attempted to make changes to favor an entry without good reason). In operation, if the editor maintains a high reliability rating then the changes made by that editor are given more weight in the combined editorial search index 360. For example, reliability process 320 may include determining a reliability score by:
Comparing a ranking change by an editor to the median change made by other editors to the same ranking, and if the difference is greater than a pre-defined limit, then the reliability score of the editor would be lowered; or,
(If a document summary may be changed by an editor) comparing words in the new summary to words in the old summary and if a pre-defined percentage (or number) of words included in the new summary do not match the old summary (or in the document itself) then the reliability score of the editor would be lowered; or,
Comparing how far up or down an entry is moved within results list 50 by an editor to the median movement made to that entry by other editors, and if the movement is greater or lower than the median by a pre-defined limit, then the reliability score of the editor would be lowered; or,
Determining the ‘click-through’ increase or decrease as a result of an editorial change in the results list (i.e., if Internet users actual selections of the links included in a modified entry increase or decrease by a pre-defined limit, then the reliability score of the editor can also be changed.)
Please realize that any heuristic method could be used to rate editorial reliability.
Combined editorial search index 360 may be used directly by search engine to produce other results lists 50 corresponding to the rankings stored in index 360.
Referring now to
an entry has been deleted from results list 50; or,
an entry has been added to combined search index 360; or,
an entry has been lowered in ranking; or,
an entry has been raised in ranking; or,
a summary has been changed.
Machine learning process then determines 374 a rule to reflect the detected change in rankings, and stores that rule 376 for use by search engine 20. For example, for a search term: “Michael Douglas”, the combined editorial search index reflects a change in ranking position from position 10 to position 4 for a document related to “Catherine Zeta-Jones” (with a URL of 117). Machine learning process 370 stores 376 a rule that “URL 117” was promoted from position 10 to position 4 for the search term “Michael Douglas”. If a new results list is produced which includes an entry corresponding to URL 117 at position 10 (or somewhere near position 10), the search engine can apply (“replay”) the stored rule which will cause the entry corresponding to URL 117 to be moved to position 4 within the new results list. Please realize that the stored rule is generally broadened to capture the “intent” of the learned change, i.e., the stored rule above may promote URL 17 to position 4 from a range of other positions, not just from position 10, i.e., promoting URL 117 to position 4 from a positions ranging from 5 to 15.
Results lists may be produced from a single search term, or may be produced from several related terms, i.e., terms that produce a results list that includes a large number of common entries. By grouping results lists into common categories the number of results lists are reduced and the number of editors required to evaluate the results lists is also reduced. Therefore, a group of editor may be assigned to a specific search term, or a category of related terms, so the editors may be registered to that specific term or category and receive notification when new documents are available and require editorial review. Similarly, the machine learning techniques may be applied to learn and store rules based on a common category of queries, i.e., the search term “Michael Douglas” and all search terms considered common to this search term may have a rule applied to a defined category.
Often a small number of search terms are common to a relatively large number of search queries, that is, many users are searching for the most popular related terms. Therefore, for those highly popular terms, the editorial group assigned may include paid editors to augment and supervise the volunteer editorial process. This would allow for a more reliable review of the editorial changes before they are combined and provide for more control of the combined search index.
Now referring to
Now referring to
Typical embodiments of computer readable medium 552 are: hard drive 564; tape drive 566; optical drive 568; RAID array 570; random access memory 572; and read only memory 574.
Now referring to
Processor 600 and memory 602 may be incorporated into a personal computer 610, a network server 612, or a single board computer 614.
A number of embodiments of the invention have been described. Nevertheless, it will be understood that various modifications may be made without departing from the spirit and scope of the invention. Accordingly, other embodiments are within the scope of the following claims.
|Cited Patent||Filing date||Publication date||Applicant||Title|
|US5724571 *||Jul 7, 1995||Mar 3, 1998||Sun Microsystems, Inc.||Method and apparatus for generating query responses in a computer-based document retrieval system|
|US5748954||Jun 5, 1995||May 5, 1998||Carnegie Mellon University||Method for searching a queued and ranked constructed catalog of files stored on a network|
|US6006222||Aug 1, 1997||Dec 21, 1999||Culliss; Gary||Method for organizing information|
|US6014665||Oct 29, 1997||Jan 11, 2000||Culliss; Gary||Method for organizing information|
|US6240408 *||Feb 10, 2000||May 29, 2001||Kcsl, Inc.||Method and system for retrieving relevant documents from a database|
|US6691108 *||Dec 12, 2000||Feb 10, 2004||Nec Corporation||Focused search engine and method|
|Citing Patent||Filing date||Publication date||Applicant||Title|
|US7243102 *||Jul 30, 2004||Jul 10, 2007||Microsoft Corporation||Machine directed improvement of ranking algorithms|
|US7363296 *||Jul 1, 2004||Apr 22, 2008||Microsoft Corporation||Generating a subindex with relevant attributes to improve querying|
|US7428530 *||Jul 1, 2004||Sep 23, 2008||Microsoft Corporation||Dispersing search engine results by using page category information|
|US7472119||Jun 30, 2005||Dec 30, 2008||Microsoft Corporation||Prioritizing search results by client search satisfaction|
|US7562069 *||Jul 14, 2009||Aol Llc||Query disambiguation|
|US7584221||Mar 18, 2004||Sep 1, 2009||Microsoft Corporation||Field weighting in text searching|
|US7599917||Aug 15, 2005||Oct 6, 2009||Microsoft Corporation||Ranking search results using biased click distance|
|US7603616||Oct 13, 2009||Microsoft Corporation||Proxy server using a statistical model|
|US7627568 *||Dec 1, 2009||Micron Technology, Inc.||Method and system for updating a search engine database based on popularity of links|
|US7707201 *||Dec 5, 2005||Apr 27, 2010||Yahoo! Inc.||Systems and methods for managing and using multiple concept networks for assisted search processing|
|US7716198||Dec 21, 2004||May 11, 2010||Microsoft Corporation||Ranking search results using feature extraction|
|US7725463 *||Jun 30, 2004||May 25, 2010||Microsoft Corporation||System and method for generating normalized relevance measure for analysis of search results|
|US7734623||Feb 15, 2007||Jun 8, 2010||Cycorp, Inc.||Semantics-based method and apparatus for document analysis|
|US7739277||Sep 30, 2004||Jun 15, 2010||Microsoft Corporation||System and method for incorporating anchor text into ranking search results|
|US7761448||Sep 30, 2004||Jul 20, 2010||Microsoft Corporation||System and method for ranking search results using click distance|
|US7792833||Apr 26, 2006||Sep 7, 2010||Microsoft Corporation||Ranking search results using language types|
|US7801723||Sep 21, 2010||Palo Alto Research Center Incorporated||Systems and methods for user-interest sensitive condensation|
|US7818314||Oct 19, 2010||Aol Inc.||Search fusion|
|US7827029 *||Nov 2, 2010||Palo Alto Research Center Incorporated||Systems and methods for user-interest sensitive note-taking|
|US7827181||Nov 2, 2010||Microsoft Corporation||Click distance determination|
|US7840569||Nov 23, 2010||Microsoft Corporation||Enterprise relevancy ranking using a neural network|
|US7890500||Jun 11, 2007||Feb 15, 2011||Palo Alto Research Center Incorporated||Systems and methods for using and constructing user-interest sensitive indicators of search results|
|US7979427||Nov 11, 2009||Jul 12, 2011||Round Rock Research, Llc||Method and system for updating a search engine|
|US7987185 *||Dec 29, 2006||Jul 26, 2011||Google Inc.||Ranking custom search results|
|US8005813||Sep 12, 2007||Aug 23, 2011||Aol Inc.||Domain expert search|
|US8005823||Mar 28, 2007||Aug 23, 2011||Amazon Technologies, Inc.||Community search optimization|
|US8051071 *||Nov 1, 2011||Google Inc.||Document scoring based on query analysis|
|US8082246||Jul 1, 2010||Dec 20, 2011||Microsoft Corporation||System and method for ranking search results using click distance|
|US8135737||Mar 24, 2008||Mar 13, 2012||Aol Inc.||Query routing|
|US8185522||May 22, 2012||Google Inc.||Document scoring based on query analysis|
|US8224827||Jul 17, 2012||Google Inc.||Document ranking based on document classification|
|US8239378||Sep 26, 2011||Aug 7, 2012||Google Inc.||Document scoring based on query analysis|
|US8244723||Sep 26, 2011||Aug 14, 2012||Google Inc.||Document scoring based on query analysis|
|US8266143||Sep 11, 2012||Google Inc.||Document scoring based on query analysis|
|US8359309||Feb 7, 2011||Jan 22, 2013||Google Inc.||Modifying search result ranking based on corpus search statistics|
|US8521713||Jul 11, 2011||Aug 27, 2013||Microsoft Corporation||Domain expert search|
|US8577901||Sep 30, 2011||Nov 5, 2013||Google Inc.||Document scoring based on query analysis|
|US8612412 *||May 24, 2007||Dec 17, 2013||International Business Machines Corporation||Searching for a directory in a file system|
|US8639690||Apr 24, 2012||Jan 28, 2014||Google Inc.||Document scoring based on query analysis|
|US8682811||Dec 30, 2009||Mar 25, 2014||Microsoft Corporation||User-driven index selection|
|US8738635||Jun 1, 2010||May 27, 2014||Microsoft Corporation||Detection of junk in search result ranking|
|US8756220||Jan 14, 2013||Jun 17, 2014||Google Inc.||Modifying search result ranking based on corpus search statistics|
|US8768908||Apr 17, 2009||Jul 1, 2014||Facebook, Inc.||Query disambiguation|
|US8812493||Apr 11, 2008||Aug 19, 2014||Microsoft Corporation||Search results ranking using editing distance and document information|
|US8832085||Jul 11, 2011||Sep 9, 2014||Round Rock Research, Llc||Method and system for updating a search engine|
|US8843486||Sep 29, 2009||Sep 23, 2014||Microsoft Corporation||System and method for scoping searches using index keys|
|US8849817||Jun 30, 2011||Sep 30, 2014||Google Inc.||Ranking custom search results|
|US8874591||Jan 31, 2006||Oct 28, 2014||Microsoft Corporation||Using user feedback to improve search results|
|US8930359||Jun 30, 2011||Jan 6, 2015||Google Inc.||Ranking custom search results|
|US9058395||Apr 23, 2012||Jun 16, 2015||Microsoft Technology Licensing, Llc||Resolving queries based on automatic determination of requestor geographic location|
|US9092173 *||Apr 21, 2011||Jul 28, 2015||Adobe Systems Incorporated||Reviewing and editing word processing documents|
|US9183250||Sep 14, 2012||Nov 10, 2015||Facebook, Inc.||Query disambiguation|
|US9317614 *||Jul 30, 2013||Apr 19, 2016||Facebook, Inc.||Static rankings for search queries on online social networks|
|US9342609||Sep 10, 2014||May 17, 2016||Google Inc.||Ranking custom search results|
|US9348912||Sep 10, 2008||May 24, 2016||Microsoft Technology Licensing, Llc||Document length as a static relevance feature for ranking search results|
|US20050015394 *||Jun 29, 2004||Jan 20, 2005||Mckeeth Jim||Method and system for updating a search engine|
|US20050210006 *||Mar 18, 2004||Sep 22, 2005||Microsoft Corporation||Field weighting in text searching|
|US20060004717 *||Jul 1, 2004||Jan 5, 2006||Microsoft Corporation||Dispersing search engine results by using page category information|
|US20060004891 *||Jun 30, 2004||Jan 5, 2006||Microsoft Corporation||System and method for generating normalized relevance measure for analysis of search results|
|US20060116860 *||Nov 30, 2004||Jun 1, 2006||Xerox Corporation||Systems and methods for user-interest sensitive condensation|
|US20060116861 *||Nov 30, 2004||Jun 1, 2006||Palo Alto Research Center||Systems and methods for user-interest sensitive note-taking|
|US20060167896 *||Dec 5, 2005||Jul 27, 2006||Shyam Kapur||Systems and methods for managing and using multiple concept networks for assisted search processing|
|US20060173817 *||Dec 29, 2004||Aug 3, 2006||Chowdhury Abdur R||Search fusion|
|US20070005575 *||Jun 30, 2005||Jan 4, 2007||Microsoft Corporation||Prioritizing search results by client search satisfaction|
|US20070073708 *||Sep 28, 2005||Mar 29, 2007||Smith Adam D||Generation of topical subjects from alert search terms|
|US20070088692 *||Nov 22, 2006||Apr 19, 2007||Google Inc.||Document scoring based on query analysis|
|US20070192313 *||Jan 29, 2007||Aug 16, 2007||William Derek Finley||Data search method with statistical analysis performed on user provided ratings of the initial search results|
|US20070240078 *||Jun 11, 2007||Oct 11, 2007||Palo Alto Research Center Incorporated||Systems and methods for using and constructing user-interest sensitive indicators of search results|
|US20080059456 *||Sep 12, 2007||Mar 6, 2008||Aol Llc, A Delaware Limited Liability Company (Formerly Known As America Online, Inc.)||Domain Expert Search|
|US20080109212 *||Feb 15, 2007||May 8, 2008||Cycorp, Inc.||Semantics-based method and apparatus for document analysis|
|US20080172368 *||Mar 24, 2008||Jul 17, 2008||Aol Llc||Query routing|
|US20080235204 *||Jan 31, 2006||Sep 25, 2008||Microsoft Corporation||Using user feedback to improve search results|
|US20080294600 *||May 24, 2007||Nov 27, 2008||Clark Timothy P||Searching for a Directory in a File System|
|US20090222444 *||Apr 17, 2009||Sep 3, 2009||Aol Llc||Query disambiguation|
|US20100057802 *||Mar 4, 2010||Micron Technology, Inc.||Method and system for updating a search engine|
|US20100299140 *||May 20, 2010||Nov 25, 2010||Cycorp, Inc.||Identifying and routing of documents of potential interest to subscribers using interest determination rules|
|US20110161260 *||Dec 30, 2009||Jun 30, 2011||Burges Chris J||User-driven index selection|
|US20150039596 *||Jul 30, 2013||Feb 5, 2015||Facebook, Inc.||Static Rankings for Search Queries on Online Social Networks|
|WO2007100844A1 *||Feb 27, 2007||Sep 7, 2007||Microsoft Corporation||Training a ranking function using propagated document relevance|
|WO2009014753A2 *||Jul 25, 2008||Jan 29, 2009||U.S. News R & R, Llc||Method for scoring products, services, institutions, and other items|
|U.S. Classification||1/1, 707/E17.108, 707/999.003, 707/999.007|
|Cooperative Classification||Y10S707/99933, Y10S707/99937, G06F17/30864|
|Feb 19, 2002||AS||Assignment|
Owner name: LYCOS, INC., MASSACHUSETTS
Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:WITBROCK, MICHAEL J.;REEL/FRAME:012605/0305
Effective date: 20011221
|Dec 5, 2006||CC||Certificate of correction|
|Mar 13, 2009||FPAY||Fee payment|
Year of fee payment: 4
|Mar 13, 2013||FPAY||Fee payment|
Year of fee payment: 8