EP1581927A2 - Spracherkennungssystem und -verfahren - Google Patents

Spracherkennungssystem und -verfahren

Info

Publication number
EP1581927A2
EP1581927A2 EP03767358A EP03767358A EP1581927A2 EP 1581927 A2 EP1581927 A2 EP 1581927A2 EP 03767358 A EP03767358 A EP 03767358A EP 03767358 A EP03767358 A EP 03767358A EP 1581927 A2 EP1581927 A2 EP 1581927A2
Authority
EP
European Patent Office
Prior art keywords
utterance
grammar
user
word
asr
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Withdrawn
Application number
EP03767358A
Other languages
English (en)
French (fr)
Inventor
John Taschereau
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
668158 Bc Ltd
Original Assignee
668158 Bc Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CA002419526A external-priority patent/CA2419526A1/en
Application filed by 668158 Bc Ltd filed Critical 668158 Bc Ltd
Publication of EP1581927A2 publication Critical patent/EP1581927A2/de
Withdrawn legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G10MUSICAL INSTRUMENTS; ACOUSTICS
    • G10LSPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
    • G10L15/00Speech recognition
    • G10L15/08Speech classification or search
    • G10L15/18Speech classification or search using natural language modelling
    • G10L15/183Speech classification or search using natural language modelling using context dependencies, e.g. language models
    • G10L15/19Grammatical context, e.g. disambiguation of the recognition hypotheses based on word sequence rules

