Telephonic data access and transmission system

Abstract

A system for transmitting and accessing data through a standard telephone system. The system including activating a key or sequence of keys wherein each key represents a plurality of letters. Signals produced by activating the keys are compared to a data base having indexed entries of words or names. In this way, words can be input into the system using only 8 unique keys.

Description

BACKGROUND OF THE INVENTION

The present invention relates to a telephonic data access and transmission system, and, more particularly, to a system for transmitting and accessing data through a standard TOUCH-TONE telephone system utilizing a standard TOUCH-TONE telephone set.

In the past, several systems have been proposed which allow data to be entered into a telephone TOUCH-TONE set and which then transmit the data to a central computer or the like. It is typical for such systems to rely on coding schemes wherein strings of letters may be transmitted to the central computer through the TOUCH-TONE telephone set by depressing TOUCH-TONE keys in such a manner that the central computer will be able to interpret the information transmitted. Such systems are desirable for use in conducting business transactions by phone without intervention beween the caller and the data processing apparatus. For example, it is desirable to conduct banking by phone, to purchase commercial products by phone, place reservations on airlines or the like by phone and arrange ticketing. Further, it would be convenient for a telephone user to gain access to various informational data bases or the like. For instance, it is desirable for a telephone user to get phone directory information.

Although it is desirable to tramsit data and access data utilizing the TOUCH-TONE (DTMF) transmitter of the standard telephone set, systems devised by the prior art are inefficient because of the complicated coding schemes which are involved. Coding schemes have been necessary in the past because the standard telephone TOUCH-TONE key pad is designed to provide only ten or twelve distinct keys. In order to transmit letters, prior art systems have relied on coding schemes and translating devices to transmit information between the telephone set and the computer.

The standard TOUCH-TONE telephone set (transmitter) typically includes twelve buttons, or keys, disposed in a matrix of four horizontal rows by three vertical columns. Each of the keys has associated therewith two distinct frequencies: A frequency chosen from a group (`A`) of relatively low frequencies, corresponding to the row wherein the button is disposed; and a frequency selected from a group (`B`) of relatively high frequencies, corresponding to the column wherein the button is disposed. Depression of a given key causes transmission of a dual tone multi frequency (DTMF) signal having frequency components of both the group A (row) and group B (column) frequencies associated with the disposition of the key in the matrix.

Each key of the TOUCH-TONE phone additionally is enscribed with indicia such as numerical designations (0 through 9) as well as alphabetic designations (A through Z) as shown in FIG. 1. The alphabetic characters "Z" and "Q" are not portrayed on the standard TOUCH-TONE set, but can be considered to be associated with the keys with the designations 9 and 7 respectively.

U.S. Pat. No. 4,427,848 issued to Tsakanikas teaches a system for the transmission of alpha numeric data by use of a standard telephone set. The system provides a translation technique wherein alphabetic characters are transmitted by depressing a designated key a number of times equal to the relative position of the inscription of the character on the key, followed by the depression of a key on which the character is inscribed. A return to the numeric mode may be effected by depression of a second designated key. Other translation schemes are disclosed by Tsakanikas and are equally burdensome to a user.

U.S. Pat. No. 4,500,751 issued to Darland et al, teaches a data communication system wherein a large number of remote terminals communicate with a central host terminal through telephone lines. The system contemplates the use of two or more twelve-key TOUCH-TONE key pads which are connected to the same inputs of a two tone signal generator. Key pads are differentiated when the group of keys in each key pad triggers a corresponding timer when the key is released. The timer then actuates a signal generator through one of its inputs to generate a tone that identifies which key pad is being actuated when the key in that pad is released.

U.S. Pat. No. 4,307,266 issued to Messina teaches a telephone communication apparatus for use by a handicapped person. The system uses a code wherein the user enters the appropriate position for the letter of the alphabet to be communicated and a second entry is input to identify which one of the plurality of letters (or the number) the user intends to transmit.

U.S. Pat. No. 4,012,599 issued to Meyer teaches a telephone communication system for use by a deaf person. An encoding scheme is utilized wherein alphabetic characters are trnsmitted by activating at least two keys.

