Patent US4866759A successfully refreshed from Google Patents.
US4866759A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Packet network telecommunication system having access nodes with word guessing capability
Assignee: FON-EX Inc
•
Filing: 1987-11-30
•
Granted: 1989-09-12
•
Expires: 2007-11-30
Abstract
Abstract A telecommunication system has the ability to identify words typed out on a DTMF multi-button pad, convert the words into digital format at a telephone access node and transmit that information on a packet transport network to a remote access node where the words are converted into speech and forwarded to the receiver. The sender begins by typing out the letters of the word on the DTMF buttons. As the word is typed out it is compared at an entrance telephone access node to words stored in a word data bank referred to as a word guessing dictionary. The words in the data bank are stored according to length, numeric equivalent and relative frequency. A prompter asks the sender if the identified word is correct. If it is correct, it is converted into ASCII digital format and transmitted by packet transport network to an egress telephone access node near the receiver. A voice synthesizer then converts the ASCII digital information back into speech so that the receiver can listen to the message typed on the DTMF buttons by the sender.
Inventors
- 👤 Bernard N. Riskin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-25 14:26
CPC Classifications
H; H04; H04M; H04M11/00; H04M11/06; H04M11/066; Y; Y10; Y10S; Y10S379/00; Y10S379/906
Claims Analysis
Total Claims: 9
Claim 1
Independent Claim
272 words
A method of communicating information from a sender having a telephone with DTMF buttons to a remote receiver comprising the steps of: spelling a word letter-by-letter by utilizing the DTMF buttons on the sender's telephone; entering a signal on one of said DTMF buttons to indicate the end of the word; comparing each word against an electronic memory which includes a dictionary of words by determining the number of letters in said word and comparing said word against words stored in said dictionary having the same number of letters, said words also being organized according to their relative frequency for any given combination of DTMF outputs; feeding back to the sender a guess which corresponds to the word having the highest relative frequency for a predetermined word length and for a predetermined DTMF tone combination; repeating said comparing step if a guess is rejected and feeding back to the sender another guess at the word corresponding to the same predetermined letter length and having the next most likely relative frequency; automatically shifting from the word guessing mode to a letter-by-letter guessing mode if the dictionary runs out of the guesses for a word of a given predetermined letter length and a predetermined DTMF tone combination; storing each word after it is correctly identified so that said words are assembled into a complete message prior to transmission; transmitting said message as digital data over a packet transport network; converting said data into speech; and, forwarding said speech to said remote receiver, wherein words in a message are entered by the sender and received as spoken words by the receiver at a remote location.
Claim 2
Independent Claim
272 words
A method of communicating information from a sender having a telephone with DTMF buttons to a remote receiver comprising the steps of: spelling a word letter-by-letter by utilizing the DTMF buttons on the sender's telephone; entering a signal on one of said DTMF buttons to indicate the end of the word; comparing each word against an electronic memory which includes a dictionary of words by determining the number of letters in said word and comparing said word against words stored in said dictionary having the same number of letters, said words also being organized according to their relative frequency for any given combination of DTMF outputs; feeding back to the sender a guess which corresponds to the word having the highest relative frequency for a predetermined word length and for a predetermined DTMF tone combination; repeating said comparing step if a guess is rejected and feeding back to the sender another guess at the word corresponding to the same predetermined letter length and having the next most likely relative frequency; automatically shifting from the word guessing mode to a letter-by-letter guessing mode if the dictionary runs out of the guesses for a word of a given predetermined letter length and a predetermined DTMF tone combination; storing each word after it is correctly identified so that said words are assembled into a complete message prior to transmission; transmitting said message as digital data over a packet transport network; converting said data into speech; and, forwarding said speech to said remote receiver, wherein words in a message are entered by the sender and received as spoken words by the receiver at a remote location.
Claim 3
Dependent Claim
31 words
The method of claim 1 further comprising the steps of: converting each word after it is correctly identified into a unique digital number prior to transmission over said packet transport network.
Claim 4
Dependent Claim
216 words
An access node apparatus for sending messages from a sender having a telephone with DTMF buttons connected to a conventional telephone network over a packet transport network to a receiver connected to another conventional telephone network, said access node comprising: a telephone line interface connecting said access node to the telephone network of the sender; a word guessing dictionary means for storing words first according to their letter length, second according to their DTMF tone number equivalents and third according to their relative frequencies; a prompter means connected to said telephone line interface and to said word guessing dictionary means for accessing said word guessing dictionary means; speaker means connected to said prompter means and to said telephone line interface for speaking the word guessed from said word guessing dictionary means to the sender; mode shift means for automatically shifting the mode of said access node from a word guessing mode to a letter-by-letter guessing mode after the sender has exhausted all possible entries in the word guessing dictionary means for a word of a given letter length and for a given DTMF tone combination sequence; and, message storing means connected to said prompter means for storing words and assembling said words into a message prior to transmission as digital data over said packet transport network.
Claim 5
Dependent Claim
216 words
An access node apparatus for sending messages from a sender having a telephone with DTMF buttons connected to a conventional telephone network over a packet transport network to a receiver connected to another conventional telephone network, said access node comprising: a telephone line interface connecting said access node to the telephone network of the sender; a word guessing dictionary means for storing words first according to their letter length, second according to their DTMF tone number equivalents and third according to their relative frequencies; a prompter means connected to said telephone line interface and to said word guessing dictionary means for accessing said word guessing dictionary means; speaker means connected to said prompter means and to said telephone line interface for speaking the word guessed from said word guessing dictionary means to the sender; mode shift means for automatically shifting the mode of said access node from a word guessing mode to a letter-by-letter guessing mode after the sender has exhausted all possible entries in the word guessing dictionary means for a word of a given letter length and for a given DTMF tone combination sequence; and, message storing means connected to said prompter means for storing words and assembling said words into a message prior to transmission as digital data over said packet transport network.
Claim 6
Dependent Claim
32 words
The apparatus of claim 3 further comprising: header means connected to said prompter means for generating a routing header for each message, wherein said message header directs said message to the receiver.
Claim 7
Dependent Claim
28 words
The apparatus of claim 4 wherein said speaker means further includes: text-to-speech synthesizing means for converting the digital data transmitted over the packet transport network into audible speech.
Claim 8
Dependent Claim
22 words
The apparatus of claim 5 further comprising: packet transport network access means for connecting said access node to said packet transport network.
Claim 9
Dependent Claim
19 words
The apparatus of claim 6 further comprising: tone storage means connected to said prompter for storing DTMF tones means.
References Cited (Backward Citations)
US3533069A
Cited
GB1320896A
Cited
GB1320895A
Cited
US3778553A
Cited
US3967273A
Cited
US4012599A
Cited
US4087638A
Cited
US4164025A
Cited
US4191854A
Cited
US4307266A
Cited
US4532378A
Cited
US4427848A
Cited
US4427848B1
Cited
US4426555A
Cited
US4685125A
Cited
US4614841A
Cited
US4577062A
Cited
US4649563A
Cited
US4633041A
Cited
US4608457A
Cited
US4608460A
Cited
US4585908A
Cited
US4737980A
Cited
US4677659A
Cited
US4757267A
Cited
US4757267B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1992-09-11 | 1993-03-13 | 1993-09-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1996-09-11 | 1997-03-13 | 1997-09-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2000-09-11 | 2001-03-13 | 2001-09-12 | $7700.00 | Window Closed / Lapsed |