Abstract:
A method of conveniently making a selection from a set of options available in a computer program is described. As successive letters which make up the proposed selection are entered, successively smaller lists of options corresponding to the entered letters are displayed. At any point, the user makes a selection by moving a cursor to a desired selection and pressing a button or key to indicate that the selection has been made.

Description:
This is a file wrapper continuation application of U.S. patent application Ser. No. 07/659,527, filed Feb. 22, 1991, now abandoned which was a File Wrapper continuation of application Ser. No. 07/176,788 filed on Apr. 1, 1988, now abandoned. 
    
    
     BACKGROUND OF THE INVENTION 
     This invention relates to computer programs which require the user to make a selection or command from a set of valid entries. 
     Many times, when working with a computer application, users are called upon to select a particular item from a list, menu, table, or outline of possible choices. Examples include locating records in a data table, selecting a name or phrase from a long list of candidates, or choosing a command from a specified set. The simplest method to effect this operation has been to simply require the user to type in the desired selection. 
     Some designers have attempted to make this process more convenient by allowing the user to indicate one choice from among many by moving the computer s cursor to the desired item and then pressing a special key to indicate that the item at the cursor is to be selected. The cursor may be moved by keyboard, mouse, pointing device, or other means, and the selection can either pick out the indicated item, or perform some other action on it. 
     Other applications have provided the possibility whereby a truncated version or abbreviation of a desired command may be entered thus making the selection with fewer keystrokes. Some word processing programs also provide for the method by which the user may enter only part of a desired word whereupon the computer moves the cursor to the first located section of text which matches the partial entry. 
     SUMMARY OF THE INVENTION 
     The present invention provides a method of programming and using a computer whereby successive keystrokes entered by the user will cause the display of a list which dynamically reflects the range of choices corresponding to the letters entered thus far. As each letter is entered, the set of choices which corresponds to the letters entered thus far is immediately reduced. Only the items whose names match the fragment which has been entered remained displayed, and the matching letters of the displayed items are highlighted. All other items vanish from view. The cursor keys remain active over the reduced list, allowing the user to continue typing letters, or to move the cursor to a particular selection within the list and press a pre-designated key to finish the selection. 
     This method allows the user to enter a selection by keyboard, by cursor movement, or by a combination of the two all while dynamically reflecting the progress and range of remaining choices as the user proceeds. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIGS. 1a, 1b, 1c, and 1d depict displays of lists selected according one embodiment of the present invention. 
     FIGS. 2a, 2b, and 2c depict displays of lists organized in outline form and selected according to another embodiment of the present invention. 
     FIG. 3, is an outline, in flow chart form, of the algorithm of the present invention. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     The method described herein is intended for use on a computer. Typically, such a computer will include a central processing unit having a memory for data and instructions and a processor. Such a computer will also include a display means, such as a video monitor or liquid crystal display, and an input means, such as a keyboard, mouse, or voice input device. 
     The specific embodiment described below pertains to the selection of a word from among a list of words. Thus, in this case, the &#34;options&#34; which a user is choosing among are the words in the list. The selection is made by entering &#34;fragments&#34;, in this case letters, in succession. 
     The invention described herein may also be applied to other cases in which the options are words, such as choosing a command or search term in a database. Moreover, larger or non-verbal items may be used as the &#34;options&#34;, in which case the fragments used to select from among the options may be Boolean operands, pictoral elements, or word combinations, for example. 
     Turning to FIGS. 1a through 1d, the method of choosing a word from a list is illustrated. As letters are typed, they are determined by any matching or sorting method to match portions of the items in a list. The typed letters or word fragments are indicated within each listed item by displaying the letters which match in a different video mode, font, or case from the remaining unmatched letters. The entry of each successive letter causes the displayed list of possible entries to be reduced to reflect the restricted range of entries which may match the fragment which has been entered so far. 
     For example, if a list consisted of: Apple, Peach, Pear, Persimmon, Rutabaga, typing P, then E, then A, then C, would reduce the list and display, successively, the four screens shown in FIGS. 1a through 1d. In FIG. 1a, capitalization of the letter P in each word displayed corresponds to the input letter, and the words Apple and Rutabaga are never displayed. In FIGS. 1b, the letters P and E are capitalized in each displayed word. In FIG. 1c, the input of the letter A, to form the fragment PEA, causes those corresponding letters to be capitalized and causes the word persimmon to be eliminated. Finally, entering the letter C causes only one word to be displayed in FIG. 1d, Peach, the user may select this option by pressing an appropriate key on a keyboard. 
     Generally, matching proceeds from left to right, selecting only items whose names begin with the letters so far typed. Occasionally, however, particularly when the user&#39;s emphasis is more on reducing the amount of typing, it may be advantageous to match a sequence of letters found anywhere in the name. This may be indicated by prefacing the search process by pressing a special key or otherwise altering the matching criteria. Even in this situation, the highlighting of the matched letters within the text of each matching item name is applicable. 
     Where the entry of fragments has proceeded to the point where all desirable candidates have been eliminated, the user may backspace or otherwise delete a portion of the entry or fragment. In one embodiment of this invention, the displayed list will respond by expanding to reflect the larger set of entries which match the fragment. An example of such a process would be found where, from FIG. 1d, the user backspaced so as to eliminate the letter C from the entered fragment. The result would be the larger subset in the display depicted in FIG. 1c. 
     When the items among which the selection is to be made are organized in an outline, one embodiment of the invention continues to display the headings of each branch and sub-branch which contains a selected item. As with the previous embodiment, members of the set which do not match the fragment which has been entered, are deleted from the display. 
     For example, where a list of foods is organized as depicted in FIG. 2a, the entry of the letters P then 0 would reduce the outline to those depicted in FIGS. 2b and 2c respectively. FIG. 2a consists of a heading 1 and two subheadings 2, 3 each of which contains two entries 4, 5, 6, 7. Turning to FIG. 2b, when the letter P is typed, one entry 4, 7 under each of the subheadings 2, 3 is deleted as not beginning with the letter P. Since each of the subheadings 2, 3 contains a possible valid entry 5, 6, neither is deleted. 
     Looking at FIG. 2c, where the letter 0 has been typed, it made be seen that only the word potato 6 satisfies the fragment which has been entered. Thus, the subheading 2 which contains no valid entry has been deleted leaving only the heading 1 and subheading 3 which contain the word potato 6. It is believed that this ability to show the progress of a narrowing search, in context, is an advantage of this new selection method. 
     It will be appreciated by those skilled in the art that, in some instances, the entry of a command fragment by keyboard will not be immediately feasible since, as in a word processing program, the normal mode of input is to enter words by keyboard. In such a case, the user must first give a command that either establishes a mode that causes a list to act in the narrowing search behavior described herein or creates a new copy of the list or outline with any previously hidden items showing. It may be convenient in such an embodiment to provide that the selection of an item returns the cursor to the original application if appropriate. 
     Turning now to FIG. 3, the algorithm of an embodiment of the present invention is represented in flowchart form. Commencing at node 11, it is necessary to place the processor in an initial state where the entire set of appropriate options is accessible. 
     At node 15 it is determined which options in the set of options correspond to the group of fragments which have been entered thus far. Execution proceeds to node 17, which calls for a display of all matching options. Where no fragments have been entered, the display logic may be configured to show all options as &#34;matching&#34; or no options at all. Where, as in the example illustrated by FIGS. 2a through 2c, there are headings associated with the options, they may be displayed as well. 
     Options which do not match may be omitted or, space permitting, may be displayed in a visually distinct manner so as to indicate their status. 
     At node 18, an input is required. This may be either a backspace type key, a first or additional fragment, or the indication that a selection has been made. At node 19 it may be detected that an option has been selected, either by pressing a designated key or by moving a cursor to one among the remaining options and indicating the selection. If a selection was made, the identity of the selected option is made available to the application program for regular handling by branching to whatever execution code is provided at node 25. 
     Otherwise, the input is tested at node 21 to see if a backspace was entered. If a backspace is detected, a fragment is removed at node 23 from those being used to determine which options are to be displayed. If there was no backspace, a fragment is added to the set which is being matched at node 24. Each node 23, 24 branches back to node 15 to determine the new set of matching options. 
     PROGRAM LISTING 
     Below is a listing of a routine embodying the present invention. The routine is written in the language Modula-2.