U.S. Pat. No. 3,381,275 issued to Tsakanikas, describes a telephonic data transmission system utilizing what is termed a twin depression translation technique. This system involves the simultaneous depression of a plurality of keys which produces a signal having frequency characteristics, which may be discriminated from the pairs of frequencies generated in response to the depression of a single key.

Another example of a TOUCH-TONE to alpha numerical translator is described in U.S. Pat. No. 3,618,038 issued to Stein. This system utilizes what is known as the delayed depression translation technique, wherein depression of keys having different durations are discriminated.

In addition, other translation techniques whereby each alpha numeric symbol is represented by a specific sequence of DTMF signals with each character separated by a specific designated DTMF signal have been proposed. An example of such a transmission technique is described in Brumfield et al, Electronics, "Making a Data Terminal out of the TOUCH-TONE Telephone" McGraw Hill, July 3, 1980.

As is apparent from the above discussion, systems taught by the prior art are slow, involve a coding scheme which is difficult for a user to master, and are in general not practical for most people to use.

OBJECTS AND SUMMARY OF THE INVENTION

It is an object of the present invention to provide a system for transmission of and access to data using a standard TOUCH-TONE phone without employing an encoding scheme for each alphabetic letter.

It is another object of the invention to apply the principle of Boolean exclusion (defined and exemplified below) to discriminate among data base entries indexed by numerals matching the latters designated on a standard TOUCH-TONE telephone key pad and to discriminate among separate entries with matching index numbers by the content of their corresponding informational fields.

It is another object of the invention to provide a system for transcribing a letter or string of letters wherein letters or strings of letters are keyed into a standard TOUCH-TONE telephone, relayed to a computer, and compared to indexed entries of a data base. The computer then responds with information desired by the user.

It is another object of the invention to provide a telephone directory system wherein a person's name or part of a person's name is keyed into a standard TOUCH-TONE telephone utilizing the alphabetic characters which are inscribed on the TOUCH-TONE key pad. Signals generated from TOUCH-TONE keys are then directed to a central computer which can access a telephone directory data base, and a telephone number relating to the information keyed in by the user is given in response, typically by means of electronic voice synthesis.

Still another object of the present invention is to provide a means for accessing data by telephone wherein a user may utilize the letters enscribed on a standard TOUCH-TONE telephone to key strings of letters without the use of a code scheme.

It is a further object of the invention to provide a system for telephone communications which can be used by a deaf person and involves the use of a standard telephone key pad without the use of an eleborate coding scheme.

It is a further object of the invention to provide a system for the telephonic access of data and transmission of data which is readily adaptable to standard computer hardware.

It is an an object of the invention to provide a system including a large data base of information, such as an English language dictionary or an ordinary telephone book, that can be stored electronically in such a way that each entry could be retrieved by list processing software using an alphabetic conversion system for the telephone key pad buttons number 2, 3, 4, 5, 6, 7, 8, and 9; and that the software would search for information using the basic sequence: request input from user, compile a list of possible entries; convey the entry if only one is present; otherwise, eliminate incorrect entries by Boolean exclusion and convey the remaining correct entry; and that such a system would allow a human to interact directly with a central computer using only his standard TOUCH-TONE telephone.

Still another object of the invention is to provide a telephone key pad spelling system that requires only one button to be pushed for each letter.

Still another object of the present invention is to provide a telephone key pad spelling system which is easy to learn and is simpler to use than a standard typewriter.

Another object of the present invention is to provide a word processing apparatus that is adapted so a handicapped person could readily input data with one hand or with only one finger.

Various features of novelty which characterize the invention are pointed out with particularity in the claims annexed to and forming a part of this disclosure. For a better understanding of the invention, its operating advantages and specific objects, attained by its uses, reference is made to the accompanying drawings and descriptive matter in which preferred embodiments of the invention are illustrated.

BRIEF DESCRIPTION OF THE DRAWINGS

In the drawings:

FIG. 1 is a schematic view showing a remote TOUCH-TONE telephone connected to a central data base.

FIG. 2 shows the general algorithm of the system of the present invention.

