Method and system for search engine enhancement

• US 20070088683A1
• Filed: 08/03/2005
• Published: 04/19/2007
• Est. Priority Date: 08/03/2004
• Status: Abandoned Application

• Current Assignee: Dan Kikinis, Gene Feroglia, Vladimir Lipkin
• Original Assignee: Dan Kikinis, Gene Feroglia, Vladimir Lipkin
• Inventors: Kikinis, Dan, Feroglia, Gene, Lipkin, Vladimir
• Application Number:
  US11/197,482
• Publication Number:
  US 20070088683A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/332 Query formulation
• CPC Class Codes: G06F 16/951 Indexing; Web crawling techniques

Abstract

A method and a system for search enhancement that can deal with semantic differences in a manner that does not require the user to have a PhD in search or in linguistics. Furthermore, extended, semi-automatic use of synonyms of related terms is necessary to avoid interaction with an ontological tree, as is typically presented by large search portals on the public Internet. Using a common Thesaurus as a basis; which improves over time based upon collective use is one of the novel elements in this approach. In addition, a user friendly navigation schema for easily exposing where to go for a particular result is mandatory. Furthermore, it is desirable, that such interface be intuitive to use, and not require lengthy training for fast and effective use.

Claims

1. ) A method comprising:

in response to a query, finding at least one or more additional terms related to a term of the query, via a predefined organization of terms in a data source,

wherein the terms contained in said data source have predetermiend relationships relative to separate terms of separate groups within the data source, the relationships having been in part determined based on relationships of relationships of the respective groups of the respective terms, and using one or more thesauri to further identify one of a plurality of relationships between the terms of the separate groups.

2. ) The method of claim 1, wherein relationships of terms of the data source are expressed in a multidimensional vector, with the dimensions used to express at least one of a set including synonym, antonym, and broader, and narrower relative to separate relationships of terms of the data source.

3. ) The method of claim 1, wherein the method is performed in response to execution of a set of instruction stored on a machine-readable medium.

5. ) The method of claim 3, wherein relationships of terms of the data source are expressed in a multidimensional vector, with the dimensions used to express at least one of a set including synonym, antonym, and broader, and narrower relative to separate relationships of terms of the data source.

6. ) The method of claim 1, wherein the method is performed in response to execution of a set of instruction stored on a machine-readable medium.

8. ) The method of claim 1, wherein relationships of terms of the data source are expressed in a multidimensional vector, with the dimensions used to express at least one of a set including synonym, antonym, and broader, and narrower relative to separate relationships of terms of the data source.

9. ) The method of claim 1, wherein the method is performed in response to execution of a set of instruction stored on a machine-readable medium.

4. ) A method comprising in response to a query, finding at least one or more additional terms related to a term of the query, via a predefined organization of terms in a data source,

wherein the terms contained in said data source have a defined relationship, the relationship having been extracted from at least one of a plurality of data sets of the data source, using information related an organization of said data sets to create relationships between terms located in separate data sets, and using one or more thesauri to determine relationships between unknown terms and known terms, wherein a difference between unknown terms and known terms are to be parsed word by word, and using the words to identify, within one or more of the thesauri, one of multiple relationships between the unknown term and known term, and assigning a value to an identified relationship of the unknown term and known term.

7. ) A method comprising:

generating a predefined organization of terms in a data source, wherein the terms contained in said data source have predetermiend relationships relative to separate terms of separate groups within the data source, the relationships having been in part determined based on relationships of relationships of the respective groups of the respective terms, and using one or more thesauri to further identify one of a plurality of relationships between the terms of the separate groups.

10. ) A method comprising:

generating a predefined organization of terms in a data source, wherein the terms contained in said data source have a defined relationship, the relationship having been been extracted from at least one of a plurality of data sets of the data source, using information related an organization of said data sets to create relationships between terms located in separate data sets, and using one or more thesauri to determine relationships between unknown terms and known terms, wherein a difference between unknown terms and known terms are to be parsed word by word, and using the words to identify, within one or more of the thesauri, one of multiple relationships between the unknown term and known term, and assigning a value to an identified relationship of the unknown term and known term.

11. ) The method of claim 10, wherein relationships of terms of the data source are expressed in a multidimensional vector, with the dimensions used to express at least one of a set including synonym, antonym, and broader, and narrower relative to separate relationships of terms of the data source.

12. ) The method of claim 10, wherein the method is performed in response to execution of a set of instruction stored on a machine-readable medium.

13. ) A method comprising:

in response to only a movement of a cursor of a graphical user interface (GUI) over one or more displayed icons of the interface, altering content displayed on a separate area of the interface.

14. ) The method of claim 13, wherein the method is performed in response to execution of a set of instruction stored on a machine-readable medium.

15. ) The method of claim 13, wherein the altering is commenced after a predetermined delay.

16. ) The method of claim 15, wherein the icon is grouped with one or more related icons.

17. ) The method of claim 16, wherein each icon represents a separate search engine.