Definitions

  • This invention relates to systems and methods of voice recognition, and more particularly voice recognition used in the context of directory assistance.
  • ASR Automatic Speech Recognition
  • ASR systems are designed and used to accept utterances, and qualify possible matches within the defined gr-immar as rapidly as possible to return one or more of the best qualified matches.
  • a significant limitation with ASR systems in the prior art is that as a grammar's size increases, its accuracy diminishes. This occurs because as the number of possible phonetic matches for an utterance increase, the probability for error also increases as the differences between the various possible matches is smaller, (i.e. each possible match become less distinct).
  • ASR systems require to perform a matching process.
  • the time required to return a match to an utterance increases. Additional processing time is required to evaluate the increased number of possibilities.
  • grammars are generally defined in a manner which matches an expected word order (for example if the grarnrnar contains "St. Christopher's Hospital", it will be defined to hear the words “Saint” and "Christopher” in that order). If a given utterance's word order does not significantly match that described in the grarnrnar, a match may not be made or an incorrect match may be generated, hi practice, an utterance of a word order which differs from that defined in a grammar can produce very poor results, especially in cases where other possible matches using the same or similar words exists.
  • a further limitation of large grammars is that they are commonly "pre-compiled". Pre-compiling helps alleviate the run-time size limitation previously noted, however, pre-compiled grammars by nature cannot be dynamically generated in real-time. As a grammar articulates an end result, it is very difficult to implement a large grammar in pre-compiled form which is able to reference dynamic data.
  • a goal of ASR systems is to minimize the recognition speed required to respond to the user's request.
  • Recognition speed in an ASR system varies depending on several factors, including: (1) grammar size, (2) grammar complexity, (3) desired accuracy, (4) available processor power and (5) quality and character of the input acoustic utterance.
  • Prior art ASR systems have "pruning" abilities to taper and adjust the grammar so that it requires 6-8 seconds to recognize a 2-3 word utterance. This duration can (and frequently does) go as high as 12 to 18 seconds on a fast computer.
  • ASR is applied as a "one shot” process whereby the ASR system is applied “live” while the person is speaking and expected to return a result within a “reasonable” period of time.
  • a reasonable time is that regarded as suitable for conversational purposes, i.e. about 2-3 seconds maximum, and ideally, about 1-2. If this is attempted with a 10,000 word grammar, the ASR process will likely take too much time, even for a grammar of only about 10,000 words. For large cities, the grammars can exceed 250,000 words, which require magnitudes of time where processes will commonly timeout and/or are well beyond what can be expected as reasonable.
  • Some directory assistance systems integrate the "store and forward" system with an ASR system.
  • the path chosen (by way of the questions asked) varies depending on the answers to the questions. Therefore, when using such a system, the user will not receive a consistent range of questions, depending on his or her answers.
  • the user answers a question or questions, and the system determines that the ASR system can manage the response, the user is then placed on a voice recognition track and asked the questions appropriate for that track (which are generally asked in an attempt to reduce the relevant grammar to a manageable level).
  • These questions are quite different from those asked in the "store and forward" track, so a repeat user can usually quickly determine which track they have been placed on.
  • a further limitation with ASR systems is that they often have difficulty understanding the utterances provided by the user.
  • ASR systems are set to "hear" an utterance at a specified volume, which may not be appropriate for the situation at hand. For example, a user with a low voice may not be understood properly.
  • background noise such as traffic, can cause difficulties in "hearing" the user's utterances.
  • the method and processes described herein implement technologies for ASR systems that are especially useful in applications where the possible utterances represent a large or very large collection of possibilities (i.e. a large grammar is required).
  • the method and processes address functional and accuracy problems associated with using ASR systems in general, and in particular, cases where large ASR "grammars" are required.
  • the invention allows for the creation of proportionally much smaller ASR grammars than conventionally required for the same task and yet which yield substantially increased output accuracy.
  • Figure 1 is a typical list of business names and related information representing a small sample of a larger grammar
  • Figure 2 is a list of "items"
  • Figure 3 is a list of transformations carried out on the items
  • Figure 4 is a word map based on the transformed listings
  • Figure 5 is a word map statistical analysis
  • Figures 6 through 8 are samples of word map to item illustrations
  • Figure 9 is a flow chart showing the process of a "store and forward" system
  • Figure 10 is a flow chart showing a prior art "store and forward" system integrated with a voice recognition system
  • Figure 11 is a flow chart showing a voice recognition system using the described invention
  • Figure 12 is a list of results from an ASR system acting on a Word List according to the invention.
  • Figures 13 and 14 show the contents of dynamic grammars created by an ASR system according to the invention acting on the Word List as described above.
  • the process and system according to the invention address the functional performance problems of accuracy, speed, utterance flexibility, interface expectations and usability, target data flexibility and resource requirements associated with large grammars in ASR systems.
  • a grammar is generated and designed for "single execution". That is, a grammar is generated knowing that the ASR technology will perform a "single pass" on the grammar attempting to match a possible utterance and will return the corresponding candidates.
  • the grammar is generally designed to encompass as many utterances as reasonably possible.
  • a grammar is designed to be as small as possible.
  • the grammar is dynamically generated knowing that the ASR system will be used again to perform one or more latent, and optionally concurrent, recognitions, each latent recognition evaluating the terms from a previous recognition process.
  • the grammar is dynamically generated such that the terms represented in the grammar can lead to as many possible results as required.
  • the grammar is also generated to be as small as possible or required and for the desired level of accuracy given the characteristics of the words in the grammar.
  • the grammar will contain many disparate terms so that the ASR system will be more capable of determining the differences between the terms.
  • the process is facilitated by recording or saving the original utterance of the user as applied to the initial or first grammar and applying the same utterance to subsequent grammars which are dynamically generated (or may have been previously generated).
  • Each latent recognition evaluates the utterance against a grammar which is used to either prove or disprove a possible result.
  • the latent grammars may be dynamically or previously generated.
  • the grammar target that is the information being referenced by a grammar and which is used to create a grammar, 5 can also be dynamically changing (for example it can be a Word List or a grammar). This process allows the original primary grammar to be used to dynamically generate a grammar at run time, even though is it representing a large data set which normally calls for pre-compiled grammars.
  • the utterance is not re-presented to the user (i.e.: the user does not hear the original utterance even though it is used more than once).
  • the time taken for the process is minimized by means such as using concurrent processing or iterations, or engaging a caller is in another dialog.
  • gain control i.e. adjustment of the recording sensitivity
  • control of the gain applied to the recorded or stored utterance for latent recognitions can be used as a variable to enhance accuracy of the ASR process.
  • the items in the grammar which are represented go through a transformation process.
  • a transformation process In a directory assistance model, such grammar is usually created using business listings.
  • Figure 1 shows a typical sample of business listings and
  • Figure 2 shows the grammar items extracted from such listings.
  • the purpose of the transformation process is to examine the item to be represented and apply adjustments to create a Word List appropriate to the grammar.
  • the transformation process typically includes the expansion of abbreviations and the addition, removal or replacement of characters, words, terms or phrases with colloquial, discipline, interface, and or implementation specific characters, words, terms or phrases.
  • the transformation process may add, remove, and/or substitute characters, words, terms and/or phrases or otherwise alter or modify a representation of the item to be represented.
  • the transformation process may be applied during the creation or other updating of the item to be represented, or at run-time, or otherwise when appropriate. Typically for large data sets and in the preferred embodiment, the transformation process is applied when the item to be represented is created and/or updated or in batch processes.
  • the transformation process calculates a series of terms (characters, numbers, words, phrases or combinations of the same) derived from the item to be represented.
  • the transformation process if the transformation process is applied, it is preferable to implement the results of the process in a "non-destructive" manner such that the source item is not modified. It is preferable to save the result of the transformation process ensuring that a relationship to the item to be represented can be easily maintained.
  • Figure 3 illustrates the result of a transformation process applied to the sample business listings of Figure 1.
  • the 'TSTame” column identifies the item to be represented (i.e. the source item).
  • the ampersand (“&") is an illegal character in some speech recognition grammars, and, furthermore, is spoken as the word "and”. As such, the "&" is said to be “transformed” into “and” and applied to the "Terms” column.
  • the word “double” is present in the "Terms” column. The inclusion of this word in the "Terms” column will facilitate the use of the word "double” by a user to reference the item to be represented.
  • a "Word Map” is generated from the either the result of the transformation process or directly from the item to be represented.
  • the Word Map is a list of terms (herein called "words") and corresponding references to the item to be represented. Each entry in the Word Map maps at least a single term and a reference to an item to be represented. As such, pluralities of the same term will likely appear in the Word Map.
  • Additional information may also be extracted and or determined as appropriate for the given implementation. Such information may include data to facilitate the determination of words to include in the resulting grammar and/or data that may be useful in the interpretation of the resulting grammar.
  • a Word Base contains the base term of a given term.
  • the term “repairing”, “repaired”, “repair” may all share the same base term “repair”.
  • Inclusion of the base term provides a level of flexibility when interpreting the resulting grammar.
  • variations of a listing may be included to include the colloquial descriptions of the listing subject.
  • the listing for "Langley SilverCity” may be also be referenced by the variations “Langley Theatre", “Langley Cinema” and “Langley Movie Theater”.
  • Each variation will be considered independently for inclusion in the dynamically generated grammar, and each variation will lead to the return of the same listing (in this case "Langley SilverCity”.
  • a "Use Count” is applied to each entry in the Word Map table.
  • the Use Count articulates the total number of times a term is present in the Word Map. This facilitates rapid frequency analysis of the items in the Word Map.
  • Figure 4 illustrates a Word Map for a series of business listings typical in a business directory, yellow pages or directory assistance implementation.
  • the "Word” column represents a specific instance of a term as matched to a specific item to be represented.
  • the "Word Base” column represents the word base of a specific term.
  • the “Reference” column represents the reference used to link the specific entry in the Word Map table to the item to be represented.
  • the "Use Count” column indicates the total number of times the term appears in the Word Map.
  • An objective of the grammar generation process is to generate a single list of terms which can be used in a subsequent process to determine which items to be represented are being referenced while keeping the number of terms used in the grammar to a number suitable for practical application.
  • the process commences by generating a list which contains all of the distinct terms from the Word Map, called a "Word List".
  • Figure 5 illustrates a statistical analysis of the Word Map for the business listings of Figure 1.
  • the illustration depicts a "Use Count” column and a "Word” column where the "Use Count” articulates the usage frequency of a "Word” (or term) in the Word Map.
  • the Word (or term) "a” has a usage frequency of 6, "1-t-d” of 4, “limited” of 4, "and” of 3, and so on.
  • the maximum practical size for a grammar is 25 terms (in real- word applications, the maximum size of a grammar is much larger but yet has a "practical" limit often dependent on a variety of factors). In such a model having more than 25 terms in the grammar results in slow processing of the speech. Furthermore, reducing the grammar from its maximum size to 15 or less allows the ASR system to perform in a manner suitable for implementation and practical purposes. Note that these numbers are used for illustrative purposes only and the method and system according to the invention is suitable for use with any size of grammar.
  • a prior art grammar would include a representation for each business name, for example "a and a piano service 1-t-d". Such a grammar would apply a "return result" of the ID of the business when it was recognized.
  • a grammar following this model would consist of approximately 40+ terms for the given illustrated list of businesses.
  • this methodology of grammar generation does not easily support alternate terms or allowances for the user not using the exact terminology as reflected in the grammar.
  • a grammar can be generated which could contain only 10 words (and therefore would not exceed the maximum viable size), but also, due to it's compactness and design, offer both speed and flexibility. Properly applied, the flexibility can be utilized to render significant accuracy.
  • Trimming is performed on the Word List by excluding or including terms, generally by, but not limited to, the criteria of usage frequency. Those skilled in the discipline will determine and/or discover other criteria which can be used to determine the inclusion of terms in the Word List.
  • the Word List should be approximately 1/3 proper names and 2/3 common names. Futhermore, the inclusion of words may be weighted by "frequently requested listings" so that more words from items frequently requested are included (for example golf courses, hotels and other travel destinations). Some words that are preferably included represent listings that are not necessarily frequent (i.e. they do not appear in a large number of listings), but they are sufficiently popular that they should be included in the Word List. An example would be a listing for a retail outlet such as a WALMART store. In addition some words appear so commonly as to have little value in dynamically generating the grammar. For example the word "Corporation" in a reasonably large city, even though it may appear in many listings, is unlikely to be useful in the trimmed Word List.
  • another method of determining the word list is to subdivide the original grammar into one or more smaller subgrammers.
  • the subgrammars can be based on size (for example words with six or more letters are placed into one subgrammar and words with five or less letters are placed into another subgrammar).
  • Other criteria for splitting the initial grammar can be used, such as alphabetical order, can also be used.
  • the utterance is then passed through each smaller grammar, and each grammar produces a list of words recognized. These are amalgamated to continue the process as described below.
  • ASR grammar may contain "slots".
  • the trimmed Word List should be assigned to each slot, and the number of slots should be in congruent with the average number of terms or words among all of the items to be represented. For example, if the average item to be represented contains 5 words or terms, 5 slots should be assigned, each containing the trimmed Word List.
  • Those skilled in the art may use additional methods known in the art for the Word List or trimmed Word List generation in relation to slot position. Such enhancement can increase the accuracy of the process. For example, the process can be easily applied to generate a Word List or trimmed Word List by word or term position for each particular slot.
  • ASR is a "one pass” process: a grammar is generated, applied and the result is examined.
  • the process according to the invention is a "multi pass” process: a grammar is generated which is designed to result in the generation of a one or more "latent grammars".
  • the process requires that the spoken utterance or interface input is stored in a manner which can be re-applied.
  • the speech is simultaneously "recognized” and “recorded” or obtained from the ASR recognizer after the recognition is performed.
  • either method may be used.
  • the stored speech is re-applied in a manner which the caller cannot hear. This can be achieved in different manners, including but not limited to temporarily closing, switching or removing the audio out or applying the stored recognition in another context (i.e.: another process, server, application instance, etc.).
  • the result of the application of the grammar generated by the trimmed Word List or Word List is the term, or base term if used, of the Word Map.
  • above the latent grammar can be formed out of the results of multiple passes through one or more subgrammars formed from the main grammar.
  • An evaluation of the grammar results may then be performed.
  • 'fa- best a feature which returns the "n-best" matches for a given utterance, is applied such that multiple occurrences of a term may be returned.
  • a list of grammar results and associated return result frequency and confidence scores can be assembled in a number of forms. Calculating the result occurrence frequency and obtaining the confidence score can be applied in a number of ways to effectively determine the relevance of items in the result set. For the purposes of an example, let us assume that the user responded to a request for Business Name with "Kearney Funeral Home". As best seen in Fig.
  • the n-best results, after the ASR system has compared the utterance to the Word List includes the words “chair”, “nishio”, “oreal”, “palm”, “arrow”, “aero”, “pomme”, and "home”. Of these words, only "home” is found in the requested listing, "Kearney Principal Home”.
  • the Word List is then scanned and all entries containing any of the n-best words (after the Word Map has been applied) are placed in a dynamically generated "latent grammar".
  • Figure 4 depicts an example of a Word Map.
  • the Word Map may be recursively scanned, each time removing words which are least useful, until a latent grammar of the desired size is obtained.
  • a latent grammar could be generated based on these items and latent recognition process could be performed. If, however, it was determined that the size resulting latent grammar would be too large or the process of generating the latent grammar would be too time consuming for practical application, grammar result trimming could be applied.
  • the term "a” could be removed due to its ambiguity or high usage frequency. This would in result the A & A Piano Service Ltd, A-l Aberdeen Piano Tuning & Repairs, North Bluff Auto Services, and White Rock Automotive Services Ltd.
  • grammar result trimming can be used as those skilled in the art will determine and/or discover.
  • word positions can be used to select which terms may be appropriate for inclusion or exclusion in the Word Map search.
  • the latent grammar is applied through a "latent recognition process" whereby the stored utterance used to invoke the result of the grammar is re-input against the latent recognition grammar.
  • the grammar is being changed from a broad non-specific grammar to a smaller, more specific grammar.
  • a voice recognition system In a voice recognition system according to the invention, one of the primary goals is to create a transparent interface, such that every time a requestor calls for assistance, whether the request is handled by voice recognition or by a human operator, the same pattern of questions will be provided in the same order.
  • a typical prior art "store and forward" system is seen in Fig. 9.
  • the user calls the information number (for instance by dialing "411").
  • the user may select a language (for instance by pressing a number, or though the use of an ASR system), as seen in step 10.
  • the user will then answer questions relating to the requested listing, such as country (step 20), city (step 30) and listing type (step 40), i.e. residential, business or government.
  • the user will then be asked the name of the desired listing (step 5, 60 or 70).
  • the answers to these questions will then be "whispered" to the operator (step 80). Ideally, the operator will be able to then quickly provide the listing to the user (step 90), or if the answers were not appropriate (for instance, no answer is provided), the operator will ask the user the necessary questions.
  • the traditional store and forward system is often combined with an ASR system, such that when possible the ASR system will be used .
  • the user is asked different questions if an ASR system is used to respond to the inquiry.
  • a store and forward system is used to respond to the inquiry.
  • a determination is made as to the appropriateness of the ASR system. If the request is found appropriate for ASR determination (in step 110), for example, a grarnrnar is prepared for the requested city, the user is then asked questions to reduce the grammar (for example the type of business in step 110).
  • step 120 It may be necessary to further reduce the grammar by asking more ⁇ questions (in step 120), for example by further determining a restaurant is being requested, and ⁇ then asking the type of restaurant. Therefore, the questions asked the user vary depending on whether or not the user's request is considered appropriate for a determination by an ASR system or by a "store and forward" system.
  • the user is asked the same questions whether or not a store and forward or ASR system is used to determine the response. As seen in Fig. 11, the determination is made at the time the user has responded to the necessary questions (up to business name). If the ASR system is not suitable for a response, the questions are whispered to the operator. If the ASR system is appropriate, the utterances are run through a word list for the businesses in the selected city and a dynamic latent grammar is generated (step 130). Note that at this time and in the example provided, most ASR systems used in directory assistance applications are used exclusively with business listings, although they ASR systems can also be used with government of residential listings.
  • the utterance is then run through the latent grammar (more than once if necessary) and an answer is provided. No additional questions need be asked to shrink the grammar. If the confidence of the ASR generated answer is not high enough (using means known in the art), then the responses to the questions can be whispered to an operator. In any case, no additional questions are asked, and whether an ASR or store and forward system is used, the experience will be invisible to the user.
  • the user will be asked if the answer provided is what he r she was looking for. If they indicate no, the answers will be passed to an operator using the "store and forward" system.
  • Another aspect of the invention is the use of gain control to assist the ASR system in determining the response to an inquiry.
  • the volume at which the ASR system "hears" the utterance can have dramatic effects on the end result and the confidence in the correct answer.
  • the ASR system will adjust the gain to reflect the circumstances. For example, if there is a high volume of ambient noise in the background, it may be preferable to increase the gain. Likewise, _if the spoken response is below a preset level, it may be preferable to increase the gain.
  • Another opportunity to use gain control is if the confidence of the result is below a preset level. In these circumstances it may be appropriate to adjust the gain and retry the utterance to see if the confidence level improves or a different result is obtained.
  • the preferred gain level for a source phone number may be stored, so that when a 5 call is received from that source, the gain level can be adjusted automatically.
  • the ASR system can also be improved through additional audio processing in addition to or in place of gain control, for example by examining and adjusting for attributes particular to the utterance to be recognized and to enhance the audio which might be whispered to an operator in the event of an operator transfer.
  • the utterance is recorded and certain measurements are taken, for example the duration of the utterance, the rate of speech, and the loudness (expressed as Root Means Squared "RMS").
  • RMS Root Means Squared
  • the utterance may be trimmed, for example by deleting dead spots. If appropriate the utterance can be compressed. The speech rate can also be changed, and the gain of the utterance can be adjusted.
  • Another option is to modify a version of the utterance and run both the modified utterance and the original recording through the ASR system. This allows for multiple simultaneous passes of the same utterance, and if both are run 5 through the ASR system an return the same result, the accuracy can be improved dramatically. Typically the utterance, for optimal performance, should be slowed down, and the volume increased.
  • the utterance, amended or unaltered, may also be "whispered" to an operator at this stage if the utterance has certain qualities that make it unsuitable for the ASR system, for example a large 10 amount of background noise.
  • the ASR system monitors the current conditions and decides the appropriate course of action. Factors that should be considered are the characteristics of the audio input that make up the utterance, the resources (i.e. computing power) available, and the queue conditions (i.e. 15 the current system usage). From this the time necessary to use the ASR system can be estimated, and a decision made as to use the ASR system or to whisper the utterance to an operator.
  • a key determination at this point is the quality of service to be offered to the user, which can mean the time within which the telecommunications provider will provide the requested information. For example, different companies may have different tiers of service levels for their
  • a user calling from a mobile phone will usually demand and receive the fastest service, and therefore is most likely to have his or her utterance whispered to an operator.
  • a caller from a phone booth will likely have a long tolerance for waiting, and has no easy alternative source of information and therefore the telecommunications provider will likely have the longest tolerance for offering a response. Therefore a user from a phone booth is
  • the quality of service level can also vary depending on the time of day, or the day of the week.
  • the system when determining the appropriate treatment of an utterance, behaves very sm ilarly as would an operator. It evaluates the utterance based on what was heard, taking into account words not heard completely. It can also "fix” the utterance, for example by making it louder, slower, deeper, etc. The utterance can also be "divided” into the various words, and can even be reordered.
  • the ASR system runs the utterance through a lexical pass (using the grammar comprising the word list). This tends to be a very fast pass, as each word is identified the listings using that particular word (or applicable variations) are flagged for the latent recognition grammar.
  • Other considerations in this pass include the language structure (i.e. nouns, verbs, adjectives, etc.) and the language structure class (i.e. proper/common nouns).
  • Another feature of the grammar based on the word list can be weighting the grammar towards more frequently requested listings ("FRLs"). Certain listings are more frequently requested, such as taxis, pizza restaurants, hotels and tourist destinations. This can be reflected by weighing such listings (and the words used in such listing that appear in the word list) so that they are more likely to be returned by the ASR system.
  • FTLs frequently requested listings
  • the utterance is then passed through the latent recognition process as described above.
  • the latent recognition grammar is usually a small grammar and this step can be accomplished very quickly.
  • certain words may trigger geographic referencing (such as the term "on") which can be used by the system for accuracy (i.e. does the address of the listing correspond to a street referenced in the utterance), h some cases geographic referencing may be necessary (for example to locate a particular location of a restaurant chain).
  • geographic referencing such as the term "on”
  • geographic referencing may be necessary (for example to locate a particular location of a restaurant chain).
  • the final pass is typically comprised of a grammar comprising only the n-best results from the LRP passes. Given the small size of this grammar, it can very quickly determine the best answer, and return a result with a confidence level.
  • the system can present the result to the user or send the utterance to an operator.
  • a further feature of the system is that it can take advantage of normal hold times. For example if an utterance is run through the ASR system, but has too low a confidence level for normal presentation as the "correct" response, such utterance will then be whispered to the operator.
  • the result obtained by the ASR system can be presented to the user, preferably with a recorded message such as "Thank you for holding. While you were waiting I found.".
  • a recorded message such as "Thank you for holding. While you were waiting I found.".
  • an ASR result with low confidence can be presented as a value added service.
  • the utterance is considered inappropriate for the ASR system (for example due to background noise)
  • the ASR system gets a result first, even at a low confidence level, it can be presented to the user. If the user accepts the result, the whispered utterance can be removed from the queue. If the utterance is not accepted the operator will soon come on line.
  • Another feature of the present system is that it is adaptive and can be used in very different circumstances. For example the system can determine the frequency of the terms recognized in the first pass. If these terms are too common (for example a phone number for a popular chain restaurant without any geographic reference), the system can recognize this (as the term recognized will be flagged with a high frequency). As the ASR system is unlikely to provide the correct result, the system can then whisper the utterance to an operator.
  • the system described above provides a number of advantages. It is not dependent on the word order of the utterance. It does not use a fixed grammar structure (which limits the number of recognizable utterances). It is not based on a single very large grammar, which takes too long to compile and run. It can take advantage of linguistics (by using variations of the words in the actual listing), and can extract meaning from the utterance. Prior art ASR systems have been concentrating on "what was said” and have not been used in circumstances where what should be properly determined is "what was meant”.
  • the system can run several latent recognition passes (perhaps using amended utterances). If the dynamic grammar generated is too large, the system can complete several passes (for example each using a subset of the large dynamic grammar). Alternatively, as ASR systems are inherently unpredictable (i.e. they may produce different results from the same inputs), there may be benefits to running several passes of the latent recognition system on the same utterance. In practice if time permits these multiple passes can be run sequentially. Alternatively, if system availability permits, they can be run concurrently, and the result with the highest confidence level can be obtained.
  • the system and method described above can also serve to direct services to users or direct users to services. For example when a user requests the phone number of a taxi company, it is likely that user is actually trying to have a taxi sent to a particular location.
  • the ASR system can be used with geographic recognition systems (for example as described in PCT Application No. PCT/CA01/00689 for a Method and Apparatus of for Providing Geographically Targeted Information and Advertising, which is hereby incorporated by reference).
  • the system and _ method described herein can be modified to ask the user if they are looking for a service,..e.g. a. taxi, or the nearest hotel, and if so, they can be asked to give their location. Then after determining the location of the user they can be directed to the nearest hotel, or the closest taxi can be directed to them.
  • This feature can be used with a number of services, including restaurants, pizza, laundromats, etc.
  • the geographic referencing can also be used to provide answers when the user gives incorrect information. For example, if the user asks for a listing that doesn't exist in a particular location, the system can look in neighbouring areas (for example a suburb) to determine if the appropriate listing is actually there. Also areas that have very similar sounds may be checked. For example if a reference can't be located in the town named "Oshawa", the ASR system, time permitting can, then check the location "Ottawa".
  • an advertisement could be presented, for example "This service has been brought to you by company XYZ". Another opportunity is available just before the number is provided to the user. Another opportunity is when the user is waiting during the processing of the utterance, and if the answer is being provided with visual information (such as via an MMS message to a cellular phone), there is yet another opportunity for an advertisement.
  • the making of a request for a business also provides an opportunity to target an advertisement. For example when a request is made for a restaurant in a certain geographic area, a competitor could present an advertisement with an inducement (e.g. a coupon or the like) in an attempt to lure that customer to a different establishment.
  • an inducement e.g. a coupon or the like
  • the user will also be providing information about themselves based on the area from which they are calling and the call display information. By using the information available about the user and the listing the user is looking for, very precise advertisements can be presented to the user.

Landscapes

  • Engineering & Computer Science (AREA)
  • Artificial Intelligence (AREA)
  • Computational Linguistics (AREA)
  • Health & Medical Sciences (AREA)
  • Audiology, Speech & Language Pathology (AREA)
  • Human Computer Interaction (AREA)
  • Physics & Mathematics (AREA)
  • Acoustics & Sound (AREA)
  • Multimedia (AREA)
  • Machine Translation (AREA)
  • Character Discrimination (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
EP03767358A 2002-12-16 2003-12-16 Spracherkennungssystem und -verfahren Withdrawn EP1581927A2 (de)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
US43350602P 2002-12-16 2002-12-16
US433506P 2002-12-16
CA002419526A CA2419526A1 (en) 2002-12-16 2003-02-21 Voice recognition system
CA2419526 2003-02-21
PCT/CA2003/001948 WO2004055781A2 (en) 2002-12-16 2003-12-16 Voice recognition system and method

Publications (1)

Publication Number Publication Date
EP1581927A2 true EP1581927A2 (de) 2005-10-05

Family

ID=32597873

Family Applications (1)

Application Number Title Priority Date Filing Date
EP03767358A Withdrawn EP1581927A2 (de) 2002-12-16 2003-12-16 Spracherkennungssystem und -verfahren

Country Status (4)

Country Link
EP (1) EP1581927A2 (de)
AU (1) AU2003291900A1 (de)
MX (1) MXPA05006672A (de)
WO (1) WO2004055781A2 (de)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2499305A1 (en) * 2005-03-04 2006-09-04 668158 B.C. Ltd. Method and apparatus for providing geographically targeted information and advertising

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See references of WO2004055781A2 *

Also Published As

Publication number Publication date
MXPA05006672A (es) 2006-03-10
WO2004055781A2 (en) 2004-07-01
WO2004055781A3 (en) 2004-09-30
AU2003291900A1 (en) 2004-07-09

Similar Documents

Publication Publication Date Title
US20060259294A1 (en) Voice recognition system and method
CA2372676C (en) Voice-operated services
US9418652B2 (en) Automated learning for speech-based applications
US20030125948A1 (en) System and method for speech recognition by multi-pass recognition using context specific grammars
US9626959B2 (en) System and method of supporting adaptive misrecognition in conversational speech
US6937986B2 (en) Automatic dynamic speech recognition vocabulary based on external sources of information
US8326634B2 (en) Systems and methods for responding to natural language speech utterance
US20080019496A1 (en) Method And System For Providing Directory Assistance
US20060069570A1 (en) System and method for defining and executing distributed multi-channel self-service applications
US20100217591A1 (en) Vowel recognition system and method in speech to text applictions
US20050004799A1 (en) System and method for a spoken language interface to a large database of changing records
CN111899140A (zh) 基于话术水平提升的客服培训方法及系统
US20020087307A1 (en) Computer-implemented progressive noise scanning method and system
WO2004055781A2 (en) Voice recognition system and method
CA2510525A1 (en) Voice recognition system and method
CA2438926A1 (en) Voice recognition system
CN117153151B (zh) 基于用户语调的情绪识别方法
JP2003029784A (ja) データベースのエントリを決定する方法
Thirion et al. The South African directory enquiries (SADE) name corpus
Gardner-Bonneau et al. Designing the Voice User Interface for Automated Directory Assistance
Higashida et al. A new dialogue control method based on human listening process to construct an interface for ascertaining a user²s inputs.
Johnsen et al. Improving speech centric dialogue systems–The BRAGE project

Legal Events

Date Code Title Description
PUAI Public reference made under article 153(3) epc to a published international application that has entered the european phase

Free format text: ORIGINAL CODE: 0009012

17P Request for examination filed

Effective date: 20050715

AK Designated contracting states

Kind code of ref document: A2

Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IT LI LU MC NL PT RO SE SI SK TR

AX Request for extension of the european patent

Extension state: AL LT LV MK

DAX Request for extension of the european patent (deleted)
STAA Information on the status of an ep patent application or granted ep patent

Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN

18D Application deemed to be withdrawn

Effective date: 20081006