FIG. 3 is a side elevational view of a mini word processor according to the invention.

FIG. 4 is a top plan view of a mini word processor according to the invention.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

U.S. Pat. No. 4,500,751 to Darland et al and U.S. Pat. No. 4,427,848 to Tsakanikas show various known equipment for connecting telephones to computers or the like. U.S. Pat. No. 4,427,848 to Tsakanikas and U.S. Pat. No. 4,500,751 to Darland et al are hereby incorporated by reference.

Referring to the drawings in particular, the invention embodied therein utilizes a TOUCH-TONE telephone set 2 including a TOUCH-TONE telephone key pad 4 at remote station generally designated R and telephone lines or the like 6. A host station H is connected to remote station R through telephone line 6 and include a computer or other data processing apparatus 8 and a TOUCH-TONE decoder 11 for receiving the DTMF signals from the remote station R and generating a corresponding data stream that is readable by the computer 8.

The system of the present invention is based on the use of a standard TOUCH-TONE key pad 4 whereby, unlike prior art systems, letters are transmitted by pressing one key for the one letter desired. Strings of letters or words are transmitted by pressing sequences of keys wherein each letter of the string of letters or each letter of the word is transmitted by pressing the key bearing that letter's designation. Specifically, any one of the letters A, B or C may be transmitted by depressing the "2" key. In this way, all of the letters A through Z may be transmitted by activating one of the keys 2 through 9 of the standard TOUCH-TONE telephone key pad-all the letters A through Z being represented by only eight unique keys.

Each word or letter string is delimited from the next by depressing a designated spacebar key. In the preferred embodiment the zero/operator key is the spacebar/delimiter key.

Table 1 shows the correlation between the letter a user intends and the key depressed. Since only eight keys are used for the twenty-six letters of the alphabet, the keys represented by "1", "*", and "#" are free for other uses, including the transmission of a simple code to activate the keys for number designations and punctuation. In this manner, all of the keys of a traditional typewriter are represented in a standard TOUCH-TONE telephone key pad as used in the present invention (Table III).

TABLE 1______________________________________User Intends Key depressed______________________________________A, B or C 2D, E or F 3G, H or I 4J, K or L 5M, N or O 6P, Q, R or S 7T, U, or V 8W, X, Y or Z 9Word delimit key/spacebar 0______________________________________

The present invention relies on list processing software, an appropriate data base for the specific use intended, and an efficient sorting routine, based on the length of words and the configuration of letters, which allows the information in the data base to be quickly accessed. As best seen in FIG. 2, strings of letters keyed into a telephone key pad 4 transmit DTMF signals by telephone line or the like 6 to a computer 8. It should be noted that this invention also contemplates the use of a telephone key pad 4 at the same location as computer 8. The signals are then converted by a TOUCH-TONE decoder or the like 11 to digital signals intelligible by the computer 8. The signals are then compared within the computer to a data base 7 having a multiplicity of indexed informational entries. If two or more indexed entries match the keyed numerical sequence, the computer eliminates incorrect entries through Boolean exclusion. The computer then responds with the informational entry using electronic voice synthesis.

As is apparent to one of ordinary skill in the art, the above system has numerous applications of which only a small portion are presented infra. One of the more significant applications is directory assistance. The description below illustrates Boolean exclusion as embodied in this invention.

TELEPHONE DIRECTORY SYSTEM

Present methods of accessing telephone information via telephone depend on an operator and a computer data base wherein the operator is asked to give the telephone number of a specific person having a last name, first name or first initial, a residence or place of business and a locality at which the residence or place of business is located. The application of this system to automate directory assistance would allow a person having a TOUCH-TONE telephone to gain direct access to information stored in the data base by using a standard TOUCH-TONE phone.

