Browse Prior Art Database

Easy Squeezed Search

IP.com Disclosure Number: IPCOM000015585D
Original Publication Date: 2002-Mar-15
Included in the Prior Art Database: 2003-Jun-20
Document File: 4 page(s) / 75K

Publishing Venue

IBM

Abstract

[Issue]

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 37% of the total text.

Page 1 of 4

Easy Squeezed Search

[Issue]

When you do a text search operation, such as an auction item search, WEB site search, and database text search, you will sometimes have so many hit items returned as the result of search operation, because search keywords used in the search operation have sometimes wider meaning than expected. Thus, within such results, there would exist many unwanted hit items which need to be eliminated. Naturally, this phenomenon prevents quicker pinpointing to required information. Also, you need quite cumbersome squeezed search operations until final satisfaction. For example, a typical text search operation is as follows:

(1) Review searched texts
(2) Record unwanted keyword/wanted Keyword (memorize or take memo)
(3) Return back to search key setup field
(4) Append additional unwanted/wanted keywords to a keywords list used at previous search operation, through a keyboard |

ex. antenna -booster -vhf -uhf ..... search
h
(5) Return back to the point where you stopped reviewing
(6) Then continue text reviewing

Apparently, this kind of text search operation is not effective.

The purpose of the invention is to establish automatic keyword selection mechanism for squeezed search operations and to drastically ease finding out pinpointed information.

[Expectation]

A common search keyword setup field have only a certain amount of memory to hold additional search keywords (including unwanted (elimination request: usually designated with "-" sign in front of the search keyword) or wanted (inclusion request: usually expressed without any designator)) as well as the original keywords which were already used. For squeezed search operation, this additional search keyword selection process based on already searched and displayed texts should be made automatically, not by repeated manual entries from a keyboard, but by continuous mouse clicking operation. Of course, for maximum flexibility, the additional search keyword entry operation should be allowable for both manual and mouse clicking operation, which also means that mixed operation is allowed. No repeated referring operation to the
common search keyword setup field by any human input manipulation is expected. Only the first search keywords entry is from a keyboard.

[Solution]

1) Prepare a common search keyword field which is large enough to hold certain amount of keywords selected automatically or from a keyboard. For this search keyword buffering operation, a program should update and memorize next position address available to store new additional keyword.
2) In already displayed text, it includes mouse-clickable words as candidate keywords for further squeezed search operation. All the clickable words are tied up with a common routine/script (ex. use HTML Link field setting to specify a certain JAVA Script routine) which handles automatic movement of mouse cursor to the next available position of the common search-keywords field, like a conventional clickable text is closely t...