This application generally relates to communications and, more particularly, to messaging and to message synthesis.
Prompting systems are very popular in today's communications environment. These prompting systems, such as an Interactive Voice Response (IVR) system, quickly direct a user to a particular department, extension, or information. These prompting systems, additionally, are an efficient and less expensive method of resolving customer inquiries. Although a minority of users lament the loss of human operators, most users are satisfied with the faster customer service offered by today's prompting systems.
While prompting systems are great for both businesses and users, prompting systems often become stale. That is, the menu of prompts becomes outdated or even wrong. Because business budgets are often tight, only rarely will the menu of prompts be analyzed and compared to current needs. The budget must also fund one or more software programmers to reconfigure the menu of prompts to reflect the update. (The user then often hears the standard message “Please pay careful attention—our menu items have changed.”) Because most businesses, however, only rarely budget money to review and to modify the menu of prompts, the menu of prompts is often outdated. Menus may be so outdated that they sometimes result in a frustrating “dead end.” What is needed, then, is a prompting system that automatically updates itself, reducing the need for human analysis and reconfiguration.
The aforementioned problems, and other problems, are reduced, according to the exemplary embodiments, using methods, systems, and products that dynamically change a menu of prompts in a prompting system. The prompting system may be voice-based, such as an Interactive Voice Response (IVR) system. The prompting system, however, could also prompt a user with electronic messages. However the prompts are made, exemplary embodiments dynamically change the prompts whenever needed, with little or no human interaction. That is, exemplary embodiments describe a “self-learning” menu of prompts. The exemplary embodiments automatically reconfigure the menu of prompts according to a set of rules. This set of rules defines how the menu of prompts may be autonomously and dynamically changed. The set of rules, additionally, may also establish boundaries that limit or confine those dynamic changes. The prompting system then uses this set of rules when reconfiguring the menu of prompts.
The exemplary embodiments describe a method for dynamically changing an Interactive Voice Response (IVR) system. Responses to a menu of prompts are monitored. Responsive to the responses, a presentation order of the menu of prompts is automatically updated according to a set of rules. The set of rules describes qualifications for dynamically changing the menu of prompts based on the responses.
In another of the embodiments, a system is disclosed for dynamically changing an Interactive Voice Response (IVR) system. An Interactive Voice Response (IVR) application is stored in memory and a processor communicates with the memory. The processor monitors responses to a menu of prompts in the IVR system. Responsive to the responses, the processor automatically updates a presentation order of the menu of according to a set of rules. The set of rules describes qualifications for dynamically changing the menu of prompts based on the responses.
In yet another embodiment, a computer program product is also disclosed for dynamically changing an Interactive Voice Response (IVR) system. The computer program product comprises a computer-readable medium storing computer code. This computer code monitors responses to a menu of prompts in the IVR system. Responsive to the responses, the computer code automatically updates a presentation order of the menu of prompts according to a set of rules. The set of rules describes qualifications for dynamically changing the menu of prompts based on the responses.
Other systems, methods, and/or computer program products according to the exemplary embodiments will be or become apparent to one with ordinary skill in the art upon review of the following drawings and detailed description. It is intended that all such additional systems, methods, and/or computer program products be included within this description, be within the scope of the claims, and be protected by the accompanying claims.
These and other features, aspects, and advantages of the exemplary embodiments are better understood when the following Detailed Description is read with reference to the accompanying drawings, wherein:
The exemplary embodiments will now be described more fully hereinafter with reference to the accompanying drawings. The exemplary embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein. These embodiments are provided so that this disclosure will be thorough and complete and will fully convey the scope of the invention to those of ordinary skill in the art. Moreover, all statements herein reciting embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future (i.e., any elements developed that perform the same function, regardless of structure).
Thus, for example, it will be appreciated by those of ordinary skill in the art that the diagrams, schematics, illustrations, and the like represent conceptual views or processes illustrating the exemplary embodiments. The functions of the various elements shown in the figures may be provided through the use of dedicated hardware as well as hardware capable of executing associated software. Similarly, any switches shown in the figures are conceptual only. Their function may be carried out through the operation of program logic, through dedicated logic, through the interaction of program control and dedicated logic, or even manually, the particular technique being selectable by the entity implementing this invention. Those of ordinary skill in the art further understand that the exemplary hardware, software, processes, methods, and/or operating systems described herein are for illustrative purposes and, thus, are not intended to be limited to any particular named manufacturer.
According to exemplary embodiments, methods, systems, and products are disclosed that dynamically change a menu of prompts in a prompting system. The prompting system may be voice-based, such as an Interactive Voice Response (IVR) system. The prompting system, however, could also prompt a user with electronic messages. However the prompts are made, exemplary embodiments dynamically change the prompts whenever needed, with little or no human interaction. That is, exemplary embodiments describe a “self-learning” menu of prompts. The exemplary embodiments reconfigure the menu of prompts according to a set of rules. This set of rules defines how the menu of prompts may be autonomously and dynamically changed. The set of rules, additionally, may also establish boundaries that limit or confine those dynamic changes. The prompting system then uses this set of rules when reconfiguring the menu of prompts.
The IVR system 20 differs from a conventional IVR system at least because it dynamically changes its menu. The IVR system 20 audibly and/or visually presents a menu 32 of prompts to users. The menu 32 of prompts is stored in the memory 24. As the users respond to the menu 32 of prompts, the responses are stored in a database 34. The database 34 may also store or maintain historical statistics describing the responses. The IVR system 20 uses the IVR application 22 to monitor and to analyze those responses to automatically and to dynamically change the menu 32 of prompts. According to exemplary embodiments, the menu 32 of prompts is dynamically changed to reflect the frequency or popularity of prompts. Those prompts that are frequently selected are promoted within the menu hierarchy. Those prompts that are less popular will be demoted. The hierarchical tree structure of the menu 32 of prompts dynamically changes based on users' responses. Rather than being a static structure, the menu 32 of prompts expands and contracts to reflect frequency of use. Because the hierarchical tree structure can self-adjust, customer service improves.
According to exemplary embodiments, the IVR system 20 dynamically changes according to a set 36 of rules. The set 36 of rules describes the qualifications for dynamically changing the menu 32 of prompts. The set 36 of rules is stored in the memory 24. Because the hierarchical tree structure can self-adjust, the set 36 of rules imposes restrictions on the configuration of the tree structure. The IVR application 22 uses the set 36 of rules to determine how a prompt qualifies for movement within the tree structure. The set 36 of rules also limits the hierarchical tree structure to defined boundaries. These boundaries ensure that the number of branches and/or tiers within the tree do not grow too large or too small. The IVR application 22 may also use the set 36 of rules to compare historical statistics stored in the database 34. The IVR application 22 may thus use historical statistics to additionally or alternatively determine changes in the presentation order of the menu 32 of prompts.
In the figures that are described below, as in
The promotion rules 38, then, determine when a prompt is promoted to a higher level within the hierarchical tree structure 48. As the Interactive Voice Response (IVR) application 22 monitors and analyzes the cumulative responses, the IVR application 22 determines the percentage of responses for any prompt. If any prompt's percentage satisfies a tier threshold, then that prompt may be promoted to a higher level or tier. As the following paragraphs explain, however, other rules may limit the ability of IVR application 22 to promote prompts.
The same tier need not have equal promotion and demotion thresholds. At first glace the reader might think a tier's promotion and demotion thresholds would be the same value. If a certain threshold is required for promotion into a tier, then any percentage below that same threshold would qualify for demotion. Yet an administrator may configure a tier to have different promotion and demotion thresholds. Even though a prompt may qualify for promotion into a tier, the administrator may want a different percentage qualification for demotion. These unequal promotion/demotion thresholds could be especially useful when a tier can only accommodate a fixed number of prompts. That is, before a prompt can be promoted into a tier, some other prompt in that same tier must be demoted. The demotion threshold would determine the qualifications for demoting one prompt and substituting another prompt.
The set 36 of rules may also include time and/or usage rules. A prompt may be inserted, or deleted, based on time and/or usage. A prompt, for example, may be relevant and, thus, remain on a particular tier until a specific removal date. A prompt may also remain on a tier until its usage or number of responses falls below a threshold. Suppose a prompt says “Those needing re-ticketing due to Hurricane Katrina, press 1.” As this prompt's usage diminishes on the tier, the prompt may move down the menu of prompts. This same prompt, however, may not get demoted, based on other rules, until a date of expiration (such as after ten days).
An example helps explain vocal tags. As
The vocal tags 104 resemble labels. As a prompt is dynamically moved throughout the hierarchical tree structure 48, the prompt's associated vocal tag follows. No matter where the Interactive Voice Response (IVR) application rearranges a prompt, the vocal tag ensures the prompt's current position is correctly recited by the IVR system. Once a tier is rearranged, the vocal tags are concatenated, thus audibly presenting the prompts in their correct order. Should a prompt be compressed under a generic category (such as the generic prompt “Women's Services” 92), the IVR system, of course, concatenates the vocal tag associated with the generic category.
The menu 32 of prompts may also be dynamically changed using a Work Force Management system. The IVR system 20 may dynamically change the menu 32 of prompts based on a Work Force Management system. The IVR system 20 may receive an input or data from a Work Force Management system. When the IVR system 20 receives this data, the IVR system 20 may compress or expand the menu of prompts. The menu of prompts, for example, may be expanded or compressed to reflect staffing in a grouping. Suppose, for example, the Work Force Management system sends correlation data corresponding to any menu tag. The menu tag may be compressed or expanded to reflect the staffing group that is covering for them. Because of this input from the Work Force Management system, telephone numbers need not be forwarded between work groups. One work group, instead, may be attached to another work group, and the menu of prompts will cover the routing based on a parent tag.
The exemplary embodiments may be applied regardless of networking environment. The communications network 120 may be a cable network operating in the radio-frequency domain and/or the Internet Protocol (IP) domain. The communications network 120 may have POTS components and/or features. The communications network 120, however, may also include a distributed computing network, such as the Internet (sometimes alternatively known as the “World Wide Web”), an intranet, a local-area network (LAN), and/or a wide-area network (WAN). The communications network 120 may include coaxial cables, copper wires, fiber optic lines, and/or hybrid-coaxial lines. The communications network 120 may even include wireless portions utilizing any portion of the electromagnetic spectrum and any signaling standard (such as the I.E.E.E. 802 family of standards, GSM/CDMA/TDMA or any cellular standard, and/or the ISM band). The concepts described herein may be applied to any wireless/wireline communications network, regardless of physical componentry, physical configuration, or communications standard(s).
One example of the central processor 158 is a microprocessor. Advanced Micro Devices, Inc., for example, manufactures a full line of ATHLON™ microprocessors (ATHLON™ is a trademark of Advanced Micro Devices, Inc., One AMD Place, P.O. Box 3453, Sunnyvale, Calif. 94088-3453, 408.732.2400, 800.538.8450, www.amd.com). The Intel Corporation also manufactures a family of X86 and P86 microprocessors (Intel Corporation, 2200 Mission College Blvd., Santa Clara, Calif. 95052-8119, 408.765.8080, www.intel.com). Other manufacturers also offer microprocessors. Such other manufacturers include Motorola, Inc. (1303 East Algonquin Road, P.O. Box A3309 Schaumburg, Ill. 60196, www.Motorola.com), International Business Machines Corp. (New Orchard Road, Armonk, N.Y. 10504, (914) 499-1900, www.ibm.com), and Transmeta Corp. (3940 Freedom Circle, Santa Clara, Calif. 95054, www.transmeta.com). Those skilled in the art further understand that the program, processes, methods, and systems described herein are not limited to any particular manufacturer's central processor.
According to an exemplary embodiment, any of the WINDOWS® (WINDOWS® is a registered trademark of Microsoft Corporation, One Microsoft Way, Redmond Wash. 98052-6399, 425.882.8080, www.Microsoft.com) operating systems may be used. Other operating systems, however, are also suitable. Such other operating systems would include the UNIX® operating system (UNIX® is a registered trademark of the Open Source Group, www.opensource.org), the UNIX-based Linux operating system, WINDOWS NT®, and Mac® OS (Mac® is a registered trademark of Apple Computer, Inc., 1 Infinite Loop, Cupertino, Calif. 95014, 408.996.1010, www.apple.com). Those of ordinary skill in the art again understand that the program, processes, methods, and systems described herein are not limited to any particular operating system.
The system memory device (shown as memory subsystem 152, flash memory 154, or peripheral storage device 156) may also contain an application program. The application program cooperates with the operating system and with a video display unit (via the serial port 174 and/or the parallel port 176) to provide a Graphical User Interface (GUI). The Graphical User Interface typically includes a combination of signals communicated along the keyboard port 170 and the mouse port 172. The Graphical User Interface provides a convenient visual and/or audible interface with a subscriber of the computer system 150.
The IVR application (shown as reference numeral 22 in the FIGS.) may be physically embodied on or in a computer-readable medium. This computer-readable medium may include CD-ROM, DVD, tape, cassette, floppy disk, memory card, and large-capacity disk (such as IOMEGA®, ZIP®, JAZZ®, and other large-capacity memory products (IOMEGA®, ZIP®, and JAZZ® are registered trademarks of Iomega Corporation, 1821 W. Iomega Way, Roy, Utah 84067, 801.332.1000, www.iomega.com). This computer-readable medium, or media, could be distributed to end-subscribers, licensees, and assignees. These types of computer-readable media, and other types not mention here but considered within the scope of the exemplary embodiments, allow the web browser to be easily disseminated. A computer program product comprises the IVR application stored on the computer-readable medium. The IVR application comprises computer-readable instructions/code for dynamically changing an Interactive Voice Response (IVR) system.
The IVR application may be physically embodied on or in any addressable (e.g., HTTP, I.E.E.E. 802.11, Wireless Application Protocol (WAP)) wireless device capable of presenting an IP address. Examples could include a computer, a wireless personal digital assistant (PDA), an Internet Protocol mobile phone, or a wireless pager.
While the exemplary embodiments have been described with respect to various features, aspects, and embodiments, those skilled and unskilled in the art will recognize the exemplary embodiments are not so limited. Other variations, modifications, and alternative embodiments may be made without departing from the spirit and scope of the exemplary embodiments.
This application is a continuation application of U.S. application Ser. No. 12/829,453 filed Jul. 2, 2010 and now issued as U.S. Pat. No. 8,396,195, which is a continuation application of U.S. application Ser. No. 11/300,186 filed Dec. 14, 2005 and now issued as U.S. Pat. No. 7,773,731, with both incorporated herein by reference in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
4142067 | Williamson | Feb 1979 | A |
4788715 | Lee | Nov 1988 | A |
5309505 | Szlam et al. | May 1994 | A |
5455853 | Cebulka et al. | Oct 1995 | A |
5553121 | Martin et al. | Sep 1996 | A |
5864605 | Keshav | Jan 1999 | A |
5867572 | MacDonald et al. | Feb 1999 | A |
5872834 | Teitelbaum | Feb 1999 | A |
6016336 | Hanson | Jan 2000 | A |
6044382 | Martino | Mar 2000 | A |
6061433 | Polcyn et al. | May 2000 | A |
6064730 | Ginsberg | May 2000 | A |
6104790 | Narayanaswami | Aug 2000 | A |
6112172 | True et al. | Aug 2000 | A |
6122346 | Grossman | Sep 2000 | A |
6141328 | Nabkel et al. | Oct 2000 | A |
6240448 | Imielinski et al. | May 2001 | B1 |
6243684 | Stuart et al. | Jun 2001 | B1 |
6370238 | Sansone et al. | Apr 2002 | B1 |
6421672 | McAllister et al. | Jul 2002 | B1 |
6456619 | Sassin et al. | Sep 2002 | B1 |
6487277 | Beyda et al. | Nov 2002 | B2 |
6510434 | Anderson et al. | Jan 2003 | B1 |
6584181 | Aktas et al. | Jun 2003 | B1 |
6665644 | Kanevsky et al. | Dec 2003 | B1 |
6690776 | Raasch | Feb 2004 | B1 |
6714643 | Gargeya et al. | Mar 2004 | B1 |
6718017 | Price et al. | Apr 2004 | B1 |
6738473 | Burg | May 2004 | B1 |
6754333 | Flockhart et al. | Jun 2004 | B1 |
6775264 | Kurganov | Aug 2004 | B1 |
6798877 | Johnson | Sep 2004 | B2 |
6801620 | Smith | Oct 2004 | B2 |
6820260 | Flockhart | Nov 2004 | B1 |
6842767 | Partovi | Jan 2005 | B1 |
6853966 | Bushey | Feb 2005 | B2 |
6885733 | Pearson et al. | Apr 2005 | B2 |
6922466 | Peterson et al. | Jul 2005 | B1 |
6934684 | Alpdemir et al. | Aug 2005 | B2 |
6944592 | Pickering | Sep 2005 | B1 |
6965664 | McIntosh et al. | Nov 2005 | B1 |
7023837 | Srinivasan | Apr 2006 | B1 |
7043435 | Knott et al. | May 2006 | B2 |
7050990 | Chu et al. | May 2006 | B1 |
7065188 | Mei et al. | Jun 2006 | B1 |
7257217 | Lee | Aug 2007 | B1 |
7295668 | Singer | Nov 2007 | B2 |
7340040 | Saylor et al. | Mar 2008 | B1 |
7379537 | Bushey et al. | May 2008 | B2 |
7386103 | Chahal | Jun 2008 | B1 |
7436948 | Thenthiruperai | Oct 2008 | B1 |
7590224 | Gorin et al. | Sep 2009 | B1 |
7711095 | Erhart et al. | May 2010 | B2 |
7773731 | Malik et al. | Aug 2010 | B2 |
7787601 | Bittner | Aug 2010 | B2 |
7847813 | Erhart et al. | Dec 2010 | B2 |
7885958 | Sullivan et al. | Feb 2011 | B2 |
7949106 | Erhart et al. | May 2011 | B2 |
8050392 | Adams et al. | Nov 2011 | B2 |
20010024497 | Campbell | Sep 2001 | A1 |
20030005076 | Koch et al. | Jan 2003 | A1 |
20030035531 | Brown et al. | Feb 2003 | A1 |
20030039341 | Burg et al. | Feb 2003 | A1 |
20030041314 | Heeren et al. | Feb 2003 | A1 |
20030061029 | Shaket | Mar 2003 | A1 |
20030112952 | Brown | Jun 2003 | A1 |
20030191648 | Knott et al. | Oct 2003 | A1 |
20030195748 | Schalkwyk | Oct 2003 | A1 |
20030232640 | Walker et al. | Dec 2003 | A1 |
20040006476 | Chiu | Jan 2004 | A1 |
20040019646 | Zweben et al. | Jan 2004 | A1 |
20040042592 | Knott et al. | Mar 2004 | A1 |
20040042593 | Gulrajani et al. | Mar 2004 | A1 |
20040120479 | Creamer et al. | Jun 2004 | A1 |
20040153322 | Neuberger et al. | Aug 2004 | A1 |
20040204116 | Ben-Efraim et al. | Oct 2004 | A1 |
20040205731 | Junkermann | Oct 2004 | A1 |
20040215757 | Butler | Oct 2004 | A1 |
20040267613 | Chan et al. | Dec 2004 | A1 |
20050008141 | Kortum | Jan 2005 | A1 |
20050027536 | Matos | Feb 2005 | A1 |
20050060304 | Parikh | Mar 2005 | A1 |
20050069122 | Lin | Mar 2005 | A1 |
20050081152 | Commarford et al. | Apr 2005 | A1 |
20050129252 | Heintzman et al. | Jun 2005 | A1 |
20050135338 | Chiu et al. | Jun 2005 | A1 |
20050137875 | Kim et al. | Jun 2005 | A1 |
20050171779 | Joublin | Aug 2005 | A1 |
20050234891 | Walther et al. | Oct 2005 | A1 |
20050246174 | DeGolia | Nov 2005 | A1 |
20050256866 | Lu et al. | Nov 2005 | A1 |
20060165104 | Kaye | Jul 2006 | A1 |
20060190825 | Zaag | Aug 2006 | A1 |
20060251237 | Singer | Nov 2006 | A1 |
20060294192 | Mao et al. | Dec 2006 | A1 |
20070101394 | Fu et al. | May 2007 | A1 |
20070116195 | Thompson et al. | May 2007 | A1 |
20070185858 | Lu et al. | Aug 2007 | A1 |
20070204025 | Cox et al. | Aug 2007 | A1 |
Number | Date | Country |
---|---|---|
WO 2004040889 | May 2004 | WO |
Number | Date | Country | |
---|---|---|---|
20130336466 A1 | Dec 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12829453 | Jul 2010 | US |
Child | 13763628 | US | |
Parent | 11300186 | Dec 2005 | US |
Child | 12829453 | US |