The telephone directory system contemplated by the invention relies on the telephone data access and data transmission system described above. In particular, a user may dial the number for the telephone directory system and will receive instructions from a standard voice synthesis device which requests the user to input six letters corresponding to the last name for which a number is required. For example, the caller may be addressed by an electronically synthesized voice which states "You have reached directory assistance. This service can assist you if you will type in the first six letters of the person's last name using your telephone key pad." The user then inputs the first six letters of the last name using the standard telephone key pad. For example, the name Smith would be transmitted by depressing the sequence of keys correspondence to the individual keys having the numbers "76484" inscribed on them. The caller then is addressed by a synthesized voice which may say "Thank you. What is the first letter of the first name?" The user will then depress the key with a "5" inscribed on it corresponding to the letter "J". Next, the synthesized voice says "Thank you. What are the first three letters of the locality?" The user then may input "275" which represents the first three letters of the locality of "Arlington". Next, the synthesized voice will state "Thank you. What is the two letter state code?" At this point, the user may input "82" representing the state code "VA" or Virginia. The computer 8 at the central terminal or host station H will then compile a list of all relevant possibilities--the digits entered by the caller are compared with the indexed data base through means of an efficient sorting routine and a list of all entries which match those twelve digits is compiled.

Next, if more than five possibilities are found in the data base, then Boolean exclusion is used to reduce number of possibilities. Boolean exclusion is herein defined as the method of identifying properties of data base entries, querying the user in regard to the correct property, and eliminating all entries having the incorrect property (see Table II for a list of typical questions). With five or less possibilities, program control goes immediately to the instructions which release the appropriate phone number.

When more than five entries exist which conflict in the telephone directory data base, the caller is queried as to which letter was intended. For instance "Does the first name begin with the letter J?" The caller is expected to press "N" for No and "Y" for Yes. The list of possibilities is then reduced by eliminating all entries which non-matching first initials.

If there are still more than five possibilities, the program checks to see if more than one locality is represented among the entries in the list of possibilities. If more than one locality is represented among the entries, the caller is asked which locality was intended. For instance "There are now forty-five possibilities. Is the locality Arlington?" The program then reduces the list of possibilities by eliminating all entries with non-matching localities.

The program then checks to see if more than one last name is represented among the entries in the list of possibilities. The caller than may be asked which last name was intended. For instance "There are now twenty possibilities. Is the last name Smith?" The program then reduces the list of possibilities by eliminating all entries with non-matching last names.

TABLE II______________________________________TypicalBoolean Exclusion Questions______________________________________Did you intend X?Did you mean X?X?Is the X-characteristic Y?Does X contain Y?Does X exclude Y?May items costing more than X be excluded?Is the amount of X lower than Y-amount?Is X's occupation Y?Does X produce Y?Is X listed on the New York Stock Exchange?Is X in Y-locality?Is X the first letter of Y?Did you mean X in the context of Y?Does X provide Y-service?Is X the manufacturer of Y?Continue?Go on?______________________________________

In some cases, even after the above, there are still more than one data base entries that match the entry having the number which the user requests. In this case, first names must be used to reduce the possibilities. This step begins by first reducing the list of possibilities by removing all entries whose first name is represented in the phone directory by only one initial (the "singlets") and placing them in a separate list.

At this juncture, the twelve digit code number originally input by the user need no longer be used. The program deletes the twelve digit code number from the list of possibilities at this juncture. Twelve digit code numbers are now replaced by new code number of variable length representing the first name of each person on the list of possibilities. For instance, Ann Smith would be represented by "266" corresponding to the letters ANN. At this point the user can be requested to input the person's first name, and the list of possibilities reduced to only those corresponding to that name.

When the list of possibilities is five or less, the program may begin asking the user which person on the list of possibilities is the person for which a number is desired. The synthesized voice will query the user as to which of the remaining possibilities is the person for which a number is desired. The user will select the appropriate name with appropriate address by pressing the "Y" key or the "N" key.

If all other entries on the list of possibilities have been eliminated, the program then checks whether the list of previously segregated entries whose first name is represented by initial only. The program then lists the remaining names only having a first initial associated therewith.

If the user has still not found the number which is desired, the program uses synthetic speech to inform the caller of the lack of success and suggests a "help" number for further assistance.

A diagram located in the appendices portrays the procedure discussed above.

TELEPHONE KEY PAD SPELLING ALGORITHM (TKSA)

