WO2001071562A2 - Search system and method - Google Patents

Search system and method Download PDF

Info

Publication number
WO2001071562A2
WO2001071562A2 PCT/US2001/040326 US0140326W WO0171562A2 WO 2001071562 A2 WO2001071562 A2 WO 2001071562A2 US 0140326 W US0140326 W US 0140326W WO 0171562 A2 WO0171562 A2 WO 0171562A2
Authority
WO
WIPO (PCT)
Prior art keywords
search
strategy
user
parameter
display
Prior art date
Application number
PCT/US2001/040326
Other languages
French (fr)
Other versions
WO2001071562A3 (en
Inventor
Joseph J. Sperber
Original Assignee
Sperber Joseph J
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Sperber Joseph J filed Critical Sperber Joseph J
Priority to AU2001253865A priority Critical patent/AU2001253865A1/en
Publication of WO2001071562A2 publication Critical patent/WO2001071562A2/en
Publication of WO2001071562A3 publication Critical patent/WO2001071562A3/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/30Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
    • G06F16/33Querying
    • G06F16/338Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

A search system and method therefor is disclosed. The search system includes an input mechanism for a user to input a plurality of search terms, software for automatically creating a plurality of search strategies based on the search terms inputted via the input mechanism, and a search strategy display for displaying the plurality of search strategies in a graphic form, such as a Venn diagram, which is preferably comprised of a plurality of search strategy areas. The search strategy display comprises a search area activation mechanism that allows the user to selectively activate at least one of the search strategy areas. The system also preferably includes other search strategy displays for displaying the activated search strategy in a non-graphic form such as in the Boolean or Natural language. The search system also preferably comprises a search engine selection mechanism by which a user can select one or more search engines through which to run the search. A method of searching in accordance with such a search system is also disclosed.

Description

SEARCH SYSTEM AND METHOD THEREFOR
Technical Field
This invention relates generally to a search system and method therefor and, more particularly, to a system and method for conducting Boolean searches on the Internet.
Background
According to a recent study conducted by NEC Research Institute and Inktomi, a search engine company, the number of Web pages has increased by about 25% from the 800 million pages tallied last summer, up to about one billion. With this increase in the amount of information available to Internet users comes the increased problem of searching these pages to locate the information they need. Typically, online or database searching is conducted based on the principles of Boolean logic. Boolean logic consists of three main logical operators, namely OR, AND and NOT. The results of a Boolean search depend on how these logical operators are combined. For example a search of "patents AND softw.are AND infringement" will result in those documents that include all of these terms, while a search of "patents OR software OR infringement" will result in those documents that include at least one of these terms. In the case of the former search, if we wanted to know which of those documents represented those that contained only the terms "patent" and "software", we would need to run a separate search to that effect.
Given the ease and affordability of "getting online," many Internet users are
"everyday" people, including children, who are completely unfamiliar with Boolean logic. For example, DeMorgans law states that any NOT in a Boolean query will turn
OR's to AND's and AND's to OR's. Clearly, most Internet users are not equipped to construct such type of searches that will more accurately locate the information for which they are looking. Moreover, while simple Boolean searches such as the ones described above may be easy to construct for Internet users familiar with Boolean logic, complex searches involving multiple search terms with multiple operators are very difficult if not impossible for the average Internet user to understand, let alone accurately construct. Even where users are familiar with forming Boolean search strategies, the complexity of the search strategy needed to quickly and accurately locate the desired information rises quickly so that even trained mathematicians have trouble. This problem is exacerbated when one is using different search engines which use different searching methodologies and syntax. The time and skill required to learn such techniques is simply not acceptable in today's fast paced society where "everyday" Internet users are getting online in droves.
The inability to conduct precise and complex searches also adversely impacts on the bandwidth required by search engines or database providers to conduct searches. This not only increases the costs of their operations, but also can have an adverse impact on their critical operations. This inability also causes search results that are often too voluminous to be of any practical utility.
Further, given that not all search engines search the same information, users are often required to conduct multiple searches through each of the available search engines until they obtain the results they desire.
Accordingly, the present invention is directed to overcoming one or more of the problems as set forth above. Summary of the Invention
In one aspect of the present invention, a system for searching for information on the Internet is disclosed. The system comprises an input mechanism for inputting a plurality of search terms, a search strategy creation mechamsm for automatically creating a plurality of search strategies based on the search terms inputted via the input mechanism, and a display adapted to display the plurality of search strategies created by the search strategy creation mechanism in a graphic form, such as a Nenn diagram. The graphic form comprises a plurality of search strategy areas, and the search strategy display comprises a search area activation mechanism for selectively activating at least one of the search strategy areas. The system also includes a search strategy display adapted to simultaneously display one of the plurality of search strategies in a non-graphic form based on the search area activated by the search area activation mechamsm. The search system further comprises a search engine selection mechanism for selecting at least one search engine through which to run the search. The input means comprises a search modification mechanism for modifying the search strategy based on a plurality of search parameters, which preferably include at least one of a fuzzy parameter, an adjacency parameter, a frequency parameter, a mnemonic parameter, a thesaurus parameter, a language parameter and a word precedence parameter. In a preferred embodiment, the search system is platform independent and can be implemented through a variety of devices having an input mechanism and Internet access, such as a personal digital assistant, and wherein the search system is in the form of software, and the software is implemented via at least one of a search engine, a user's browser, or a website. In another aspect of the present invention, a method of searching for information on the Internet based on a plurality of search terms inputted to a search system via a user interface is disclosed. The method comprises automatically creating a plurality of search strategies based on the search terms inputted via the user interface and displaying the plurality of search strategies via the user interface in a graphic form, such as a Venn diagram. The method further comprises the step of displaying one of the plurality of search strategies in a non-graphic form. The method also preferably comprises the step of searching for the plurality of search terms inputted via the user interface over a plurality of search engines.
Brief Description of the Drawings
For a better understanding of the present invention, reference may be made to the accompanying drawings in which:
Figs. 1 represents a search system for conducting a search on the Internet in accordance with present invention;
Figs. 2 A and B represent one embodiment of the input device of the user interface of Fig. 1;
Fig. 3 represents another embodiment of the search system of Fig. 1 for conducting a search on the Internet;
Fig. 4 represents a search parameter display associated with the search parameter buttons of Figs. 1 and 3;
Figs. 5A-E represent another embodiment of the search system of Fig. 1 for conducting a search on the Internet via a personal digital assistant; Fig. 6 represents the search system of Fig. 3 displaying the natural language form of the highlighted search strategy area of the search strategy display; and
Fig. 7 represents the search system of Fig. 3 showing the results of a search conducted there through.
Detailed Description of the Preferred Embodiments
When a user currently conducts a search on the Internet, he or she selects a search engine from his or her browser and types in term or terms upon which he or she wishes to search. Typically, the user is unfamiliar with the searching methodologies or syntax of the search engine selected and thus, simply types in the terms with spaces in-between, relying on the default search created by the search engine based on the inputted search terms. To the extent that the user is familiar with Boolean searching, he or she may type in the terms separated by the desired Boolean logical operator. However, given that various search engines use different searching methodologies and syntax, the search created by the user may not be the search that is actually run by the search engine. The user may decide to use the help feature of the search engine to learn the proper search methodology or syntax for that particular search engine and then try to construct a Boolean search strategy to meet his or her needs. However, this takes time and any type of complex searching is typically outside the realm of a typical Internet user's understanding. Moreover, once the search is run by the search engine, there is no way for the user to know the results of a subset of the search, such as only those documents that contain a least a certain number of the total number of terms being searched. Further, the number of hits resulting from such searches is often unwieldy and unmanageable. A search system in accordance with the present invention that overcomes these problems will now be described. In particular, the search system comprises software (not shown) which is preferably platform independent, such as software created in the JAVA ® programming language, so that it can be used in any operating environment. For the purposes of discussion, the search system will be described in the context of searching information on the Internet with a personal computer. However, the search system can be used in connection with any device having a user interface which allows a user to input information and access the Internet, including personal digital assistants (PDAs) such as 3 Corn's PalmPilot PDA. The software of the search system can be installed on the user's computer to attach to either the web browser of the particular user or to a search engine. Alternatively, the software can be run on a website as a portal which users may visit to conduct their searches.
Referring now to Fig. 1, the search system will first be described wherein the software attaches to a search engine. A user interface in the form of a search window 100 is created by the software of the present search system upon a user' s activation of same, preferably in the form of a search icon (not shown) displayed on the user's computer screen. Search window 100 consists of an input device 102 through which search terms may be inputted. In one embodiment, search terms inputted via input device 102 are added to the search strategy via an add button 104 and removed from the search strategy via a delete button 106. Specifically, with reference to Figures 2 A and B, upon application of the add button 104, an add window 108 automatically opens on a user's computer screen (not shown). Add window 108 contains a plurality of add input areas 110 into which a user can enter search terms. Search terms entered into add input areas 110 by the user are accepted by the search system upon the user's application of the add OK button 112. In the example shown in Fig. 1 , the search terms hurricane, disaster, FEMA and Florida have been added via add window 108. The cancel button 114 allows the user to cancel any newly entered terms, upon the application thereof, the search system reverts back to the last search terms entered by the user via add window 108, if any.
If search terms have already been entered through add window 108, they can be selectively deleted upon application of the delete button 106. Upon application of delete button 106, a delete window 116 automatically opens on a user's computer screen (not shown). Delete window 116 includes a plurality of delete input areas 118 containing search terms last entered through add window 108, if any. The deletions entered by the user are accepted by the search system upon the user's application of the delete OK button 120. If the user does not wish to proceed with the deletion or wishes to change the terms to be deleted, the delete cancel button 122 can be applied, upon which the search system reverts back to the last search terms entered via add window 108, if any. While input device 102 is shown in the form of add button 104 and delete button 106, it can be appreciated by one skilled in the art that any type of input mechanism, such as drop down menus, which allows a user to enter search terms may be used. Further, while the user interface through which a user conducts a search is shown in the form of a window, any form of user interface that allows a user to input information can be used.
Once the search terms are either added or deleted through add window 108 or delete window 116, and the OK buttons 112 or 120, respectively, are applied, the user may initiate the search by applying the search button 123. Upon application of search button 123, the software automatically creates a plurality of search strategies incorporating all Boolean variations of such search terms. Specifically, the software codes each Boolean search strategy based on the search terms inputted by the user and accepted by the search system. The software is programmed to include the search methodologies and syntax supported by a plurality of available search engines. The software includes algorithms which translate the general Boolean search strategies into the required methodology and syntax for the search engine selected by the user. The software preferably defaults to the search which includes all of the search terms inputted by the user and this search request is fired to the selected search engine accordingly, the results of which are displayed via search engine user interface 10. Search window 100 preferably remains on the screen of the user's computer so that to the extent a user wishes to run the search on a different search engine, he or she need simply call up that search engine and reapply search button 123. This also allows a user to readily change the search terms.
The plurality of search strategies are displayed in a graphic form 126, such as a Venn diagram, via a search strategy display 124. Graphic form 126 is made up of a plurality of circles 128, each representing one of the search terms inputted by the user. Preferably, the search term corresponding to each circle 128 is identified in close proximity to the circle 128. Circles 128 are configured to overlap such that each distinct area created thereby, a search strategy area 130, represents each of the plurality of search strategies created by the software. The search strategy is also displayed in non-graphic form via search strategy displays 132 and 134. In particular, Boolean search strategy display 132 displays the current search strategy as a Boolean expression, while Natural language search strategy display 134 displays the current search strategy as a Natural language expression. In a preferred embodiment, search strategy displays 124, 132 and 134 are programmed to default to the search strategy represented by the intersection 136 of all of the circles 128 making up the graphic form 126 displayed therein. In the case of search strategy display 124, the search strategy 130 which is highlighted represents the search strategy that is "active". For example in Fig. 1, the active search strategy area 130 represents the following search strategy, where the search terms are identified as A (representing search term "hurricane"), B (representing search term "disaster"), C (representing search term "FEMA") and D (representing search term "Florida"): A AND B AND C AND D (see Boolean search strategy display 132). A user can activate a search strategy area 130 of graphic form 126 by simply clicking his or her cursor on any search strategy area 130 of graphic form 126. In this manner, a user can selectively activate graphic form 126. The search strategy associated with the activated search strategy area 130 is automatically and simultaneously displayed in Boolean and Natural language expressions via Boolean and Natural Language search strategy displays 132 and 134, respectively upon the activation thereof.
Referring now to Fig. 3, the search system will now be described wherein the software is in the form of a portal website. A user interface in the form of a search window 300 is created upon a user accessing the website. Search window 300 consists of an input device 302 through which search terms may be inputted. In particular, input device 302 consists of a plurality of search term input areas 304 into which a user can enter his or her search terms. Once the search terms are entered into input areas 304, they can be modified or deleted by a user by simply placing his or her cursor within the input area 304 of the search term that he or she wishes to modify or delete, respectively, and then modifying or deleting the search term with his or her cursor and/or via his or her keyboard (not shown). Again, while the user interface through which a user conducts a search is shown in the form of a window, any form of user interface that allows a user to input information can be used.
Search window 300 also includes a search engine selection input device 306 from which a user can select at least one or more search engines through which to run his or her search. In particular, search engine selection input device 306 consists of a plurality of search engine selection input areas 308, 310 and 312. Search engine selection input area 308 allows a user to search all available search engines. Search engine selection input area 310 allows a user to search a predetermined group of search engines. Search engine selection input area 312 allows a user to search by his or her favorite search engine. All of these search engine selection input areas are activated by a user clicking thereon. However, in the case of search engine selection input area 312, the user must also type in the name of his or her favorite search engine via search engine input field 314. In a preferred embodiment, search engine input field 314 consists of a pull down menu containing a list of all of the available search engines from which the user can select by simply highlighting same with his or her cursor.
Once the search terms have been entered and the search engine or engines have been selected, the user can initiate the search by clicking on the search button 316. Upon activation of search button 316, the software automatically creates a plurality of search strategies incorporating all Boolean variations of such search terms, which are displayed via search strategy display 124' in a manner previously described herein with respect to the search strategy system of Fig. 1. In a preferred embodiment, as a user moves his or her cursor over each search strategy area 130', the natural language form of the search strategy represented by the respective search strategy area 130' is automatically displayed via display 138 within search strategy display 124' (see Fig. 6). Specifically, the software codes each Boolean search strategy based on the search terms inputted by the user. As previously mentioned, the software is programmed to include the search methodologies and syntax supported by a plurality of search engines. The software includes algorithms that tr.anslate the general Boolean search strategies into one or more search engine-specific queries based on the search engine or engines selected by the user. The translated Boolean search is then simultaneously fired off to each selected search engine, the results of which are displayed via the user interface 10' of the search engine as shown in Fig. 6. In the case where only one search engine is selected, the results are immediately displayed via user interface 10'. If more than one search engine is selected, a plurality of icons (not shown) are generated on the user interface 10' of the search engine representing each selected search engine. When the user clicks on each icon, the search results for that search engine are displayed. The software is also preferably programmed to determine whether or not a user's search request is supported by the search engine or engines selected. If not, an alert (not shown) is generated and displayed on search window 300 indicating the unsupported search engine or engines.
Both search windows 100 and 300 preferably include means for modifying a search strategy based on a plurality of search parameters that help "fine tune" the search strategies created by the software. In a preferred embodiment, such modifying means includes the following search parameters: fuzzy, adjacency, frequency, mnemonics, thesaurus, language and word precedence. The fuzzy parameter allows a user to select the number or percentage of letters in terms being searched that must match a given search term. The adjacency parameter allows a user to select the adjacency of the search terms being entered (i.e., right next to each other, within the same sentence, within the same paragraph, etc.). The frequency parameter allows a user to select the frequency of occurrence of each search term that must occur before a term being searched is selected as part of the search results. The mnemonics parameter allows a user to expand the search term to include letters or letter combinations that sound similar to the search term. The thesaurus parameter allows a user to expand the search term to include words having a similar meaning thereto. The language parameter allows the user to select the language in which the search should be conducted. The word precedence parameter allows a user to specify the importance of a search term by word type, such as noun, pronoun, adjective and adverb. While this search-modifying feature has been discussed in connection with the above- mentioned parameters, it can be appreciated that other parameters may be used in modifying and refining the search strategies created by the software. For example, in a preferred embodiment, the plurality of search parameters includes a language fuzzy logic parameter button (not shown) which provides the capability to combine search languages in the event that certain terms overlap languages such as "auto (English)" and "auto (German)". Of course, all such search parameters are limited by the capabilities of the search engine or engines selected by the user. The modifying means is preferably implemented through the use of object oriented programming to take advantage of the modularity of each search parameter.
With respect to search window 100 of Fig. 1 and referring back to Fig. 2 A, the modifying mechanism is preferably implemented via the add window 108. In particular, each add input area 110 of add window 108 includes a search parameter activation mechanism 200. Upon activation of search parameter activation mechanism 200, a search parameter display 202 as shown in Fig. 4 opens on the user's computer screen. Search parameter display 202 includes a plurality of search parameter buttons for activating the search parameters mentioned above. In a preferred embodiment, search parameter display 202 includes a fuzzy parameter button 204, an adjacency parameter button 206, a frequency parameter button 208, a mnemonics parameter button 210, a thesaurus parameter button 212, a language parameter button 214, and a word precedence button 216. When any of these search parameter buttons are applied, a pull down menu is displayed from which the user can select from a plurality of search parameter settings based on the search parameter button selected. While the search parameters are shown to be implemented via add window 108, it can be appreciated by one skilled in the art that the search parameters can be implemented via search window 100 in other ways. In the case of the search window 300 of Fig. 3, the search parameters are implemented in a similar manner via search parameter activation mechanism 200' of search term input areas 304.
In yet another preferred embodiment of the present invention, the software allows a user to create the Boolean search directly from the input device of the search window. In a preferred embodiment, each search term input area of the search window includes a button which when applied, generates a pull down menu from which the user may select a desired a Boolean logical operator. Upon inputting the search terms and Boolean logical operators and initiating the search via the search button, the search results are displayed with the particular search created by the user being activated as the default.
As previously mentioned, the software can also be implemented via PDAs. Referring now to Fig. 5 A, a PDA 400 having the search system of the present invention installed thereon is shown. The user interface 402 of PDA 400 includes a search icon 404 from which to activate the search system. Once a user double clicks on icon 402, a search screen 406 as shown in Fig. 5B is displayed to the user. Search screen 406 is similar to search windows 100 and 300 of Figs. 1 and 3, respectively, in that it includes (1) an input device 407 in the form of an add button 408 and a delete button 410, (2) a search strategy display 412, (3) a Boolean search strategy display 414, and (4) a Natural Language search strategy display, all which work in a similar manner to their counterparts of the search system of Figs. 1 and 3. Fig. 5C shows an add screen 416 which operates in a similar manner as add window 108 of Fig. 1 in which search terms may be added via a plurality of add fields 418, while Fig. 5D shows a delete screen 420 which operates in a similar manner as delete window 110 of Fig. 1 from which search terms previously entered may be deleted. The search engine through which the user wishes to run the search is selected via the search engine selection button 421 located on a tool bar 422. Upon application of the search engine selection button 421, a pull down menu 424 as shown in Fig. 5E is displayed from which a user can select the search engine he or she desires. Upon selection of the search engine, and selection of the Go button 426 displayed on search screen 406 (see Fig. 5B), the search is conducted and the results displayed in the respective search strategy display 428 as previously described herein.
While the search system has been described with respect to certain user interfaces herein, it can be appreciated by one skilled in the art that other user interfaces having the fundamental features of the user interfaces described herein can be used to implement the present invention. As a result of the present invention, a user can quickly conduct complex searches over a multiplicity of search engines without the need to learn Boolean logic. As is evident from the foregoing description, certain aspects of the present invention are not limited by the particular details of the examples illustrated herein, and it is therefore contemplated that other modifications and applications will occur to those skilled in the art. It is accordingly intended that the claims shall cover all such modifications and applications that do not depart from the spirit and scope of the present invention.
Other aspects, objects and advantages of the present invention can be obtained from a study of the drawings, the disclosure and the appended claims.

Claims

Claims
1. A system for searching information on the Internet, comprising: input means for inputting a plurality of search terms, search strategy creation means for automatically creating a plurality of search strategies based on the search terms inputted via the input means; and a display adapted to display the plurality of search strategies created by the search strategy creation means in a graphic form.
2. The search system of claim 1, wherein the graphic form comprises a plurality of search strategy areas and wherein the search strategy display comprises search area activation means for selectively activating at least one of the search strategy areas.
3. The search system of claim 2, further comprising a search strategy display adapted to simultaneously display one of the plurality of search strategies in a nongraphic form based on the search area activated by the search area activation means.
4. The search system of claim 3, wherein the search strategy displayed by the search strategy display is in the Boolean language.
5. The search system of claim 3, wherein the search strategy displayed by the search strategy display is in the Natural language.
6. The search system of claim 1, further comprising search engine selection means for selecting at least one search engine through which to run the search.
7. The search system of claim 1, wherein the input means comprises search modification means for modifying the search strategy based on a plurality of search parameters.
8. The search system of claim 7, wherein the plurality of search parameters include at least one of a fuzzy parameter, an adjacency parameter, a frequency parameter, a mnemonic parameter, a thesaurus parameter, a language parameter and a word precedence parameter.
9. The search system of claim 1 , wherein the graphic form is a Venn diagram.
10. The search system of claim 1, wherein the search system is platform independent.
11. The search system of claim 1 , wherein the search system is implemented via a personal digital assistant.
12. The search system of claim 1, wherein the input means includes means for inputting the plurality of search terms in the form of a Boolean search, and wherein one of the plurality of search strategies displayed by the display means represents the Boolean search.
13. The search system of claim 1, wherein the search system is in the form of software, and the software is implemented via at least one of a search engine, a user's browser, or a website.
14. A method of searching for information on the Internet based on a plurality of search terms inputted to a search system via a user interface, the method comprising: automatically creating a plurality of search strategies based on the search terms inputted via the user interface; and displaying the plurality of search strategies via the user interface in a graphic form.
15. The method of claim 14, wherein the method further comprises the step of displaying one of the plurality of search strategies in a non-graphic form.
16. The method of claim 15, wherein the non-graphic form is the Boolean language.
17. The method of claim 15, wherein the non-graphic form is in the Natural language.
18. The method of claim 14, wherein the graphic form is a Venn diagram.
19. The method of claim 14, wherein the search system is implemented via a personal digital assistant.
20. The method of claim 14, further comprising the step of searching for the plurality of search terms inputted via the user interface over a plurality of search engines.
PCT/US2001/040326 2000-03-17 2001-03-19 Search system and method WO2001071562A2 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2001253865A AU2001253865A1 (en) 2000-03-17 2001-03-19 Search system and method

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US52842800A 2000-03-17 2000-03-17
US09/528,428 2000-03-17

Publications (2)

Publication Number Publication Date
WO2001071562A2 true WO2001071562A2 (en) 2001-09-27
WO2001071562A3 WO2001071562A3 (en) 2004-01-29

Family

ID=24105642

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/US2001/040326 WO2001071562A2 (en) 2000-03-17 2001-03-19 Search system and method

Country Status (2)

Country Link
AU (1) AU2001253865A1 (en)
WO (1) WO2001071562A2 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7716203B2 (en) 2007-08-31 2010-05-11 International Business Machines Corporation Method and system for tracking, evaluating and ranking results of multiple matching engines
EP3599557A1 (en) * 2018-07-25 2020-01-29 Spotify AB Systems and methods for dynamic and interactive visualizations for navigating media content

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0853287A2 (en) * 1996-12-31 1998-07-15 Nokia Mobile Phones Ltd. Method for transmission of information to the user
US5966126A (en) * 1996-12-23 1999-10-12 Szabo; Andrew J. Graphic user interface for database system

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5966126A (en) * 1996-12-23 1999-10-12 Szabo; Andrew J. Graphic user interface for database system
EP0853287A2 (en) * 1996-12-31 1998-07-15 Nokia Mobile Phones Ltd. Method for transmission of information to the user

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7716203B2 (en) 2007-08-31 2010-05-11 International Business Machines Corporation Method and system for tracking, evaluating and ranking results of multiple matching engines
EP3599557A1 (en) * 2018-07-25 2020-01-29 Spotify AB Systems and methods for dynamic and interactive visualizations for navigating media content
US11003310B2 (en) 2018-07-25 2021-05-11 Spotify Ab Systems and methods for dynamic and interactive visualizations for navigating media content
US11449195B2 (en) 2018-07-25 2022-09-20 Spotify Ab Systems and methods for dynamic and interactive visualizations for navigating media content

Also Published As

Publication number Publication date
WO2001071562A3 (en) 2004-01-29
AU2001253865A1 (en) 2001-10-03

Similar Documents

Publication Publication Date Title
US7080325B2 (en) Graphical device for comprehensive viewing and input of variable data via a browser-based display
US7552395B2 (en) Graphical user interface for building boolean queries and viewing search results
US6434556B1 (en) Visualization of Internet search information
KR100323969B1 (en) Highlighting tool for search specification in a user interface of a computer system
US6012055A (en) Mechanism for integrated information search and retrieval from diverse sources using multiple navigation methods
TWI484404B (en) Method and apparatus for modification of pointing device functions in conjunction with dynamic sorting, displaying, listing, and activation
CA2546514C (en) Legal research system
US7703037B2 (en) Searchable task-based interface to control panel functionality
US7587672B2 (en) File content preview tool
US20040002959A1 (en) Method and system for providing context sensitive support for data processing device user search requests
US20060100998A1 (en) Method and system to combine keyword and natural language search results
US20070043706A1 (en) Search history visual representation
JP2005513620A (en) System and method for searching a data source
WO2001031508A1 (en) Search system having user-interface for searching online information
US7600199B2 (en) Task-based interface with underlying extensible framework
CN100507905C (en) Information retrieval system and method for retrieving information
US20040205502A1 (en) Network navigation system and method
US20020078020A1 (en) Method and system of entering search criteria using multiple entry fields per data element
GB2365150A (en) Automatic completion of data in a data entry field using prepended text
WO2001071562A2 (en) Search system and method
KR100901256B1 (en) Search method by providing search window with an application being used
KR100450526B1 (en) Search system and method for providing of mini window
Buyukkokten Wireless Web access on handheld devices
KR20030079825A (en) Method for moving form a search engine page to a web-page and apparatus for the method

Legal Events

Date Code Title Description
AK Designated states

Kind code of ref document: A2

Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EE ES FI GB GD GE GH GM HR HU ID IL IN IS JP KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NO NZ PL PT RO RU SD SE SG SI SK SL TJ TM TR TT TZ UA UG UZ VN YU ZA ZW

AL Designated countries for regional patents

Kind code of ref document: A2

Designated state(s): GH GM KE LS MW MZ SD SL SZ TZ UG ZW AM AZ BY KG KZ MD RU TJ TM AT BE CH CY DE DK ES FI FR GB GR IE IT LU MC NL PT SE TR BF BJ CF CG CI CM GA GN GW ML MR NE SN TD TG

121 Ep: the epo has been informed by wipo that ep was designated in this application
DFPE Request for preliminary examination filed prior to expiration of 19th month from priority date (pct application filed before 20040101)
122 Ep: pct application non-entry in european phase
NENP Non-entry into the national phase in:

Ref country code: JP