The discussion below is merely provided for general background information and is not intended to be used as an aid in determining the scope of the claimed subject matter.
Use of automated outbound telephone calling systems is quite common. Besides being used for marketing purposes, such systems can also be used by doctor offices or clinics to contact patients to confirm or change appointments, by schools to inform students of schedule changes, by charities to obtain contributions, and governmental agencies to provide notification or other information, to name just a few other applications.
In many instances, it may be necessary or helpful to automatically ascertain whether the recipient of the telephone call is an actual person or an answering machine. Depending on whether an actual person has answered or an answering machine is in use, different actions may be taken by the outbound telephone calling system. However, this task, call analysis, is difficult and currently inaccurate.
Call analysis is commonly performed at the hardware switch level. Analysis is implemented by using a short interval when the recipient initially picks up the call and before the call is connected to the telephony application. During this interval, when the recipient begins to speak, the system will process the received audible signals as to, for example, energy content, strength or other signal parameters of the audible signals, in order to make a determination as to whether the recipient is an actual person or answering machine. It is important to understand that the telephony application does not even know the call has been picked up at this step, and therefore, has not delivered any initial prompts. Thus, on the other end of the line, although the recipient has answered the call and given a greeting such as “Hello”, the recipient only hears silence in return as the system is performing call analysis. In many instances, the recipient will then simply hang up.
The Summary and Abstract are provided to introduce a selection of concepts in a simplified form that are further described below in the Detailed Description. The Summary and Abstract are not intended to identify key features or essential features of the claimed subject matter, nor are they intended to be used as an aid in determining the scope of the claimed subject matter. In addition, the claimed subject matter is not limited to implementations that solve any or all disadvantages noted in the background.
An answering machine detection module is used to determine whether a call recipient is an actual person or an answering machine. The answering machine detection module includes a speech recognizer and a call analysis module. The speech recognizer receives an audible response of the call recipient to a call. The speech recognizer processes the audible response and provides an output indicative of recognized speech. The call analysis module processes the output of the speech recognizer to generate an output indicative of whether the call recipient is a person or an answering machine. In one embodiment, the call analysis module can include a classifier module that provides statistical analysis of the output from the speech recognizer to determine whether a call recipient is an actual person or an answering machine.
Also described is a technique for ensuring that the entire message from the caller is recorded by the answering machine. In particular, a speech recognizer is operated to detect barge in events by the answering machine, and where the message is replayed to the answering machine if a barge-in event is detected. Although this may cause the message to be replayed one or more times, it is particularly advantageous since any barge-in event signifies that the greeting of the answering machine has not finished, and thus the answering machine is not ready to record a message. By replaying the message after each barge-in event, upon playing the message after the last barge-in event it is assured the entire message will be recorded when the answering machine is ready to record the message.
In the embodiment illustrated, answering machine detection module 106 includes a speech recognizer 120 and a call analysis module 122.
At step 204, the output 126 from the speech recognizer 120 is provided as input to the call analysis module 122. The call analysis module 122 processes the output 126 of the speech recognizer 120 to generate an output 128 indicative of whether the call recipient is a person or an answering machine. The call analysis module 122 can include a classifier module 123 that provides statistical analysis of the content of the phrase(s) in output 126. The speech recognizer 120 and the classifier module 123 are well known modules and can be implemented using a variety of well known techniques. However, it should be noted that a language model 130 (e.g. N-gram, context-free-grammar, hybrid, etc.) used by the speech recognizer 120 and a classifier model 132 are typically both trained on only phrases or greetings used by both actual persons and answering machines when they answer a call. For instance, a person may answer a phone call with the greeting “Hello”, “How may I help you?”, “This is Steve” or maybe just their name. In contrast, an answering machine may have the greeting “You have reached my answering machine. I am unavailable at the moment. Please leave a message.” or simply “Please leave a message”. However, in content-based answering machine detection, it may be necessary to recognize important phrases such as “not available right now” or “leave a message”. Likewise, in the case of passing a phone screen system at the receiving location, it may be necessary to recognize phrases like “press 2”. For high recognition accuracy on phrases such as these, the language model 130 can be trained with the important phrases and where the model can be smoothed with an n-gram filler model to capture the words not covered in the important phrases. An example of an n-gram filler model is described by D. Yu, Y.-C. Ju, Y. Wang and A. Acero in “N-Gram Based Filler Model for Robust Grammar Authoring,” published In Proceedings of the International Conference on Acoustics, Speech, and Signal Processing, May 2006. Using a sufficient number of examples (either generic examples or application specific examples) both the language model 130 and the classifier model 132 can be suitably trained.
With respect to the call analysis module 122 and step 204, non-word features 136 can also be used for analysis in addition or in the alternative to the output 126 of the speech recognizer 120. Examples of non-word features 136 include but are not limited to whether the call recipient 102 “barged-in” (i.e., interrupted a prompt being played when the application 104 is executing a dialog), the duration of the audible response made by the call recipient 102 in answering the call, and whether or not the speech recognizer 120 was able to recognize the audible response 124 as a valid phrase. In
At this point, it should also be noted that there is no requirement that the speech recognizer 120 be able to recognize the complete audible response 124, but rather, due to the noisy environment at the call recipient 102, noise in a recorded greeting or noise from the telephone system, and the nature of the response, only one or more portions of the audible response 124 may be recognizable, and thus, used for ascertaining whether the call recipient 102 is an actual person or answering machine.
If on other hand significant silence is not present after the call has been picked up at step 302, or step 302 is not present, the duration of the audible response can be used to determine whether or not the call recipient is an actual person. Steps 306 and 308 illustrate processing the non-word feature comprising the duration of the audible response. At step 306, if the duration of the audible response is very short (for example, approximately less than 1 second), it is more than likely an actual person who has answered the call. In contrast, if the duration of the audible response is very long (for example, approximately four or more seconds) as illustrated by step 308, the call recipient is probably an answering machine. It should be noted the order in which steps 306 and 308 are illustrated is not necessary in that these steps can be reversed. Likewise the time periods specified can be adjusted.
If a determination of whether the call recipient is an actual person or answering machine has not been made prior to step 308, process flow continues to step 310 whereat the duration of the audible response can again be used. In particular, at step 310 the duration of the audible response is measured to determine if it is relatively short, for example, two to three seconds. The result of this step is combined with information related to the context of the audible response as recognized by the speech recognizer 120 such as obtained from the classifier module 123. In other words, the classifier module 123 analyzes the output 126 from the speech recognizer 120 to determine if one or more phrases are statistically consistent with phrases used by an actual person or phrases used by an answering machine. In
Please note that the statistical classifier described above is just an illustrative example. Call analysis module 122 can use many other classifiers, such as maximum entropy classifiers. Furthermore, call analysis module 122 can also use support vector machines, components utilizing decision trees, and artificial neural networks to achieve comparable accuracy.
In the example of
In some applications, it may be necessary to play a message to the call recipient, for instance, if it has been determined that the call recipient is an answering machine. Although answering machines provide a tone or silence signifying that the greeting has ended and that a message should now be left, recognition of this tone is difficult. In many cases since the tone or silence may not be recognized accurately, at least part of the message may be played during the greeting, thus, the beginning portion of the message may not be recorded.
An optional step 206 illustrated in
In addition to the examples herein provided, other well known computing systems, environments, and/or configurations may be suitable for use with concepts herein described. Such systems include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The concepts herein described may be embodied in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Those skilled in the art can implement the description and/or figures herein as computer-executable instructions, which can be embodied on any form of computer readable media discussed below.
The concepts herein described may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both locale and remote computer storage media including memory storage devices.
With reference to
Computer 410 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 410 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media. Computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by computer 400.
The system memory 430 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 431 and random access memory (RAM) 432. A basic input/output system 433 (BIOS), containing the basic routines that help to transfer information between elements within computer 410, such as during start-up, is typically stored in ROM 431. RAM 432 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 420. By way of example, and not limitation,
The computer 410 may also include other removable/non-removable volatile/nonvolatile computer storage media. By way of example only,
The drives and their associated computer storage media discussed above and illustrated in
A user may enter commands and information into the computer 410 through input devices such as a keyboard 462, a microphone 463, and a pointing device 461, such as a mouse, trackball or touch pad. These and other input devices are often connected to the processing unit 420 through a user input interface 460 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port or a universal serial bus (USB). A monitor 491 or other type of display device is also connected to the system bus 421 via an interface, such as a video interface 490.
The computer 410 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 480. The remote computer 480 may be a personal computer, a hand-held device, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 410. The logical connections depicted in
When used in a LAN networking environment, the computer 410 is connected to the LAN 471 through a network interface or adapter 470. When used in a WAN networking environment, the computer 410 typically includes a modem 472 or other means for establishing communications over the WAN 473, such as the Internet. The modem 472, which may be internal or external, may be connected to the system bus 421 via the user-input interface 460, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 410, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation,
It should be noted that the concepts herein described can be carried out on a computer system such as that described with respect to
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not limited to the specific features or acts described above as has been held by the courts. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
Number | Name | Date | Kind |
---|---|---|---|
4941168 | Kelly, Jr. | Jul 1990 | A |
5371787 | Hamilton | Dec 1994 | A |
5581602 | Szlam et al. | Dec 1996 | A |
5644624 | Caldwell | Jul 1997 | A |
5724420 | Torgrim | Mar 1998 | A |
5828731 | Szlam et al. | Oct 1998 | A |
6161087 | Wightman et al. | Dec 2000 | A |
6233319 | Cox et al. | May 2001 | B1 |
6324262 | Tuttle | Nov 2001 | B1 |
6496799 | Pickering | Dec 2002 | B1 |
6574601 | Brown et al. | Jun 2003 | B1 |
6850602 | Chou | Feb 2005 | B1 |
7162421 | Zeppenfeld et al. | Jan 2007 | B1 |
7567659 | Kumagai | Jul 2009 | B2 |
20020085686 | Cullis | Jul 2002 | A1 |
20030083874 | Crane et al. | May 2003 | A1 |
20030086541 | Brown | May 2003 | A1 |
20050013418 | Chang et al. | Jan 2005 | A1 |
20050027527 | Junkawitsch et al. | Feb 2005 | A1 |
20050119886 | Walker | Jun 2005 | A1 |
20050256711 | Lahti | Nov 2005 | A1 |
20050276390 | Sikora et al. | Dec 2005 | A1 |
20060056600 | Merrow et al. | Mar 2006 | A1 |
20060177021 | Delaney et al. | Aug 2006 | A1 |
20060235694 | Cross et al. | Oct 2006 | A1 |
20080154595 | Nelken | Jun 2008 | A1 |
Number | Date | Country |
---|---|---|
10 2006 0077505 | Jul 2006 | KR |
Number | Date | Country | |
---|---|---|---|
20080015846 A1 | Jan 2008 | US |