The system of the present invention is well suited for use in wordprocessing. Using only twelve keys of a standard TOUCH-TONE telephone set, a person using the system of the present invention has the equivalent of a full typewriter wordprocessor at his or her disposal. Unlike systems taught by the prior art, the system of the present invention is actually simpler to use than an ordinary typewriter. Referring now to FIG. 2 in particular, the telephone key pad spelling algorithm is shown. This system relies on a TOUCH-TONE telephone set 2 having a TOUCH-TONE key pad 4 connected by telephone lines or the like to a host station H having a computer 8. The computer 8 may be connected to the telephone line 6 by TOUCH-TONE decoder 11 through the telephone lines to remote station R where the telephone set 2 is located. Alternatively, computer 8 may be directly hooked to the telephone set 2 at same location as the telephone set 2.

A person practicing the TKSA system of the present invention may use the TOUCH-TONE telephone set 2 by using the TOUCH-TONE keys 2 through 9 to input the twenty-six letters of the alphabet. As seen in Table III, punctuation for the TKSA system may be input into the TOUCH-TONE telephone key pad by keying a "1" and then an abbreviation for the punctuation system desired. As seen in Table IV special commands such as "backspace" and the like may be input into the TKSA system by keying a "1" and then a suitable abbreviation for the special command. Other wordprocessing commands would be added in a similar manner as needed for a particular application. Numbers may be input into the system by using the number sign "#" followed by the appropriate number. The zero key "0" or "operator" key may be used as a word delimiter key or space bar.

TABLE III______________________________________SEQUENCE "1" AND COMMAND PUNCTUATIONOF KEYS ABBREVIATION DESIRED______________________________________1737 1per period1266 1com comma1752 1sla slash mark1783 1que question mark1392 1exc exclamation point1736 1sem semicolon1265 1col colon1276 1apo apostrophe1497 1hyp hyphen1786 1quo quote sign1758 1plu plus sign1768 1pou pound sign, e.g. #1365 1dol dollar sign1728 1pct percent sign1267 1amp ampersand1285 1bul bullet1673 1ope open parenthesis1256 1clo close parenthesis1378 1equ equal sign1772 1spa spacebar1546 1lin line feed1738 1car carriage return1822 1tab tab1222 1bac backspace______________________________________ TABLE IV______________________________________NUM- "1" AND COM-BER OF MAND ABBRE-KEY VIATION COMMAND DESIRED______________________________________1372 1era erase-backspace (erases previous word)1686 1num number (prompts: "input number")1533 1kee keep file (prompts: "input keep file name")1346 1fin find file (prompts: "input find- file name")1639 1new new paragraph1234 1beg begin again (erases screen)1363 1end end (prompts: "return to operating system?")1233 1add add new word (prompts: "first letter" then "Intend A?" "Intend B?"; "second letter" "Intend J?" "Intend K?" etc.)______________________________________

A person using the TKSA system is first prompted to input a word. Upon receiving the keyed digits, the program first checks the word to see if the word begins with the number 1, indicating punctuation or a special command. Next, the program uses an efficient sorting routine to select the subset of the main data base that will contain the word corresponding to the keyed digits. If the word was not found in the main data base, as in the case of words with matching digits, then a sorting routine is used to select the subset of the matching words data base that would contain the word corresponding to the input digits and the correct word is identified through Boolean exclusion.

In an alternate arrangement, the user could key in a series of words and assist the computer in verifying each correct word through the process of Boolean exclusion at a later point in time.

For example, if a person using the TKSA system wishes to write the statement "I have gone home" The following keys are input into the TKSA system: 4-0-4-2-8-3-0-4-6-6-3-0-4-6-6-3-0. Having receive the digits keyed by the user, the computer searches the data base and returns the corresponding entries, "I have gone home".

