This application is related to co-pending application titled “VOICE RESPONSE UNIT MAPPING,” filed on Sep. 2, 2008, Ser. No. 12/202,691, and co-pending application titled “VOICE RESPONSE UNIT SHORTCUTTING,” filed on Sep. 2, 2008, Ser. No. 12/202,682, the contents of which are hereby incorporated by reference. This application is further related to co-pending application titled “VOICE RESPONSE UNIT PROXY UTILIZING DYNAMIC WEB INTERACTION,” filed on Oct. 3, 2008, Ser. No. 12/245,212.
This disclosure relates to voice response unit (VRU) telephony, and more particularly to a system and method for providing a VRU harvesting service for end-users.
In telephony, interactive voice response (IVR) provides a phone technology that allows a computer or voice response unit (VRU) to detect voice and touch tones using a normal phone call. The VRU can respond with pre-recorded or dynamically generated audio to further direct callers on how to proceed. VRUs can be used to control almost any function where the interface can be broken down into a series of simple menu choices or options. Once constructed, VRUs generally scale well to handle large call volumes.
In operation, a caller dials a telephone number that is answered by the VRU. The VRU executes an application which is tied to the number dialed DNIS (Dialed Number Identification Service). As part of the application, prerecorded audio files or dynamically generated Text to Speech (TTS) audio explain the options available to the caller. The caller is given the choice to select options using DTMF tones or spoken words. Speech recognition may be used to carry out more complex transactions and simplifies the application menu structure.
Unfortunately, interfacing with a VRU can be annoying for people as the presentation of information is inherently slow. Moreover, gathering information, such as balance information or payment due dates, from multiple companies that utilize VRUs requires a significant amount of user interaction. Accordingly, there is a need in the art for allowing users to more effectively harvest data from VRUs.
The present invention relates to a system, method and program product for providing VRU harvesting. In one embodiment, there is a system for harvesting voice response unit (VRU) data, comprising: an account management system for allowing a user to identify a set of VRUs and associated data desired from each VRU; a navigation system for automatically navigating each VRU and collecting the desired data from each VRU; and an output system for outputting the desired data for the user.
In a second embodiment, there is a computer readable medium having a program product stored therein for providing voice response unit (VRU) harvesting, comprising: program code for allowing a user to identify a set of VRUs and associated data desired from each VRU; program code for automatically navigating each VRU and collecting the desired data from each VRU; and program code for outputting the desired data for the user.
In a third embodiment, there is a method of providing voice response unit (VRU) harvesting, comprising: providing an interface for allowing a user to identify a set of VRUs and associated data desired from each VRU; automatically navigating each VRU and collecting the desired data from each VRU; and outputting the desired data for the user.
In a fourth embodiment, there is a method for deploying a system for providing voice response unit (VRU) harvesting, comprising: providing a computer infrastructure being operable to: provide an interface for allowing a user to identify a set of VRUs and associated data desired from each VRU; automatically navigate each VRU and collecting the desired data from each VRU; and output the desired data for the user.
The illustrative aspects of the present invention are designed to solve the problems herein described and other problems not discussed.
These and other features of this invention will be more readily understood from the following detailed description of the various aspects of the invention taken in conjunction with the accompanying drawings.
The drawings are merely schematic representations, not intended to portray specific parameters of the invention. The drawings are intended to depict only typical embodiments of the invention, and therefore should not be considered as limiting the scope of the invention. In the drawings, like numbering represents like elements.
Referring to
VRU harvesting system 18 includes a user interface 20 that allows user 34 to access a user account management system 22, in which the user 34 can sign up for the harvesting service and manage a user account. More particularly, user account management system 22 allows the user 34 to identify which providers/VRUs to harvest data from, how often it should be harvested or outputted, and what specific types of data are desired. For instance, user 34 may have several credit cards and wants to know the balance, payment amount and due date for each every Monday. User account management system 22 may for instance include a graphical user interface (GUI) for setting up or modifying the user account to make such selections, e.g., using dropdown menus, dialog windows, radio buttons, etc. The resulting selections are then stored in a user account database 40. User information specific to each VRU 36, such as account data, passwords, date of birth, etc., can likewise be collected by account management system 22 and stored in the user account database 40.
User interface 20 also provides a conduit through which VRU data output system 26 can provide the collected data back to the user. This can be done in any manner using any format, e.g., via a web portal using HTML, email using plain text, a telephone call using voice synthesis, etc. The format and conduit through which desired data is presented back to the user 34 may be configured in the user account management system 22. Collected data may be stored temporarily or permanently in the user account database 40 or other location such that it can be made available for output back the user 34.
VRU harvesting system 18 utilizes a VRU map database 38 that includes a VRU map 35 of each VRU 36 targeted by the harvesting service. Each VRU map 35 is essentially a hierarchical representation of the options and functions associated with a given VRU 36. An example VRU map 35 is shown below in
VRU navigation system 30 provides a mechanism for automatically navigating a VRU 36 based on an associated VRU map 35. Namely, by indentifying where a desired option or node exists in a VRU map 35, VRU navigation system 30 can calculate a path to the node and ascertain what inputs are required to reach the node. Once the path and associated inputs is calculated, VRU navigation system 30 initiates a call with the targeted VRU 36 and then begins navigating the VRU 36 along the path to obtain the required data. When navigation inputs are required by the VRU 36 to proceed (e.g., “enter 1 for accounts”), the VRU navigation system 30 simply generates the necessary input to proceed based on pre-calculated path. When user information is required by the VRU 36 (e.g., “please enter your account number”), the information is retrieved from the user account database 40. Data may be entered into the VRU 36, e.g., by generating tones or via a text to voice generation system that speaks the information. In some instances, a speech recognition system may be employed to determine what user information is required in a dynamic manner.
Accordingly, if an account balance is desired from a bank VRU 36, VRU navigation system 30 will calculate a path through the bank VRU 36 based on the VRU map 35, automatically entering the appropriate inputs, account numbers, etc., to reach the appropriate option and obtain the desired data. Once the appropriate node in the VRU 36 is reached by the VRU navigation system 30, VRU data collection system 32 records the desired data and stores the information in the user account database 40. Speech recognition can for example be utilized to convert spoken information into textual data. An illustrative navigation system is described in related case, VOICE RESPONSE UNIT SHORTCUTTING, filed on Sep. 2, 2008, Ser. No. 12/202,682.
As noted, VRU data output system 26 may then be utilized to output the data to the user 34. Data may be formatted in any manner for the user 34, e.g., in a calendar, table, graph, etc. Moreover, a hyperlink system 27 may be utilized to allow the user 34 to select a particular piece of data, e.g., on a smart phone. Once selected, hyperlink system 27 will automatically navigate to the associated option on the corresponding VRU 36. This thus allows the user 34 to quickly verify the data.
Referring again to
I/O 14 may comprise any system for exchanging information to/from an external resource. External devices/resources may comprise any known type of external device, including a monitor/display, speakers, storage, another computer system, a hand-held device, keyboard, mouse, voice recognition system, speech output system, printer, facsimile, pager, etc. Bus 17 provides a communication link between each of the components in the computer system 10 and likewise may comprise any known type of transmission link, including electrical, optical, wireless, etc. Although not shown, additional components, such as cache memory, communication systems, system software, etc., may be incorporated into computer system 10.
Access to computer system 10 may be provided over a network such as the Internet, a local area network (LAN), a wide area network (WAN), a virtual private network (VPN), etc. Communication could occur via a direct hardwired connection (e.g., serial port), or via an addressable connection that may utilize any combination of wireline and/or wireless transmission methods. Moreover, conventional network connectivity, such as Token Ring, Ethernet, WiFi or other conventional communications standards could be used. Still yet, connectivity could be provided by conventional TCP/IP sockets-based protocol. In this instance, an Internet service provider could be used to establish interconnectivity. Further, as indicated above, communication could occur in a client-server or server-server environment.
It should be appreciated that the teachings of the present invention could be offered as a business method on a subscription or fee basis. For example, a computer system 10 comprising a VRU harvesting system 18 could be created, maintained and/or deployed by a service provider that offers the functions described herein for customers. That is, a service provider could offer to deploy or provide VRU shortcuts as described above.
It is understood that in addition to being implemented as a system and method, the features may be provided as a program product stored on a computer-readable medium, which when executed, enables computer system 10 to provide a VRU harvesting system 18. To this extent, the computer-readable medium may include program code, which implements the processes and systems described herein. It is understood that the term “computer-readable medium” comprises one or more of any type of physical embodiment of the program code. In particular, the computer-readable medium can comprise program code embodied on one or more portable storage articles of manufacture (e.g., a compact disc, a magnetic disk, a tape, etc.), on one or more data storage portions of a computing device, such as memory 16 and/or a storage system.
As used herein, it is understood that the terms “program code” and “computer program code” are synonymous and mean any expression, in any language, code or notation, of a set of instructions that cause a computing device having an information processing capability to perform a particular function either directly or after any combination of the following: (a) conversion to another language, code or notation; (b) reproduction in a different material form; and/or (c) decompression. To this extent, program code can be embodied as one or more types of program products, such as an application/software program, component software/a library of functions, an operating system, a basic I/O system/driver for a particular computing and/or I/O device, and the like. Further, it is understood that terms such as “component” and “system” are synonymous as used herein and represent any combination of hardware and/or software capable of performing some function(s).
The block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Although specific embodiments have been illustrated and described herein, those of ordinary skill in the art appreciate that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiments shown and that the invention has other applications in other environments. This application is intended to cover any adaptations or variations of the present invention. The following claims are in no way intended to limit the scope of the invention to the specific embodiments described herein.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5561703 | Arledge et al. | Oct 1996 | A |
| 5802526 | Fawcett et al. | Sep 1998 | A |
| 5864605 | Keshav | Jan 1999 | A |
| 5946377 | Wolf | Aug 1999 | A |
| 6016336 | Hanson | Jan 2000 | A |
| 6058179 | Shaffer et al. | May 2000 | A |
| 6091805 | Watson | Jul 2000 | A |
| 6131810 | Weiss et al. | Oct 2000 | A |
| 6354490 | Weiss et al. | Mar 2002 | B1 |
| 6412073 | Rangan | Jun 2002 | B1 |
| 6754332 | Kneipp et al. | Jun 2004 | B1 |
| 6788770 | Cook et al. | Sep 2004 | B1 |
| 6999448 | Klein | Feb 2006 | B1 |
| 7065188 | Mei et al. | Jun 2006 | B1 |
| 7092509 | Mears et al. | Aug 2006 | B1 |
| 7113200 | Eshkoli | Sep 2006 | B2 |
| 7180985 | Colson et al. | Feb 2007 | B2 |
| 7215743 | Creamer et al. | May 2007 | B2 |
| 7224790 | Bushey et al. | May 2007 | B1 |
| 7272212 | Eberle et al. | Sep 2007 | B2 |
| 7340040 | Saylor et al. | Mar 2008 | B1 |
| 7386103 | Chahal | Jun 2008 | B1 |
| 7509266 | Rogers et al. | Mar 2009 | B2 |
| 7515695 | Chan et al. | Apr 2009 | B1 |
| 7715531 | Golding et al. | May 2010 | B1 |
| 7715547 | Ibbotson et al. | May 2010 | B2 |
| 7742580 | Cooper et al. | Jun 2010 | B2 |
| 7773731 | Malik et al. | Aug 2010 | B2 |
| 7778397 | Erhart et al. | Aug 2010 | B2 |
| 7809376 | Letourneau et al. | Oct 2010 | B2 |
| 7881443 | Langseth et al. | Feb 2011 | B2 |
| 7961088 | Watts et al. | Jun 2011 | B2 |
| 8009813 | Chang | Aug 2011 | B2 |
| 8036348 | Kortum et al. | Oct 2011 | B2 |
| 8050392 | Adams et al. | Nov 2011 | B2 |
| 8051369 | Zirngibl et al. | Nov 2011 | B2 |
| 8054952 | Or-Bach et al. | Nov 2011 | B1 |
| 8073112 | Jaiswal et al. | Dec 2011 | B2 |
| 8094788 | Eberle et al. | Jan 2012 | B1 |
| 8130918 | Zirngibl et al. | Mar 2012 | B1 |
| 8131524 | Bushey et al. | Mar 2012 | B2 |
| 8189756 | Bhogal et al. | May 2012 | B2 |
| 8229091 | Romeo | Jul 2012 | B2 |
| 8243900 | Kumhyr | Aug 2012 | B2 |
| 8265234 | Singh | Sep 2012 | B2 |
| 8340257 | Paczkowski et al. | Dec 2012 | B1 |
| 8406388 | Or-Bach et al. | Mar 2013 | B2 |
| 8494139 | Byrne et al. | Jul 2013 | B2 |
| 8599836 | Van Buren et al. | Dec 2013 | B2 |
| 8687777 | Lavian et al. | Apr 2014 | B1 |
| 8718239 | Madhavapeddi et al. | May 2014 | B1 |
| 20030074091 | Kim | Apr 2003 | A1 |
| 20030099335 | Tanaka et al. | May 2003 | A1 |
| 20030161449 | Plan | Aug 2003 | A1 |
| 20040093211 | Reynolds et al. | May 2004 | A1 |
| 20040122941 | Creamer et al. | Jun 2004 | A1 |
| 20040176958 | Salmenkaita et al. | Sep 2004 | A1 |
| 20050081152 | Commarford et al. | Apr 2005 | A1 |
| 20050147219 | Comerford | Jul 2005 | A1 |
| 20050201544 | Book et al. | Sep 2005 | A1 |
| 20060245557 | Paden et al. | Nov 2006 | A1 |
| 20060285657 | Lippke et al. | Dec 2006 | A1 |
| 20070024454 | Singhal | Feb 2007 | A1 |
| 20070081655 | Sun et al. | Apr 2007 | A1 |
| 20070135101 | Ramati et al. | Jun 2007 | A1 |
| 20080039010 | Vance et al. | Feb 2008 | A1 |
| 20080046363 | Ali et al. | Feb 2008 | A1 |
| 20080249936 | Miller et al. | Oct 2008 | A1 |
| 20080298560 | Purdy et al. | Dec 2008 | A1 |
| 20080304632 | Catlin et al. | Dec 2008 | A1 |
| 20090042539 | Jiang et al. | Feb 2009 | A1 |
| 20090048864 | Koslowski et al. | Feb 2009 | A1 |
| 20090094283 | Baudisch et al. | Apr 2009 | A1 |
| 20090268883 | Agapi et al. | Oct 2009 | A1 |
| 20100054430 | Grigsby et al. | Mar 2010 | A1 |
| 20100057456 | Grigsby et al. | Mar 2010 | A1 |
| 20100088613 | DeLuca et al. | Apr 2010 | A1 |
| 20100185449 | Wu et al. | Jul 2010 | A1 |
| 20100310059 | Davis et al. | Dec 2010 | A1 |
| 20110173119 | Kumar et al. | Jul 2011 | A1 |
| 20120041775 | Cosentino et al. | Feb 2012 | A1 |
| 20130022181 | Or-Bach et al. | Jan 2013 | A1 |
| 20130108030 | Snir et al. | May 2013 | A1 |
| 20130301814 | Berger et al. | Nov 2013 | A1 |
| 20140029473 | Riley et al. | Jan 2014 | A1 |
| 20140112465 | Sartini | Apr 2014 | A1 |
| 20140122053 | Lotan et al. | May 2014 | A1 |
| 20140222503 | Vijayaraghavan et al. | Aug 2014 | A1 |
| 20140233711 | Davis et al. | Aug 2014 | A1 |
| 20140241513 | Springer | Aug 2014 | A1 |
| 20140329514 | Meriaz et al. | Nov 2014 | A1 |
| 20140331177 | Bi et al. | Nov 2014 | A1 |
| Number | Date | Country |
|---|---|---|
| 20000072653 | Dec 2000 | KR |
| 10-0451097 | Dec 2004 | KR |
| Entry |
|---|
| United States Patent and Trademark Office, Notice of Allowance for U.S. Appl. No. 13/590,641, Sep. 11, 2013, pp. 1-9, Alexandria, VA, USA. |
| United States Patent and Trademark Office, Office Action for U.S. Appl. No. 12/202,682, Jun. 12, 2012, pp. 1-13, Alexandria, VA, USA. |
| United States Patent and Trademark Office, Office Action for U.S. Appl. No. 12/202,682, Mar. 2, 2012, pp. 1-7, Alexandria, VA, USA. |
| United States Patent and Trademark Office, Office Action for Application No. 13/590,641, Mar. 25, 2013, pp. 1-17, Alexandria, VA, USA. |
| Number | Date | Country | |
|---|---|---|---|
| 20100067670 A1 | Mar 2010 | US |