The present invention relates to voice driven interfaces, and more particularly, relates to methods for improving speech recognition reliability when a user performs a voice-based search.
With the increasing popularity of wireless devices, many web site operators and other content providers are deploying voice driven interfaces (“voice interfaces”) for allowing users to browse their content. The voice interfaces commonly include “grammars” that define the valid utterances (words, phrases, etc.) that can occur at a given state within a browsing session. The grammars are fed to a voice recognition system and are used to interpret the user's voice entry. In web-based systems, the grammars are typically embedded as text files within voiceXML versions of web pages.
One problem with voice recognition systems is that the reliability of the recognition process tends to be inversely proportional to the size of the grammar. This poses a significant problem to content providers wishing to place large databases of products or other items online in a voice-searchable form. Specifically, if all or even a significant portion of the terms in the searchable domain are incorporated into the grammar, the grammar may become too large to provide reliable voice recognition. If, on the other hand, many terms are omitted from the grammar, the system will be incapable of recognizing many valid queries. The present invention seeks to address this problem.
The present invention provides a voice interface and methods for improving voice recognition reliability when a user searches a large database or domain of items. The items may, for example, be product descriptions within a merchant's catalog, web pages indexed by a web crawler, or any other type of database item commonly searched for by users. The invention is particularly well suited to conducting searches in which the search query contains the name of a person or other entity (e.g., the name of an author, artist, actor, director, company, lecturer or musical group associated with a particular item), but may also be used in a variety of other contexts.
In accordance with one aspect of the invention, the user is initially prompted to supply a set or string of characters from the query, such as one or more letters of a query term. The type of the query term may be dependent upon the context of the search. For example, if the user is conducting an author search for books, the user may be prompted to enter the first few letters of the author's first or last name. The characters may, for example, be entered by voice, a telephone keypad, a fully functional keyboard, or a combination thereof. The user is also prompted to supply the complete query by voice.
To process the voice query, a grammar is dynamically generated (or possibly read from memory) according to the set of characters supplied by the user. This grammar is preferably derived from the subset of database items corresponding to the entered characters. For example, if the user enters the first three letters of an author's name, the grammar may be derived from all items having authors whose names start with these characters. Because the grammar is derived from the matching items, as opposed to all items within the particular domain being searched, the grammar is smaller in size and produces a significantly more reliable voice recognition result. In one embodiment, a grammar is generated each time a user searches for an item. In another embodiment, once a grammar is generated, the grammar is saved in memory for some defined length of time for use with other search requests.
Another aspect of the invention involves a method that may be used to receive an alphabetic character input from a user of a device having a standard telephone keypad. To obtain the character input, the user is prompted to enter the letters on a telephone keypad with one key depression per letter. For example, to enter the character string “king,” the user would select the telephone digits 5464. The user is also prompted to say the same letters, and these letter utterances are interpreted by the voice recognition system such that the only valid interpretations for a given utterance are the (three or four) letters associated with the corresponding key. For example, for the telephone digit “2,” the voice recognition system would only recognize the letters A, B and C as valid utterances. This method of character entry significantly reduces misinterpretations by the voice recognition system of characters having similar sounds.
The present invention also provides a method for improving voice recognition accuracy when a user adds terms to a previously-submitted query to refine a search (e.g., when the search produces a large number of hits). The method involves generating the grammar using the items returned by the initial search (e.g., by extracting text from selected fields), and then using this grammar to interpret utterances as the user adds one or more query terms.
These and other features will now be described with reference to the drawings summarized below. These drawings and the associated description are provided to illustrate preferred embodiments of the invention, and not to limit the scope of the invention.
The present invention provides a system and associated methods for reducing the grammar space needed when searching a large database or domain using voice recognition processes. The invention may also be used to reduce the need for keyboard entry of queries.
For purposes of illustrating one particular application for the invention, the invention will be described primarily in the context of a system for allowing users to search a catalog of creative works represented within a database (e.g., book, music, and/or video titles). It will be recognized, however, that the invention may also be used for conducting searches for other types of items, such as web sites and pages indexed by a crawler, downloadable music files, companies, chat rooms, court opinions, telephone numbers, and other users.
It may be assumed throughout the description that each item (work) is represented in the database as a record containing multiple fields, each of which contains a particular type of data (e.g., author, title, subject, description, etc.). The term “item” will be used generally to refer both to the items themselves and to the database records for such items. The term “author” will be used to refer generally to a person or entity who contributed to a work, such as a writer of a book, an artist or group associated with a musical work, or an actor or producer of a movie.
As depicted by
As further illustrated by
The purpose of obtaining the set of characters is to narrow the scope of the search to a particular subset of items. This in turn allows a significantly smaller and more tailored grammar to be used to process the full voice query. As described below, the grammar is preferably generated from the query terms that may be used in the full query to describe the items falling within the subset. Although the user is preferably prompted to enter the first one or more characters of a query term, the user could alternatively be prompted, for example, to enter any consecutive string of characters of a query term, or to enter the first character of each term in the query (e.g., the first and last initials of an author).
As further illustrated in
Although the grammar is preferably generated directly from the matching items, other types of criteria may optionally be incorporated into the grammar generation process. For example, if a set of preferences for the user indicates that he does not like a particular type of item (e.g., works from a particular author or works exceeding a particular price threshold), these items may be filtered from the subset before generating the grammar. Further, voice commands such as “new search” or “go back” may be added to the grammar.
Referring again to the character entry task (22) in
As further shown in
The AVR system interprets the voice query using the dynamically generated grammar. Typically, this task involves converting the utterances into corresponding character strings, and providing these strings to a conventional query server. Because the grammar is derived from a relatively small subset of items and is thus relatively small in size, the AVR process is significantly more accurate.
As depicted by the dashed line path in
As depicted in
As shown in
Page requests generated by the AVR system 50 are normally only for voiceXML pages (i.e., correspond only to the URLs at which voiceXML pages are located). These voiceXML pages define the system's voice interface. As is conventional, the voiceXML pages specify speech or other audio to be played to the user by the AVR system during a browsing session. The voiceXML pages also contain grammars (in the form of text files) for specifying the valid utterances that can occur at a given state.
As further shown in
Initially, a voiceXML page is sent to the AVR system prompting the user (by voice) to type in, and then say, the first N letters of an author's name (80). For example, if the user is searching for music titles by the artist Sting, the user might initially type “784” on the telephone keypad and then say the letters “STI.” The AVR system uses each keypad entry to narrow the set of valid utterances associated with each spoken letter. For example, for the telephone digit “2,” the AVR system would only recognize the letters A, B and C as valid utterances, rather than all twenty six letters of the alphabet. This method of character entry significantly reduces misinterpretations by the AVR system of characters having similar sounds.
The character entry task can be varied, for example, by having the user utter each character immediately after the corresponding telephone key has been depressed, or by having the user utter all of the characters prior to their entry on the keypad. In addition, any of a variety of alternative character entry methods could be used, including methods that use only voice or only the telephone keypad. For example, a method could be used in which the user depresses each telephone key a number of times equal to the position of the desired letter, as is common for programming cellular phones. Upon receiving the user's character string from the AVR system, the query server 60 checks the grammar cache 70 (if caching is used) to determine whether a grammar corresponding to the user's search context and character string exists (82).
If no such grammar exists, or if no caching is used, the query server 60 performs an initial search of the appropriate domain (e.g., music) of the product database 62 for all author names starting with the N characters (84). The query server then invokes the dynamic grammar generator 64 to build a grammar from these author names. As mentioned above, in embodiments in which the search engine permits the user to utter other types of terms (such as title terms) along with the author terms, the grammar generator may also incorporate these types of terms into the grammar. For example, the grammar could be derived from the author names and titles of the works located by the initial search. Once generated, the grammar may be stored in the cache 70 together with such information as the character string and search context to which it corresponds and the date and time of creation.
Once the grammar has been generated (86) or read from the cache (88), the grammar is incorporated into a voiceXML page which is provided to the AVR system (90). This page prompts the user by voice to utter the full query. The AVR system 50 interprets this voice query using the supplied grammar, and returns to the web/query server an HTTP request containing the full query in textual form. The query server 60 then executes the search (optionally limiting search's scope to the items located during the initial search), and generates and returns a voiceXML page containing the search results (92).
To increase voice recognition reliability as these additional terms are uttered, the query server 60 generates a dynamic grammar from the initial set of search results (96). The grammar generation methods described above may be used for this purpose. This dynamic grammar is then provided to the AVR system 50 (e.g., within a voiceXML page) and is used to process the voice entry (98). Grammars for the most frequently submitted search queries may be cached in the same manner as described above, except that the grammars would be stored and retrieved using the original set of query terms.
Although this invention has been described in terms of certain preferred embodiments, other embodiments that are apparent to those of ordinary skill in the art are also within the scope of this invention. Accordingly, the scope of the present invention is defined only by reference to the appended claims.
Number | Name | Date | Kind |
---|---|---|---|
5337347 | Halstead-Nussloch et al. | Aug 1994 | A |
5452397 | Ittycheriah et al. | Sep 1995 | A |
5758322 | Rongley | May 1998 | A |
5774628 | Hemphill | Jun 1998 | A |
5774859 | Houser et al. | Jun 1998 | A |
5832428 | Chow et al. | Nov 1998 | A |
5917889 | Brotman et al. | Jun 1999 | A |
5917944 | Wakisaka et al. | Jun 1999 | A |
5995928 | Nguyen et al. | Nov 1999 | A |
6014624 | Raman | Jan 2000 | A |
6061654 | Brown et al. | May 2000 | A |
6073100 | Goodridge, Jr. | Jun 2000 | A |
6137863 | Brown et al. | Oct 2000 | A |
6144938 | Surace et al. | Nov 2000 | A |
6148105 | Wakisaka et al. | Nov 2000 | A |
6161090 | Kanevsky et al. | Dec 2000 | A |
6163768 | Sherwood et al. | Dec 2000 | A |
6178404 | Hambleton et al. | Jan 2001 | B1 |
6188985 | Thrift et al. | Feb 2001 | B1 |
6223059 | Haestrup | Apr 2001 | B1 |
6282512 | Hemphill | Aug 2001 | B1 |
6307549 | King et al. | Oct 2001 | B1 |
6308157 | Vanbuskirk et al. | Oct 2001 | B1 |
6311182 | Colbath et al. | Oct 2001 | B1 |
6324513 | Nagai et al. | Nov 2001 | B1 |
6334103 | Surace et al. | Dec 2001 | B1 |
6377927 | Loghmani et al. | Apr 2002 | B1 |
6392640 | Will | May 2002 | B1 |
6434524 | Weber | Aug 2002 | B1 |
6456974 | Baker et al. | Sep 2002 | B1 |
6694295 | Lindholm et al. | Feb 2004 | B2 |
6778970 | Au | Aug 2004 | B2 |
6839669 | Gould et al. | Jan 2005 | B1 |
6850252 | Hoffberg | Feb 2005 | B1 |
6853962 | Appleby | Feb 2005 | B2 |
6856986 | Rossides | Feb 2005 | B1 |
6859776 | Cohen et al. | Feb 2005 | B1 |
6865528 | Huang et al. | Mar 2005 | B1 |
6871174 | Dolan et al. | Mar 2005 | B1 |
6941273 | Loghmani et al. | Sep 2005 | B1 |
6952666 | Weise | Oct 2005 | B1 |
6957184 | Schmid et al. | Oct 2005 | B2 |
6963633 | Diede et al. | Nov 2005 | B1 |
6981217 | Knauft et al. | Dec 2005 | B1 |
6999563 | Thorpe et al. | Feb 2006 | B1 |
7027987 | Franz et al. | Apr 2006 | B1 |
7050977 | Bennett | May 2006 | B1 |
7110948 | Mekuria | Sep 2006 | B1 |
7136854 | Smith et al. | Nov 2006 | B2 |
20010034603 | Thrift et al. | Oct 2001 | A1 |
Number | Date | Country |
---|---|---|
WO 0014729 | Mar 2000 | WO |