The foregoing exemplative text is especially interesting in that it contains two words which have identical TKSA numerical expressions. That is "gone" and "home" are both represented by "4663" in the TKSA system and therefore, cannot be distinguished from each other by the computer. The computer will proceed to print the text, printing all words that have a unique TKSA number. For example, the computer will print "I" in that the "4" key represents the letters "G, H and I" and since "I" is the only one letter word represented by the "4" key, the computer will print "I". When the computer reaches the word which is represented by the digits "4663", the computer eliminates incorrect entries by Boolean exclusion. For instance, the computer will ask: "Is GONE the word you intended? "Y" or "N". Is HOME the word you intended? "Y" or "N". Is HONE the word you intended? "Y" or "N"". Once the correct word is selected, the program proceeds with the next word. Since the next word is represented by the digits "4663", the program will proceed in a similar manner as it had done for the word "gone". The program next responds with a period for the punctuation command 1per.

The above example contained two words which have an identical digital index in the TKSA system. The TKSA system is especially useful in that relatively few words having a length of six letters or longer have a TKSA digital index identical with that of another word in the data base. One reason for this, is that each vowel (a, e, i, o, u) is represented by a unique key on the TOUCH-TONE telepone key pad.

PORTABLE WORDPROCESSOR

Referring to FIG. 3 in particular, there is shown a compact portable data transmission and access device generally designated A. This device comprises a telephone type key pad 14 adjacent a display screen 16. Within a housing 18 there is a central processing unit, an appropriate data base, and list processing software which provide the function of computer 8 and data base 7 discussed in the embodiments above.

A person using the portable key pad may input information using the key pad 14 by depressing appropriate keys. The display screen 16 displays the keyed information in words produced by the computer. In the case of a TKSA digital string which represents more than one word, the display screen will display all words corresponding to the digital string, and eliminates incorrect words by Boolean exclusion. In this way, the person using the portable key pad can key words or the like without the use of a large typewriter type key pad.

In addition, a modem type telephone hook-up (not shown) may be provided on housing side 24. In this manner, a person may input data into the portable TKSA device, read the information input to be certain that there are no mistakes and that the correct word appears for every entry, and then the person may transmit the data to a central computer at a different location. The portable device can also use a standard cable hook-up 22, located on housing side 24, to transmit information to, and receive information from, another computer.

The portable key pad 14 is especially useful for handicapped persons. For example, a deaf person could communicate at any telephone by an interactive system wherein key pad 14 is additionally provided with TOUCH-TONE decoder 26. With this construction, a telephone may be coupled to a telephone jack 23 and TOUCH-TONE decoder 26. A user at a distant location may engage in a dialog with a deaf person using the key pad 14 and an electronic speech synthesis device (not shown).

The key pad 14 utilizing the TKSA system along with a processing unit may also be useful for persons who are blind in that less keys are involved, and also for persons who have difficulty controlling their hands or the like. Additionally, in the case of the blind, a braille printer means may be provided with the key pad unit 14.

Appendices A through E form a part of this disclosure. Appendix A is a demonstration program of a telephone spelling system and associated algorithm. Appendix B is a demonstration program of a telephone directory system and associated algorithm. Appendix C is sample data base for the demonstration program of a telephone directory system. Appendix D is a sample data base for the demonstration program of the telephone spelling system. Appendix E is another sample data base using the spanish language for the demonstration program of the telephone spelling system.

While this invention has been described as having preferred design, it is understood that it is capable of further modification, uses and/or adaptations of the invention following in general the principle of the invention and including such departures from the present disclosure as come within known or customary practice in the art to which the invention pertains, and as may be applied to the essential features set forth, and fall within the scope of the invention of the limits of the appended claims. ##SPC1##

Claims

1. The method of obtaining a desired data base entry in a computer system including a keyboard means linked to a data base, which includes differentiating matched data base entries obtained by electrical signals transmitted to the data base by said keyboard means which transmits indicia knowledge to a user and accesses the data base wherein each key of said keyboard represents a plurality of indicia and each key is capable of producing a unique electrical signal comprising the steps of:

(a) selecting a key or sequence of keys representing an indicia or string of indicia which is knowledgeable to the user;

(b) activating said key or sequence of keys selected;

(c) producing a signal or sequence of signals corresponding to said key or sequence of keys activated;

(d) comparing said signal or sequence of signals to said data base having a multiplicity of indexed data entries having at least one knowledgeable indicia or string of indicia associated therewith;

