The present invention relates to noise detection systems and, more particularly, to systems that detect background noise during a call.
Speech analysts frequently encounter upfront background noise that causes utterances to be grammatically incorrect. For example, if a customer calls an interactive voice response (IVR) application, background noise at the customer's location may cause a delay in processing of the call by the IVR application. Thus, an application that reduces or eliminates speech recognition errors due to background noise may be beneficial.
Certain embodiments of the present invention may provide solutions to the problems and needs in the art that have not yet been fully identified, appreciated, or solved by current IVR applications. For example, embodiments of the present invention pertain to reducing or eliminating speech recognition errors when background noise at the user's location occurs.
In one embodiment, an apparatus is provided. The apparatus includes memory including a set of instructions and at least one processor. The set of instructions, when executed by the at least one processor, are configured to cause the apparatus to detect background noise at a location of a caller and prompt the caller to use dual-tone multi-frequency (DTMF).
In another embodiment, a computer-implemented method is provided. The computer-implemented method includes detecting background noise at a location of a caller and prompting the caller to use DTMF.
In yet another embodiment, a computer program is provided. The computer program is embodied on a non-transitory computer-readable medium. The computer program is configured to cause at least one processor to detect background noise at a location of a caller and prompt the caller to use DTMF
In order that the advantages of certain embodiments of the invention will be readily understood, a more particular description of the invention briefly described above will be rendered by reference to specific embodiments that are illustrated in the appended drawings. While it should be understood that these drawings depict only typical embodiments of the invention and are not therefore to be considered to be limiting of its scope, the invention will be described and explained with additional specificity and detail through the use of the accompanying drawings, in which:
Embodiments of the present invention pertain to reducing or eliminating speech recognition errors when background noise at the caller's location is detected. For example, when background noise at a location of the caller is detected, the caller may be prompted to use dual-tone multi-frequency (DTMF).
The computer readable medium may be any available media that can be accessed by at least one processor 110. The computer readable medium may include both volatile and nonvolatile medium, removable and non-removable media, and communication media. The communication media may include computer readable instructions, data structures, program modules, or other data and may include any information delivery media.
According to this embodiment, memory 120 stores software modules that provide functionality when executed by at least one processor 110. The modules include an operating system 125 and a noise detection module 130, as well as other functional modules 135. Operating system 125 may provide operating system functionality for computing system 100. Noise detection module 130 may detect background noise at any time during the call. Because computing system 100 may be part of a larger system, computing system 100 may include one or more additional functional modules 135 to include the additional functionality.
One skilled in the art will appreciate that a “system” could be embodied as a personal computer, a server, a console, a personal digital assistant (PDA), a cell phone, a tablet computing device, or any other suitable computing device, or combination of devices. Presenting the above-described functions as being performed by a “system” is not intended to limit the scope of the present invention in any way, but is intended to provide one example of many embodiments of the present invention. Indeed, methods, systems and apparatuses disclosed herein may be implemented in localized and distributed forms consistent with computing technology.
It should be noted that some of the system features described in this specification have been presented as modules, in order to more particularly emphasize their implementation independence. For example, a module may be implemented as a hardware circuit comprising custom very large scale integration (VLSI) circuits or gate arrays, off-the-shelf semiconductors such as logic chips, transistors, or other discrete components. A module may also be implemented in programmable hardware devices such as field programmable gate arrays, programmable array logic, programmable logic devices, graphics processing units, or the like.
A module may also be at least partially implemented in software for execution by various types of processors. An identified unit of executable code may, for instance, comprise one or more physical or logical blocks of computer instructions that may, for instance, be organized as an object, procedure, or function. Nevertheless, the executables of an identified module need not be physically located together, but may comprise disparate instructions stored in different locations which, when joined logically together, comprise the module and achieve the stated purpose for the module. Further, modules may be stored on a computer-readable medium, which may be, for instance, a hard disk drive, flash device, random access memory (RAM), tape, or any other such medium used to store data.
Indeed, a module of executable code could be a single instruction, or many instructions, and may even be distributed over several different code segments, among different programs, and across several memory devices. Similarly, operational data may be identified and illustrated herein within modules, and may be embodied in any suitable form and organized within any suitable type of data structure. The operational data may be collected as a single data set, or may be distributed over different locations including over different storage devices, and may exist, at least partially, merely as electronic signals on a system or network.
The process illustrated in
At 315, the computing system plays a welcome message to the user. In certain embodiments, the welcome message is played to the caller when the caller connects to the IVR system. At 320, the computing system stops listening to the background noise at the location of the caller, and, at 325, determines whether the background noise is excessive. For example, the computing system may detect whether the location of the caller contains a sufficient degree of background noise such that successful speech recognition is impossible. This may be measured, for example, by a signal strength of the background noise, a number of decibels of the background noise, or any other noise analysis technique that would be understood by one of ordinary skill in the art.
If the computing system detects excessive background noise, then at 340 the caller is prompted to use DTMF to complete the call flow to connect, for example, to the agent. If the computing system does not detect excessive background noise at 325, then at 330, the caller is prompted using the speech recognition.
At 335, the computing system detects whether speech recognition error has occurred. If speech recognition error has occurred, then at 340, the caller is prompted to use DTMF to complete the call flow to connect, for example, to the agent. Otherwise, the call flow continues at 345 to connect the user to, for example, the agent.
It should be appreciated that in certain embodiments, the background noise detection is activated throughout the call to ensure that the caller is connected to the agent promptly. The embodiments discussed herein may reduce caller frustration and shorten the call length. Furthermore, by detecting noisy environments, a greater insight is provided into how well speech recognition works in an ideal environment and how often callers are not calling from an ideal environment.
The processes shown in
The computer program can be implemented in hardware, software, or a hybrid implementation. The computer program can be composed of modules that are in operative communication with one another, and which are designed to pass information or instructions to display. The computer program can be configured to operate on a general purpose computer, or an application specific integrated circuit (“ASIC”).
It will be readily understood that the components of the invention, as generally described and illustrated in the figures herein, may be arranged and designed in a wide variety of different configurations. Thus, the detailed description of the embodiments is not intended to limit the scope of the invention as claimed, but is merely representative of selected embodiments of the invention.
The features, structures, or characteristics of the invention described throughout this specification may be combined in any suitable manner in one or more embodiments. For example, the usage of “certain embodiments,” “some embodiments,” or other similar language, throughout this specification refers to the fact that a particular feature, structure, or characteristic described in connection with an embodiment may be included in at least one embodiment of the invention. Thus, appearances of the phrases “in certain embodiments,” “in some embodiments,” “in other embodiments,” or other similar language, throughout this specification do not necessarily all refer to the same embodiment or group of embodiments, and the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
One having ordinary skill in the art will readily understand that the invention as discussed above may be practiced with steps in a different order, and/or with hardware elements in configurations that are different than those which are disclosed. Therefore, although the invention has been described based upon these preferred embodiments, it would be apparent to those of skill in the art that certain modifications, variations, and alternative constructions would be apparent, while remaining within the spirit and scope of the invention. In order to determine the metes and bounds of the invention, therefore, reference should be made to the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
4558459 | Noso | Dec 1985 | A |
4696041 | Sakata | Sep 1987 | A |
4918732 | Gerson | Apr 1990 | A |
5008941 | Sejnoha | Apr 1991 | A |
5983186 | Miyazawa | Nov 1999 | A |
6044343 | Cong | Mar 2000 | A |
6243454 | Eslambolchi | Jun 2001 | B1 |
6453041 | Eryilmaz | Sep 2002 | B1 |
6584180 | Nemoto | Jun 2003 | B2 |
6631348 | Wymore | Oct 2003 | B1 |
7167544 | Bauer | Jan 2007 | B1 |
7403766 | Hodge | Jul 2008 | B2 |
7822498 | Charoenruengkit | Oct 2010 | B2 |
9288594 | Polansky | Mar 2016 | B1 |
9495960 | Moore | Nov 2016 | B1 |
9516165 | Moore | Dec 2016 | B1 |
9640196 | Moore | May 2017 | B1 |
9680992 | Moore | Jun 2017 | B1 |
9721565 | Perlmutter | Aug 2017 | B2 |
9812123 | Sanders | Nov 2017 | B1 |
20030027602 | Han et al. | Feb 2003 | A1 |
20030158732 | Pi | Aug 2003 | A1 |
20030167171 | Calderone | Sep 2003 | A1 |
20050171664 | Konig | Aug 2005 | A1 |
20060009974 | Junqua | Jan 2006 | A1 |
20060009980 | Burke | Jan 2006 | A1 |
20060126803 | Patel | Jun 2006 | A1 |
20060200345 | Kooiman | Sep 2006 | A1 |
20060200348 | Knott | Sep 2006 | A1 |
20060265219 | Honda | Nov 2006 | A1 |
20070047719 | Dhawan | Mar 2007 | A1 |
20070050190 | Washio | Mar 2007 | A1 |
20070237271 | Pessoa | Oct 2007 | A1 |
20070276662 | Akamine | Nov 2007 | A1 |
20080077403 | Hayakawa | Mar 2008 | A1 |
20080101556 | Kim | May 2008 | A1 |
20080118042 | Hogg | May 2008 | A1 |
20080152094 | Perlmutter | Jun 2008 | A1 |
20080167868 | Kanevsky | Jul 2008 | A1 |
20090055175 | Terrell, II | Feb 2009 | A1 |
20090076813 | Jung | Mar 2009 | A1 |
20090187402 | Scholl | Jul 2009 | A1 |
20090198492 | Rempel | Aug 2009 | A1 |
20090222265 | Iwamiya | Sep 2009 | A1 |
20100049525 | Paden | Feb 2010 | A1 |
20100121636 | Burke | May 2010 | A1 |
20100153104 | Yu | Jun 2010 | A1 |
20100180202 | Del Valle Lopez | Jul 2010 | A1 |
20100183126 | Chambers | Jul 2010 | A1 |
20110111805 | Paquier | May 2011 | A1 |
20110184724 | Ranjan | Jul 2011 | A1 |
20120034904 | LeBeau | Feb 2012 | A1 |
20120035924 | Jitkoff | Feb 2012 | A1 |
20130185065 | Tzirkel-Hancock | Jul 2013 | A1 |
20130185066 | Tzirkel-Hancock | Jul 2013 | A1 |
20130185078 | Tzirkel-Hancock | Jul 2013 | A1 |
20130191117 | Atti | Jul 2013 | A1 |
20130246071 | Lee | Sep 2013 | A1 |
20130272511 | Bouzid | Oct 2013 | A1 |
20140067388 | Manikandan | Mar 2014 | A1 |
20140142951 | Crawley | May 2014 | A1 |
20140270249 | Jasiuk | Sep 2014 | A1 |
20140278389 | Zurek | Sep 2014 | A1 |
20140316778 | Venkatesha | Oct 2014 | A1 |
20150032451 | Gunn | Jan 2015 | A1 |
20150039311 | Clark | Feb 2015 | A1 |
20150170653 | Berndt | Jun 2015 | A1 |
20150185964 | Stout | Jul 2015 | A1 |
20160267924 | Terao | Sep 2016 | A1 |
20160275968 | Terao | Sep 2016 | A1 |
20170031420 | Wong | Feb 2017 | A1 |
20170053666 | Konjeti | Feb 2017 | A1 |
20170194007 | Gunn | Jul 2017 | A1 |
20170372721 | Jasiuk | Dec 2017 | A1 |
Number | Date | Country | |
---|---|---|---|
Parent | 15621095 | Jun 2017 | US |
Child | 16261503 | US | |
Parent | 15369342 | Dec 2016 | US |
Child | 15621095 | US | |
Parent | 14226472 | Mar 2014 | US |
Child | 15369342 | US |