(e) selecting from said data base all indexed data entries matching said produced signal or sequence of signals and compiling all of said entries matching said produced signal or sequence of signals into a list of possibilities wherein at least two data base entries are included on said list of possibilities;

(f) analyzing all of said data entries on said list of possibilities at least a first time and determining at least a first indicia of at least one of said data entries formulated on said list of possibilities which distinguishes from at least one corresponding indicia of at least one other of said data entries formulated on said list of possibilities;

(g) querying the user at least a first time regarding said distinguishing indicia;

(h) said user responding to at least said first query;

(i) processing said user's response to at least said first query to determine the data entry desired by the user, and;

(j) informing the user of the desired data entry.

2. The method as in claim 1, wherein the step of:

(a) informing the user of the desired data entry includes providing information associated with the data entry to the user.

3. The method as in claim 2, wherein:

(a) said key pad is a standard touch-tone key pad and said electrical signals are produced by a TOUCH-TONE generator, each signal being in the form of one of twelve DTMF tones corresponding to the twelve keys of a TOUCH-TONE key pad.

4. The method as in claim 3, wherein:

(a) said data entries in said data base each correspond to one of a plurality of names and associated addresses listed in a telephone directory, and;

(b) said information associated with each of said data entries is a telephone number.

5. The method as in claim 4, wherein:

(a) said associated addresses include state, city and street localities;

(b) said data entries each include at least a first letter of said corresponding names;

(c) said data entries each further include at least three letters of said city associated with said corresponding names, and;

(d) said data entries each further include at least two letters of said state associated with said corresponding name.

6. A method as in claim 1, wherein:

(a) said query of the user at least a first time is solely with respect to said distinguishing indicia.

7. A method as in claim 1, wherein:

(a) said first indicia is common to at least two of said indexed data entries formulated on said list of possibilities and distinguishes said indexed data entries having said common first indicia from corresponding indicia of at least two other of said indexed data entries formulated on said list of possibilities;

(b) said user's response to said at least first query includes one of indicating said common first indicia is different from a corresponding indicia of said data entry desired and indicating said common first indicia is the same as a corresponding indicia of said data entry desired, and;

(c) said processing of said user's response to determine the desired data entry includes one of excluding said indexed data entries having said common first indicia from said list of possibilities and excluding said at least two other indexed data entries from said list of possibilities.

8. A method as in claim 1, wherein:

(a) said first indicia is common to at least two of said indexed data entries formulated on said list of possibilities;

(b) said user's response to said at least first query includes indicating that said common first indicia is different from a corresponding indicia of said data entry desired, and;

(c) said processing of said user's response to determine the desired data base entry includes excluding said at least two data entries having said common letter from said list of possibilities.

9. A method of informing a user of a telephone number for a desired entity via an automated directory assistance system including a TOUCH-TONE type telephone keying means linked to a data base having a plurality of data entries each corresponding to an entity listed in a telephone directory and differentiating means for distinguishing matched data entries obtained by activating only a single key of said TOUCH-TONE keying means per letter representing a data entry desired wherein said keying means transmits an electrical signal to said data base and each key of said TOUCH-TONE keying means represents a plurality of letters and is capable of producing only one unique electrical signal comprising the steps of:

(a) selecting a key or sequence of keys representing a letter or series of letters of an entity for which the telephone number is desired;

(b) activating said key or sequence of keys selected;

(c) producing a signal or sequence of signals corresponding to said key or sequence of keys activated;

(d) comparing said sequence of signals to said data base having a multiplicity of indexed data entries having at least one letter or series of letters associated therewith;

(e) selecting from said data base all indexed data entries matching said produced signal or sequence of signals and compiling all of said data entries matching said produced signal or sequence of signals into a list of possibilities wherein at least two data entries are included on said list of possibilities;

(f) analyzing all of said data entries on said list of possibilities at least a first time and determining at least a first letter of at least one of said data entries formulated on said list of possibilities which distinguishes from at least one corresponding letter of at least one other of said data entries formulated on said list of possibilities;

(g) querying the user at least a first time regarding said distinguishing letter;

(h) said user responding to at least said first query;

(i) processing said user's response to at least said first query to determine the data entry desired by the user, and;

(j) informing the user of the telephone number associated with said data entry desired.

10. A method as in claim 9, wherein:

(a) said query of the user at least a first time is solely with respect to said distinguishing letter.

11. A method as in claim 9, wherein:

(a) said key or sequence of keys selected include at least three keys representing the last name of the entity for which the telephone number is desired;

(b) said key or sequence of keys selected further include at least three keys representing the city type locality in which the desired entity resides, and;

(c) said key or sequence of keys selected further include at least two keys representing the state in which the desired entity resides.

12. A method as in claim 11, wherein:

(a) said key or sequence of keys selected further include at least a first key representing the first name of the entity for which the telephone number is desired.

13. A method as in claim 9, wherein:

(a) said key or sequence of keys selected include at most three keys representing the last name of the entity for which a telephone number is desired;

(b) said key or sequence of keys selected include at most three keys representing the city type locality in which the desired entity residues, and;

(c) said key or sequence of keys selected include at most two keys representing the state in which the desired entity resides.

14. A method as in claim 13, wherein:

(a) said key or sequence of keys selected further include at most three keys representing the first name of the entity for which a telephone number is desired.

15. A method as in claim 9, wherein:

(a) said first letter is common to at least two of said indexed data entries formulated on said list of possibilities and distinguishes said indexed data entries having said common first letter from at least two other of said indexed data entries formulated on said list of possibilities;

(b) said user's response to said at least first query includes one of indicating said common first letter is different from a corresponding letter of said data entry desired and said common letter is the same as a corresponding letter of said data entry desired, and;

(c) said processing of said user's response to determine the desired data entry includes one of excluding said at least two indexed data entries having said common indicia from said list of possibilities and excluding said at least two other indexed data entries from said list of possibilities.

16. A method as in claim 9, wherein:

(a) said first letter is common to at least two of said indexed data entries formulated on said list of possibilities;

(b) said user's response to said at least first query includes indicating that said common first letter is different from a corresponding letter of said data entry desired, and;

(c) said processing of said user's response to determine the data entry desired includes excluding said at least two data entries having said common letter from said list of possibilities.

17. An apparatus for obtaining a desired data entry and differentiating matched data entries obtained by electrical signals transmitted to a data base via a keyboard transmitting means which transmits indicia knowledgeable to a user and accesses the data base wherein each key of the keyboard transmitting means represents a plurality of indicia and each key is capable of producing only one unique electrical signal comprising:

(a) means for keying in an indicia or sequence of indicia knowledgeable to a user;

(b) means for producing a signal or sequence of signals corresponding to the indicia or sequence of indicia knowledgeable to a user;

(c) means for transmitting the signal or sequence of signals produced to a data base;

(d) means for comparing the signal or sequence of signals to said data base having a multiplicity of indexed data entries having at least one knowledgeable indicia or string of indicia associated therewith;

(e) means for selecting from said data base all indexed data entries matching said produced signal or sequence of signals and compiling all of said data entries matching said produced signal or sequence of signals into a list of possibilities wherein at least two data entries are included on said list of possibilities;

(f) means for analyzing all of said data entries on said list of possibilities at least a first time and determining at least a first indicia of one of said data entries formulated on said list of possibilities which distinguishes from at least one indicia of at least one other of said data entries formulated on said list of possibilities;

(g) means for querying the user at least a first time regarding said distinguishing indicia;

(h) means for enabling the user to respond to at least said first query;

(i) means for processing said user's response to at least said first query to determine the data entry desired by the user, and;

(j) means for informing the user of the desired data entry.

18. An apparatus as in claim 17, wherein:

(a) said apparatus is a portable unit.

19. An apparatus as in claim 17, wherein:

(a) said data base includes at least one hundred thousand indexed data entries.

20. An apparatus as in claim 17, wherein:

(a) said keying includes a standard TOUCH-TONE key pad; and,

(b) said signal producing means includes a TOUCH-TONE generator whereby a signal in the form of one of twelve DTMF tones is produced corresponding to the one of the twelve keys of the TOUCH-TONE key pad activated by the user.