METHOD AND SYSTEM FOR RECOGNIZING SPEECH USING WILDCARDS IN AN EXPECTED RESPONSE

[0001] The present invention relates to speech recognition and, more particularly, to adaptable systems configured to use expected responses with wildcards for recognizing speech.

[0002] Speech recognition has simplified many tasks in the workplace by permitting a hands-free exchange of information. A worker may receive voice commands through a headset speaker and transmit spoken responses via a headset microphone. The headset may be attached to a mobile computing device, the combination forming a wireless, wearable terminal. Industries, such as inventory management, especially benefit from the hands-free and wireless aspects of these devices.

[0003] The inventory-management industry relies on computerized inventory-management systems to aid with various functions. An inventory-management system typically includes a central computer in communication with the wireless, wearable terminals. Workers, wearing the wireless wearable terminals interface with the central computer while performing various tasks (e.g., order filling, stocking, and picking). For example, as a worker is assigned a task, appropriate information is translated into voice instructions and is transmitted to the worker via a headset. As the worker completes the task, the worker may respond into the headset's microphone. In this way, the workers may pose questions and/or report progress and working conditions (e.g., inventory shortages). The wireless, wearable terminal using speech recognition, allows a worker to perform tasks virtually hands-free, improving speed, accuracy, and efficiency.

[0004] In an exemplary workflow, the central computer may send voice messages welcoming the worker to the inventory management system and then assigning the worker a particular task (e.g., loading a truck). The system then vocally directs the worker to a particular aisle and bin, and directs the worker to pick a quantity of an item. Upon completing the pick task, the worker vocally confirms the location and the number of picked items. The system may then direct the worker to load the items onto a truck at a particular loading dock. Again, the user responds with feedback at various times during the process. The communications exchanged between the wireless-wearable terminal and the central computer can be task-specific and highly variable.

[0005] Good speech recognition is necessary for this work to be performed efficiently. A speech recognizer uses algorithms running on an integrated processor to analyze received speech input and determine the likely word, or words, that were spoken (i.e., form a hypothesis). As part of the hypothesis formulation, the speech recognizer assigns confidence scores that quantitatively indicate how confident the recognizer is that its hypothesis is correct. If the confidence score is above an acceptance threshold, then the speech recognizer accepts the hypothesis as recognized speech. If, however, the confidence score is below the acceptance threshold, then the speech recognizer considers the speech not recognized (e.g., background noise). This rejection may require the user to repeat the speech input. If the acceptance threshold is too high, then correct speech with a low confidence score may be rejected unnecessarily. These unnecessary rejections may reduce productivity and efficiency.

[0006] A speech recognizer that utilizes an expected response to adjust the acceptance threshold has been disclosed (e.g., U.S. Pat. No. 7,865,362). Here, however, the expected response is limited to expected responses known in their entirety and does not support specifying the partial knowledge of an expected response. Therefore, a need exists for a speech recognizer that accepts a more generalized expected response for modifying the behavior of the speech recognition system to improve recognition accuracy.

[0007] Accordingly, in one aspect, the present invention embraces a method for adjusting an acceptance threshold in a speech recognition system. The method includes the step of receiving a speech input using a computing device that has at least one processor and a memory. The processor processes the speech input to derive a sequence of hypothesized (i.e., hypothesis) words embodying a hypothesis. Each hypothesis word is associated with a confidence score. An expected response composed of a sequence of expected words and at least one wildcard word is retrieved from memory and compared to the hypothesis on a word-by-word basis. Based on the results of this comparison, an acceptance threshold for each hypothesis word is adjusted.

[0008] In an exemplary embodiment, when a word from the hypothesis matches its corresponding expected word in the expected response, then the acceptance threshold for the hypothesis word is adjusted by an exact-match adjustment amount.

[0009] In another exemplary embodiment, when a word from the hypothesis corresponds to a wildcard word in the expected response, then the acceptance threshold for the hypothesis word is adjusted by a wildcard-match adjustment amount.

[0010] In another exemplary embodiment, the wildcard-match adjustment amount and the exact-match adjustment amount are not the same amount. In addition, for some embodiments, the threshold adjustment amount may be zero (i.e., no threshold adjustment) for all hypothesis words when a word in the hypothesis does not match its corresponding expected word.

[0011] In another exemplary embodiment, the speech recognizer compares the confidence score of the hypothesis word to the acceptance threshold in order to accept or reject the word as recognized speech. In some exemplary embodiments, the hypothesis word is accepted when the confidence score of a hypothesis word exceeds the acceptance threshold.

[0012] In another aspect, the present invention embraces a method for adapting models for a speech recognition system. The method includes the step of receiving a speech input using a computing device that has at least one processor and a memory. The processor, running speech recognition algorithms, derives a hypothesis including a sequence of hypothesis words. An expected response is retrieved from memory and includes a sequence of at least one expected word and at least one wildcard word. The hypothesis words in the hypothesis and the expected words or wildcard words in the expected response are compared word-by-word in sequence. If a hypothesis matches the expected response, then the hypothesis words are marked as suitable for use in adaptation. The models corresponding to the words in the hypothesis that were marked suitable for adaptation are adapted using the acoustic data corresponding to the marked hypothesis words.

[0013] In an exemplary embodiment, a hypothesis word that corresponds to a wildcard word in the expected response is marked not suitable for adaptation. Features corresponding to a particular hypothesis that are marked as not suitable for adaptation will not be used to update the model of that word. For example, if the hypothesis is ‘1 2 1’ and the final ‘1’ was not suitable for adaptation, then the features corresponding to the first ‘1’ would be used to update the model for ‘1’ and those corresponding to the final instance would not.

[0014] In another exemplary embodiment, a hypothesis word in the hypothesis that does not match its corresponding expected word in the expected response causes all words in the hypothesis to be marked as not suitable for adaptation. Models corresponding to hypothesis words marked not suitable for adaptation are not adapted.

[0015] In another aspect, the present invention embraces a system for recognizing speech. The system includes a speech input device for gathering speech input. The system also includes a computing device with a processor and a memory that are configured to execute (i) a recognition algorithm, (ii) a threshold-adjustment algorithm, and (iii) an acceptance algorithm. The recognition algorithm assesses the speech input using a library of models stored in the memory to generate (i) a hypothesis including hypothesis words and (ii) a confidence score associated with one or more hypothesis words. The threshold-adjustment algorithm adjusts an acceptance threshold corresponding to a hypothesis word if the hypothesis matches an expected response stored in the memory and where a wildcard word in the expected response can match any word in the same position in the hypothesis. The expected response includes at least one expected word and at least one wildcard word. The acceptance algorithm accepts a hypothesis word when the hypothesis word's confidence score exceeds the hypothesis word's acceptance threshold.

[0016] In an exemplary embodiment, the amount of acceptance threshold adjustment is different for hypothesis words that match corresponding expected words than for hypothesis words that correspond to wildcard words. In some embodiments, this adjustment is a reduction of the acceptance threshold, wherein the reduction is greater for hypothesis words corresponding to expected words than it is for hypothesis words corresponding to wildcard words. In another embodiment, the difference in the acceptance threshold adjustment between hypothesis words corresponding to expected words and hypothesis words corresponding to wildcards may be affected by the matching conditions between other words in the hypothesis and their corresponding expected words (or wildcard words).

[0017] In yet another aspect, the present invention embraces a system for recognizing speech. The system includes a speech input device for gathering speech input. The system also includes a computing device including a processor and a memory. The processor and memory are configured to execute a recognition algorithm and a word-marking algorithm. The recognition algorithm assesses the speech input using a library of models stored in the memory to generate a hypothesis that includes hypothesis words. The word-marking algorithm compares each word of the hypothesis, in sequence, to an expected response stored in the memory that includes expected words and at least one wildcard word. The word-marking algorithm marks each hypothesis word that matches a corresponding expected word in the expected response as suitable for adaptation. The algorithm performs the marking step for all words in the hypothesis and then a model update algorithm adapts the models for a hypothesis word marked as usable for adaptation. The models are updated using the acoustic data corresponding to the marked words respectively.

[0018] The foregoing illustrative summary, as well as other exemplary objectives and/or advantages of the invention, and the manner in which the same are accomplished, are further explained within the following detailed description and its accompanying drawings.

[0024] The present invention embraces a speech recognition system to allow a user to speak a response to queries or instructions as part of a workflow (e.g., warehouse operations). FIG. 1 illustrates a perspective view of a user with an exemplary speech recognition system. The speech recognition system may include a mobile computing device 10 and a speech input/output device (e.g., headset) 16. The mobile computing device 10 may be a wearable device, that is worn by a user 11 (e.g., on a belt 14). The mobile computing device 10 may include at least one processor and at least one non-transitory storage medium (i.e., memory) (e.g., read-only memory, flash memory, and/or a hard-drive). The processor may facilitate speech recognition and other associated processing (e.g., logic, input/output, power management, communication, etc.). The headset 16 may be coupled to the portable terminal by a cord 18 or by a wireless connection (e.g., near-field communication (NFC) or BLUETOOTH®). The headset may be worn on the head of the user 11. In some possible embodiments, the mobile computing device 10 may be integrated with the headset 16, eliminating the need for a separate mobile computing device 10.

[0025] A user speaks into the speech input device (e.g., microphone) of the headset 16, and the audio information is transferred to the mobile computing device. The processor in the mobile computing device may be configured to execute algorithms to recognize the speech. Alternatively, the host computer may be configured to execute the algorithms to recognize speech. In either case, the mobile computing device could communicate with the host computer wirelessly via a variety of protocols (e.g., IEEE 802.11, including WI-FI®, BLUETOOTH®, CDMA, TDMA, or GSM). U.S. patent application Ser. No. 10/671,142, entitled “Apparatus and Method for Detecting User Speech”, incorporated herein by reference, further details the implementation of the system.

[0026] Typical to most voice data-entry applications (e.g., warehouse product picking/stocking) is the expectation of a user's response. In some dialogs, one or more particular responses, known as expected response(s), among the set of possible responses is known to be more likely than others are. These expected responses may be used by the speech recognition system to improve recognition accuracy. For example, an acceptance threshold used to prevent a background noise from being recognized as speech might be adjusted (e.g., lowered) if the hypothesis matches an expected response. In addition, a speech model (i.e., model) may be adapted (i.e., updated) differently depending on this match.

[0027] In some situations, only a partial knowledge of an expected response is known. For example, a portion of the expected response may be unknown or may cover a range of possible responses. Expanding the use of expected responses is made possible through the use of wildcard words. Wildcard words help reduce recognition errors resulting from responses that match an expected response but that would otherwise fail the acceptance threshold criteria.

[0028] Wildcard words are words in an expected response that match any recognized word in the corresponding position of a hypothesis. For example, a speech recognizer might hypothesize that “quantity three” was spoken. The word “quantity” is expected, but the word “three” is one possible response of many. In this exemplary situation, an expected response using a wildcard word to represent the word after “quantity” could expand the number of responses that match the expected response. For example, a speech input of “quantity three” or “quantity four” could both match the expected response due to the wildcard word. Using wildcards in this way expands the possible dialog constructs that could benefit from the described speech recognizer modifications and leads to an overall improved speech-recognition accuracy.

[0029] FIG. 2 illustrates a schematic view of a system for recognizing speech. Here, a speech input may be captured by a speech input device 102 in a variety of conventional ways. Typically, an electro-acoustical device (e.g., microphone) senses the speech input and converts it into an analog voltage signal 103 sent to a signal processor 104. The signal processor 104 may include analog-to-digital converters, filters, and equalization circuitry to convert the analog speech input 103 into a digitized stream of data 105. This digitized stream of data can be separated into separate units for analysis.

[0030] The signal processor 104 divides the digital stream of data into a sequence of time-slices, or frames 105, each of which is then processed by a feature generator 106, to produce features 107. A feature may be a vector, matrix, or otherwise organized set of numbers representing the acoustic features of the frames. The digitized speech input or any data derived from it that describe the acoustic properties of the speech input, such as the features 107, are known as acoustic data. Also, note that speech input may contain periods when the user is not speaking. Further explanation of an exemplary signal processor for speech is provided in U.S. Pat. No. 4,882,757, entitled “Speech Recognition System”, which is incorporated, by reference, in its entirety. This patent discloses Linear Predictive Coding (LPC) coefficients to represent speech; however, other functionally equivalent methods are contemplated within the scope of the present invention.

[0031] A speech-recognition search algorithm 108, realized by a circuit or software program, analyzes the features 107 to determine a hypothesis that best matches the speech input 102. In an exemplary recognition algorithm, the speech recognition search algorithm 108 uses probabilistic models from a library of models 110 stored in memory to recognize the speech input 102. Some library models (i.e., models) may be user customized (i.e., updated) to a particular user, while some models may be generic to all users.

[0032] During normal operation, the speech-recognition search algorithm 108 assesses the features 107 generated in the feature generator 106 using reference representations of speech (i.e., models), in library 110 to determine the word (or words) (i.e., hypothesized words) that best matches the speech input from device 102. Confidence scores are generated to indicate how closely the sequence of features from the search algorithm 106 matches the models in library 110. A hypothesis, including one or more hypothesized words and their associated confidence scores 111, is directed to an acceptance algorithm 112. A confidence score for a hypothesized word is compared to an acceptance threshold. If the confidence score exceeds the acceptance threshold, then the hypothesized word is recognized as speech and is accepted by the acceptance algorithm 112. If, however, the confidence score is not above the acceptance threshold, then the acceptance algorithm 112 ignores (or rejects) the hypothesized word and in response, the system may prompt the user to repeat the speech input.

[0033] One common modeling technique utilized for speech recognition includes Hidden Markov Models (HMM). In speech recognition, these models use sequences of states to describe vocabulary items, which may be words, phrases, or sub-word units. Each state represents a portion of a word and outputs a probability to each observed feature vector. A path through the HMM states provides a probabilistic indication of a series of acoustic feature vectors. The models are searched such that different, competing hypotheses (or paths) are scored—a process known as acoustic matching or acoustic searching. A state S can be reached at a time T via several different paths. For each path reaching a particular state at a particular time, a path probability is calculated. Using the Viterbi algorithm, each path through the HMM can be assigned a probability. In particular, the best path can be assigned a probability. Furthermore, each vocabulary item or word in the best path can be assigned a probability. Each of these probabilities can be used as a confidence score or combined with other measurements, estimates, or numbers to derive a confidence score. The path with the highest probability or highest confidence score, the hypothesis, can then be further analyzed. The confidence score of the hypothesis or the confidence scores of each hypothesized word in the hypothesis can be compared with an acceptance threshold. As used herein, the term “word” is used to denote a vocabulary item, and thus may mean a word, a segment, or part of a word, or a compound word, such as “next slot” or “say again.” Therefore, the term “word” is not limited to just a single word. It should also be understood that other speech recognition models are also contemplated within the scope of the present invention; for example, template matching dynamic time warping (DTW) and neural networks are two such exemplary, alternative modeling techniques.

[0034] A speech recognition system may assign confidence scores to hypothesized speech in a variety of ways. One way is to assign a single confidence score to an entire utterance (i.e., a continuous piece of speech beginning and ending with a clear pause), which may contain multiple words. The decision to accept or reject applies to all of the words corresponding to a confidence score. Another approach assigns confidence scores to parts of an utterance (e.g., words). In this case, the decision to accept or reject applies to the individual parts and their corresponding confidence scores. The invention disclosed herein may apply to speech recognizers that utilize either approach.

[0035] While existing speech recognition systems may adequately address generating speech features and recognizing the speech, there may still be drawbacks. For example, all of the hypotheses generated by the system, even the best-scoring hypothesis may have confidence scores that fall below the acceptance threshold. In this situation, the speech is rejected and may have to be repeated. Repeating speech input reduces productivity and efficiency of the user. Recognition accuracy and thus user productivity may be improved by using an expected response to modify the acceptance threshold.

[0036] U.S. Pat. No. 7,827,032, entitled “Method and Systems for Adapting a Model for a Speech Recognition System”, which is hereby incorporated in its entirety by reference, discloses an exemplary method of using an expected response to modify an acceptance threshold. In the U.S. Pat. No. 7,827,032 patent, however, the entire expected response (i.e., every word of the expected response) is known. The present invention provides a method and system that improves upon this concept by permitting the use of wildcards as part of the expected response.

[0037] FIG. 3 illustrates a flowchart of an exemplary algorithm for generating a hypothesis and corresponding confidence score(s) from speech. In step 202, speech input is received from the user by an input device 102 (or is recalled from storage). The speech input is digitized in step 204 by a signal processor 104. The digitized speech is separated, in step 206, into time slices and converted into feature vectors, such as by the feature generator 106. These feature vectors correspond to information within an acoustic model that allows a search and match to be performed to identify the most likely, or most probable, sequence of words spoken by the user (i.e., hypothesis). Step 208 reflects the search/match routine to determine a hypothesis. Such a search/match routine may be performed utilizing the speech-recognition search algorithm 108 and model library 110 as shown in FIG. 2. The output of the speech recognition search algorithm is a hypothesis made up of hypothesis words (i.e., hypothesized words), wherein each hypothesis word has an associated confidence score 111. In some cases, one confidence score may be assigned to more than one word in the hypothesis.

[0038] The hypothesis and confidence score(s) are used by an acceptance algorithm as shown in FIG. 4. The acceptance algorithm is used to either accept or reject words in the hypothesis (i.e., hypothesis words) as accurately recognized. A fixed acceptance threshold may be used to compare the confidence score associated with hypothesis words but this approach may set the threshold too high, resulting in correctly hypothesized words being erroneously rejected. This is especially true when a hypothesized word matches an expected response. A better approach is to adjust an acceptance threshold based on the expected response. Further, including wildcard words in the expected response expands the possible responses that can be used to adjust the threshold and improve the speech recognition system's performance.

[0039] As shown in FIG. 4, a hypothesis is compared to the expected response 301, and a hypothesis that has at least as many words as the expected response is considered word-by-word starting by setting the current hypothesis word (i.e., the word to be examined) to the first hypothesis word 302. The acceptance algorithm compares the current hypothesis word to its corresponding word in the expected response 304, which in this case is the first word of the expected response. If the two words match then the acceptance threshold for the current hypothesis word is adjusted 306. If, however, the expected response word is a wildcard word, then any hypothesized word will match the wildcard 308, and the acceptance threshold for the current hypothesis word will be adjusted by a wildcard match amount 310. Typically, thresholds for hypothesis words matching expected words are reduced to make acceptance 320 easier. The amount of reduction (i.e., the exact-match adjustment amount) may depend on the application.

[0040] After the first word of the hypothesis is examined, the algorithm moves to the next word in the hypothesis and expected response 314. This next word is set as the current word 316. At this point, the algorithm again compares the current hypothesis word, which here is the second word of the hypothesis, to the corresponding expected word (i.e., the second word of the expected response). If the two words match, whether exactly or with a wildcard, then the threshold is adjusted as before.

[0041] The type and amount of the acceptance threshold adjustment may be configured to match the application. Typically, hypothesis words corresponding to wildcards will have their acceptance thresholds reduced but at an amount that is less than the amount for hypothesis words that match their corresponding expected words exactly.

[0042] The process of comparing hypothesis words to expected words continues word by word in sequence until the either a mismatch is found or until the end of the expected response is reached. If a hypothesis word is compared to its expected word and there is a mismatch, then the threshold adjustments for all of the words in the hypothesis up to that point are reset 312 and no further adjustment occurs. That is, each hypothesis word uses its default acceptance threshold.

[0043] After the acceptance threshold for all words in the hypothesis are set (either adjusted or not), each word in the hypothesis has its confidence score compared to the acceptance threshold 318. Words with confidence scores that exceed their corresponding acceptance threshold are accepted 320. Words with confidence scores that do not exceed their corresponding acceptance threshold are rejected 322.

[0044] An example of the use of the wildcard words described above is an instance where the expected response is “one two *”, where “*” designates a wildcard word. In this case, a word is expected after “one two” but this word is not restricted or specified. If the hypothesis is “one two alpha”, the confidence scores associated with the hypothesized words may be +1, −1, −0.5, respectively, and the acceptance thresholds may be 0,0,0, respectively, then according to the method described herein the acceptance threshold for the first word will be adjusted downward, to −2 for example, since the hypothesized word “one” matches the corresponding word “one” in the expected response. In addition, the acceptance threshold for the second word will be adjusted downward, again to −2, since the hypothesized second word “two” matches the corresponding word “two” in the expected response. Finally, the acceptance threshold for the third word will be adjusted downward by a different amount, to −1 for example, since the hypothesized word “alpha” matches a corresponding wildcard word. Now comparing the confidence scores to the adjusted acceptance thresholds, all three hypothesized words will be accepted.

[0045] Continuing with this example, if the hypothesis were “one three beta” and all the other aspects remain the same, none of the acceptance thresholds would be adjusted because the second hypothesized word “three” does not match the second word in the expected response “two”. Consequently, the second and third hypothesized words, “three” and “beta”, would be rejected since their confidence scores would be below the corresponding acceptance thresholds.

[0046] An expected response may also facilitate updating models for the speech recognition system. Here again wildcards may be used to increase the range of responses that may be used to improve speech recognition performance and improve user experience. As shown in FIG. 2, the speech recognition search algorithm 108 uses a library of models 110 (i.e., speech models) to create a hypothesis. The models stored may be updated to adapt the system to a user's particular speech (e.g., accent). Expected responses provide good opportunities for model adjustment. If a user inputs speech that is recognized and found to be matching an expected response then this speech may be considered as a sample of speech suitable for model adaptation.

[0047] FIG. 5 illustrates a flowchart of an exemplary method for adapting models for a speech recognition system. A hypothesis is compared to the expected response 401, and a hypothesis that has at least as many words as the expected response is examined word-by-word 402. The current word in the hypothesis is compared to its corresponding word in the expected response 404. If the current word in the expected response matches the corresponding hypothesis word, then this hypothesis word may be marked suitable for use in adaptation 406. In a preferred embodiment, only hypothesis words corresponding to expected words are used for adaptations. When a current hypothesis word corresponds to a wildcard word 408, then the current hypothesis word is marked as not suitable for adaptation 410. This word-by-word comparison continues 414, 416, 404 until the end of the expected response is reached, or until a mismatch between a hypothesis word and expected word is found. If a mismatch is found, then all words in the hypothesis are marked as not suitable for adaptation 412. After all words are marked (i.e., either suitable or not suitable), then the models corresponding to each word marked suitable for adaptation are updated 418 using that word's acoustic data. Note that that the model adaptation/update may be withheld until multiple hypotheses are analyzed to allow model adaptation to be performed in a batch using more data.

[0048] There are multiple ways to include knowledge about an expected response within a speech recognition application for the purposes of the invention. For example, when developing the software, the developer may include this information in tables or other data structures that are referenced at different points in the execution of the application. For example, the program may use knowledge of a workflow script to look for a specific numeric password or code. Additionally (or alternatively), the information about the expected result can be calculated dynamically using programming logic in the speech recognition application. For example, it is well known that the accuracy of a credit card number can be calculated based on a particular checksum algorithm. In such an example, the speech recognition program would not need to have all the checksums pre-calculated beforehand, but can implement the checksum algorithm to calculate a value on-the-fly as needed. In another example, the program may know the location (bin/slot) that will be visited next. From this, the program may deduce the check-digits to look for in the expected response. This on-the-fly information is still available as “prior knowledge” with which to evaluate the speech received from a user, and thus the present invention may use either (i) pre-stored expected responses or (ii) dynamically-developed expected responses. Referring to FIG. 2, the expected response 114 may be used by the acceptance algorithm and may be retrieved from memory or calculated dynamically by system 100 in order to compare it to the hypothesis.

[0049] The amount by which the acceptance threshold is adjusted can be determined in various ways according to embodiments of the invention. In one embodiment, the voice development tool or API used to implement system 100 can provide a means for the application developer to specify the adjustment amount. For example, a fixed amount of threshold adjustment 116 may be built into the system 100 and used by acceptance algorithm 112 as shown in FIG. 2. Alternatively, the recognition system or application can be configured to calculate an adjustment amount automatically to lessen the knowledge needed by the application developer and prevent inappropriate use of the features of the invention.

[0050] For example, in one embodiment, to guard against the expected response being accidentally produced and accepted by the recognition system, the adjustment of the acceptance threshold may be dynamically controlled by an algorithm that considers the likelihood of the recognition system accidentally producing the expected response. For example, in one such embodiment, the present invention contemplates at least two independent components of such a threshold adjustment algorithm: the number of vocabulary items at the point in the application where the expected response is used (the breadth of the search), and the number of vocabulary items in the expected response (the depth). For example, if there are only two possible responses (e.g., a “yes” or “no” response) with one being the expected response, then the adjustment to the acceptance threshold could be made very small or zero because the recognizer is looking for a single word answer (depth=1) from only two possibilities (breadth=2).

[0051] Alternatively, in such a scenario, the system 100 could be configured to provide no adjustment to the acceptance threshold, because with such a low depth and low breadth, there is a higher chance of the system producing the expected response by accident.

[0052] However, in another recognition scenario, if there are a hundred possible responses (e.g., a two-digit check-digit), then the probability of producing the expected response by accident would be smaller and the adjustment to the acceptance threshold, therefore, may be made more significant. For example, two check-digits will have a hundred possible responses making a breadth of 100 and a depth of two for the two check-digits. This would allow a more significant threshold adjustment to be used.

[0053] In another embodiment, the threshold adjustment may depend on how likely the user is to say the expected response. If, in a particular application, the user says the expected response 99% of the time, the threshold adjustment may be greater than in applications where the user's response is not as predictable.

[0054] In still another embodiment, the acceptance-threshold adjustment amount can also be determined by considering the “cost” of the recognizer making an error. A smaller adjustment would be used when the cost is greater, to prevent errors where an incorrect hypothesis is mistakenly recognized as the expected response.

[0055] To supplement the present disclosure, this application incorporates entirely by reference the following commonly assigned patents, patent application publications, and patent applications:

• [0056] U.S. Pat. No. 6,832,725; U.S. Pat. No. 7,128,266;
• [0057] U.S. Pat. No. 7,159,783; U.S. Pat. No. 7,413,127;
• [0058] U.S. Pat. No. 7,726,575; U.S. Pat. No. 8,294,969;
• [0059] U.S. Pat. No. 8,317,105; U.S. Pat. No. 8,322,622;
• [0060] U.S. Pat. No. 8,366,005; U.S. Pat. No. 8,371,507;
• [0061] U.S. Pat. No. 8,376,233; U.S. Pat. No. 8,381,979;
• [0062] U.S. Pat. No. 8,390,909; U.S. Pat. No. 8,408,464;
• [0063] U.S. Pat. No. 8,408,468; U.S. Pat. No. 8,408,469;
• [0064] U.S. Pat. No. 8,424,768; U.S. Pat. No. 8,448,863;
• [0065] U.S. Pat. No. 8,457,013; U.S. Pat. No. 8,459,557;
• [0066] U.S. Pat. No. 8,469,272; U.S. Pat. No. 8,474,712;
• [0067] U.S. Pat. No. 8,479,992; U.S. Pat. No. 8,490,877;
• [0068] U.S. Pat. No. 8,517,271; U.S. Pat. No. 8,523,076;
• [0069] U.S. Pat. No. 8,528,818; U.S. Pat. No. 8,544,737;
• [0070] U.S. Pat. No. 8,548,242; U.S. Pat. No. 8,548,420;
• [0071] U.S. Pat. No. 8,550,335; U.S. Pat. No. 8,550,354;
• [0072] U.S. Pat. No. 8,550,357; U.S. Pat. No. 8,556,174;
• [0073] U.S. Pat. No. 8,556,176; U.S. Pat. No. 8,556,177;
• [0074] U.S. Pat. No. 8,559,767; U.S. Pat. No. 8,599,957;
• [0075] U.S. Pat. No. 8,561,895; U.S. Pat. No. 8,561,903;
• [0076] U.S. Pat. No. 8,561,905; U.S. Pat. No. 8,565,107;
• [0077] U.S. Pat. No. 8,571,307; U.S. Pat. No. 8,579,200;
• [0078] U.S. Pat. No. 8,583,924; U.S. Pat. No. 8,584,945;
• [0079] U.S. Pat. No. 8,587,595; U.S. Pat. No. 8,587,697;
• [0080] U.S. Pat. No. 8,588,869; U.S. Pat. No. 8,590,789;
• [0081] U.S. Pat. No. 8,596,539; U.S. Pat. No. 8,596,542;
• [0082] U.S. Pat. No. 8,596,543; U.S. Pat. No. 8,599,271;
• [0083] U.S. Pat. No. 8,599,957; U.S. Pat. No. 8,600,158;
• [0084] U.S. Pat. No. 8,600,167; U.S. Pat. No. 8,602,309;
• [0085] U.S. Pat. No. 8,608,053; U.S. Pat. No. 8,608,071;
• [0086] U.S. Pat. No. 8,611,309; U.S. Pat. No. 8,615,487;
• [0087] U.S. Pat. No. 8,616,454; U.S. Pat. No. 8,621,123;
• [0088] U.S. Pat. No. 8,622,303; U.S. Pat. No. 8,628,013;
• [0089] U.S. Pat. No. 8,628,015; U.S. Pat. No. 8,628,016;
• [0090] U.S. Pat. No. 8,629,926; U.S. Pat. No. 8,630,491;
• [0091] U.S. Pat. No. 8,635,309; U.S. Pat. No. 8,636,200;
• [0092] U.S. Pat. No. 8,636,212; U.S. Pat. No. 8,636,215;
• [0093] U.S. Pat. No. 8,636,224; U.S. Pat. No. 8,638,806;
• [0094] U.S. Pat. No. 8,640,958; U.S. Pat. No. 8,640,960;
• [0095] U.S. Pat. No. 8,643,717; U.S. Pat. No. 8,646,692;
• [0096] U.S. Pat. No. 8,646,694; U.S. Pat. No. 8,657,200;
• [0097] U.S. Pat. No. 8,659,397; U.S. Pat. No. 8,668,149;
• [0098] U.S. Pat. No. 8,678,285; U.S. Pat. No. 8,678,286;
• [0099] U.S. Pat. No. 8,682,077; U.S. Pat. No. 8,687,282;
• [0100] U.S. Pat. No. 8,692,927; U.S. Pat. No. 8,695,880;
• [0101] U.S. Pat. No. 8,698,949; U.S. Pat. No. 8,717,494;
• [0102] U.S. Pat. No. 8,717,494; U.S. Pat. No. 8,720,783;
• [0103] U.S. Pat. No. 8,723,804; U.S. Pat. No. 8,723,904;
• [0104] U.S. Pat. No. 8,727,223; U.S. Pat. No. D702,237;
• [0105] U.S. Pat. No. 8,740,082; U.S. Pat. No. 8,740,085;
• [0106] U.S. Pat. No. 8,746,563; U.S. Pat. No. 8,750,445;
• [0107] U.S. Pat. No. 8,752,766; U.S. Pat. No. 8,756,059;
• [0108] U.S. Pat. No. 8,757,495; U.S. Pat. No. 8,760,563;
• [0109] U.S. Pat. No. 8,763,909; U.S. Pat. No. 8,777,108;
• [0110] U.S. Pat. No. 8,777,109; U.S. Pat. No. 8,779,898;
• [0111] U.S. Pat. No. 8,781,520; U.S. Pat. No. 8,783,573;
• [0112] U.S. Pat. No. 8,789,757; U.S. Pat. No. 8,789,758;
• [0113] U.S. Pat. No. 8,789,759; U.S. Pat. No. 8,794,520;
• [0114] U.S. Pat. No. 8,794,522; U.S. Pat. No. 8,794,526;
• [0115] U.S. Pat. No. 8,798,367; U.S. Pat. No. 8,807,431;
• [0116] U.S. Pat. No. 8,807,432; U.S. Pat. No. 8,820,630;
• [0117] International Publication No. 2013/163789;
• [0118] International Publication No. 2013/173985;
• [0119] International Publication No. 2014/019130;
• [0120] International Publication No. 2014/110495;
• [0121] U.S. Patent Application Publication No. 2008/0185432;
• [0122] U.S. Patent Application Publication No. 2009/0134221;
• [0123] U.S. Patent Application Publication No. 2010/0177080;
• [0124] U.S. Patent Application Publication No. 2010/0177076;
• [0125] U.S. Patent Application Publication No. 2010/0177707;
• [0126] U.S. Patent Application Publication No. 2010/0177749;
• [0127] U.S. Patent Application Publication No. 2011/0202554;
• [0128] U.S. Patent Application Publication No. 2012/0111946;
• [0129] U.S. Patent Application Publication No. 2012/0138685;
• [0130] U.S. Patent Application Publication No. 2012/0168511;
• [0131] U.S. Patent Application Publication No. 2012/0168512;
• [0132] U.S. Patent Application Publication No. 2012/0193423;
• [0133] U.S. Patent Application Publication No. 2012/0203647;
• [0134] U.S. Patent Application Publication No. 2012/0223141;
• [0135] U.S. Patent Application Publication No. 2012/0228382;
• [0136] U.S. Patent Application Publication No. 2012/0248188;
• [0137] U.S. Patent Application Publication No. 2013/0043312;
• [0138] U.S. Patent Application Publication No. 2013/0056285;
• [0139] U.S. Patent Application Publication No. 2013/0070322;
• [0140] U.S. Patent Application Publication No. 2013/0075168;
• [0141] U.S. Patent Application Publication No. 2013/0082104;
• [0142] U.S. Patent Application Publication No. 2013/0175341;
• [0143] U.S. Patent Application Publication No. 2013/0175343;
• [0144] U.S. Patent Application Publication No. 2013/0200158;
• [0145] U.S. Patent Application Publication No. 2013/0256418;
• [0146] U.S. Patent Application Publication No. 2013/0257744;
• [0147] U.S. Patent Application Publication No. 2013/0257759;
• [0148] U.S. Patent Application Publication No. 2013/0270346;
• [0149] U.S. Patent Application Publication No. 2013/0278425;
• [0150] U.S. Patent Application Publication No. 2013/0287258;
• [0151] U.S. Patent Application Publication No. 2013/0292475;
• [0152] U.S. Patent Application Publication No. 2013/0292477;
• [0153] U.S. Patent Application Publication No. 2013/0293539;
• [0154] U.S. Patent Application Publication No. 2013/0293540;
• [0155] U.S. Patent Application Publication No. 2013/0306728;
• [0156] U.S. Patent Application Publication No. 2013/0306730;
• [0157] U.S. Patent Application Publication No. 2013/0306731;
• [0158] U.S. Patent Application Publication No. 2013/0307964;
• [0159] U.S. Patent Application Publication No. 2013/0308625;
• [0160] U.S. Patent Application Publication No. 2013/0313324;
• [0161] U.S. Patent Application Publication No. 2013/0313325;
• [0162] U.S. Patent Application Publication No. 2013/0341399;
• [0163] U.S. Patent Application Publication No. 2013/0342717;
• [0164] U.S. Patent Application Publication No. 2014/0001267;
• [0165] U.S. Patent Application Publication No. 2014/0002828;
• [0166] U.S. Patent Application Publication No. 2014/0008430;
• [0167] U.S. Patent Application Publication No. 2014/0008439;
• [0168] U.S. Patent Application Publication No. 2014/0025584;
• [0169] U.S. Patent Application Publication No. 2014/0027518;
• [0170] U.S. Patent Application Publication No. 2014/0034734;
• [0171] U.S. Patent Application Publication No. 2014/0036848;
• [0172] U.S. Patent Application Publication No. 2014/0039693;
• [0173] U.S. Patent Application Publication No. 2014/0042814;
• [0174] U.S. Patent Application Publication No. 2014/0049120;
• [0175] U.S. Patent Application Publication No. 2014/0049635;
• [0176] U.S. Patent Application Publication No. 2014/0061305;
• [0177] U.S. Patent Application Publication No. 2014/0061306;
• [0178] U.S. Patent Application Publication No. 2014/0063289;
• [0179] U.S. Patent Application Publication No. 2014/0066136;
• [0180] U.S. Patent Application Publication No. 2014/0067692;
• [0181] U.S. Patent Application Publication No. 2014/0070005;
• [0182] U.S. Patent Application Publication No. 2014/0071840;
• [0183] U.S. Patent Application Publication No. 2014/0074746;
• [0184] U.S. Patent Application Publication No. 2014/0075846;
• [0185] U.S. Patent Application Publication No. 2014/0076974;
• [0186] U.S. Patent Application Publication No. 2014/0078341;
• [0187] U.S. Patent Application Publication No. 2014/0078342;
• [0188] U.S. Patent Application Publication No. 2014/0078345;
• [0189] U.S. Patent Application Publication No. 2014/0084068;
• [0190] U.S. Patent Application Publication No. 2014/0097249;
• [0191] U.S. Patent Application Publication No. 2014/0098792;
• [0192] U.S. Patent Application Publication No. 2014/0100774;
• [0193] U.S. Patent Application Publication No. 2014/0100813;
• [0194] U.S. Patent Application Publication No. 2014/0103115;
• [0195] U.S. Patent Application Publication No. 2014/0104413;
• [0196] U.S. Patent Application Publication No. 2014/0104414;
• [0197] U.S. Patent Application Publication No. 2014/0104416;
• [0198] U.S. Patent Application Publication No. 2014/0104451;
• [0199] U.S. Patent Application Publication No. 2014/0106594;
• [0200] U.S. Patent Application Publication No. 2014/0106725;
• [0201] U.S. Patent Application Publication No. 2014/0108010;
• [0202] U.S. Patent Application Publication No. 2014/0108402;
• [0203] U.S. Patent Application Publication No. 2014/0108682;
• [0204] U.S. Patent Application Publication No. 2014/0110485;
• [0205] U.S. Patent Application Publication No. 2014/0114530;
• [0206] U.S. Patent Application Publication No. 2014/0124577;
• [0207] U.S. Patent Application Publication No. 2014/0124579;
• [0208] U.S. Patent Application Publication No. 2014/0125842;
• [0209] U.S. Patent Application Publication No. 2014/0125853;
• [0210] U.S. Patent Application Publication No. 2014/0125999;
• [0211] U.S. Patent Application Publication No. 2014/0129378;
• [0212] U.S. Patent Application Publication No. 2014/0131438;
• [0213] U.S. Patent Application Publication No. 2014/0131441;
• [0214] U.S. Patent Application Publication No. 2014/0131443;
• [0215] U.S. Patent Application Publication No. 2014/0131444;
• [0216] U.S. Patent Application Publication No. 2014/0131445;
• [0217] U.S. Patent Application Publication No. 2014/0131448;
• [0218] U.S. Patent Application Publication No. 2014/0133379;
• [0219] U.S. Patent Application Publication No. 2014/0136208;
• [0220] U.S. Patent Application Publication No. 2014/0140585;
• [0221] U.S. Patent Application Publication No. 2014/0151453;
• [0222] U.S. Patent Application Publication No. 2014/0152882;
• [0223] U.S. Patent Application Publication No. 2014/0158770;
• [0224] U.S. Patent Application Publication No. 2014/0159869;
• [0225] U.S. Patent Application Publication No. 2014/0160329;
• [0226] U.S. Patent Application Publication No. 2014/0166755;
• [0227] U.S. Patent Application Publication No. 2014/0166757;
• [0228] U.S. Patent Application Publication No. 2014/0166759;
• [0229] U.S. Patent Application Publication No. 2014/0166760;
• [0230] U.S. Patent Application Publication No. 2014/0166761;
• [0231] U.S. Patent Application Publication No. 2014/0168787;
• [0232] U.S. Patent Application Publication No. 2014/0175165;
• [0233] U.S. Patent Application Publication No. 2014/0175169;
• [0234] U.S. Patent Application Publication No. 2014/0175172;
• [0235] U.S. Patent Application Publication No. 2014/0175174;
• [0236] U.S. Patent Application Publication No. 2014/0191644;
• [0237] U.S. Patent Application Publication No. 2014/0191913;
• [0238] U.S. Patent Application Publication No. 2014/0197238;
• [0239] U.S. Patent Application Publication No. 2014/0197239;
• [0240] U.S. Patent Application Publication No. 2014/0197304;
• [0241] U.S. Patent Application Publication No. 2014/0203087;
• [0242] U.S. Patent Application Publication No. 2014/0204268;
• [0243] U.S. Patent Application Publication No. 2014/0214631;
• [0244] U.S. Patent Application Publication No. 2014/0217166;
• [0245] U.S. Patent Application Publication No. 2014/0217180;
• [0246] U.S. patent application Ser. No. 13/367,978 for a Laser Scanning Module Employing An Elastomeric U-Hinge Based Laser Scanning Assembly, filed Feb. 7, 2012 (Feng et al.);
• [0247] U.S. patent application Ser. No. 29/436,337 for an Electronic Device, filed Nov. 5, 2012 (Fitch et al.);
• [0248] U.S. patent application Ser. No. 13/771,508 for an Optical Redirection Adapter, filed Feb. 20, 2013 (Anderson);
• [0249] U.S. patent application Ser. No. 13/852,097 for a System and Method for Capturing and Preserving Vehicle Event Data, filed Mar. 28, 2013 (Barker et al.);
• [0250] U.S. patent application Ser. No. 13/902,110 for a System and Method for Display of Information Using a Vehicle-Mount Computer, filed May 24, 2013 (Hollifield);
• [0251] U.S. patent application Ser. No. 13/902,144, for a System and Method for Display of Information Using a Vehicle-Mount Computer, filed May 24, 2013 (Chamberlin);
• [0252] U.S. patent application Ser. No. 13/902,242 for a System For Providing A Continuous Communication Link With A Symbol Reading Device, filed May 24, 2013 (Smith et al.);
• [0253] U.S. patent application Ser. No. 13/912,262 for a Method of Error Correction for 3D Imaging Device, filed Jun. 7, 2013 (Jovanovski et al.);
• [0254] U.S. patent application Ser. No. 13/912,702 for a System and Method for Reading Code Symbols at Long Range Using Source Power Control, filed Jun. 7, 2013 (Xian et al.);
• [0255] U.S. patent application Ser. No. 29/458,405 for an Electronic Device, filed Jun. 19, 2013 (Fitch et al.);
• [0256] U.S. patent application Ser. No. 13/922,339 for a System and Method for Reading Code Symbols Using a Variable Field of View, filed Jun. 20, 2013 (Xian et al.);
• [0257] U.S. patent application Ser. No. 13/927,398 for a Code Symbol Reading System Having Adaptive Autofocus, filed Jun. 26, 2013 (Todeschini);
• [0258] U.S. patent application Ser. No. 13/930,913 for a Mobile Device Having an Improved User Interface for Reading Code Symbols, filed Jun. 28, 2013 (Gelay et al.);
• [0259] U.S. patent application Ser. No. 29/459,620 for an Electronic Device Enclosure, filed Jul. 2, 2013 (London et al.);
• [0260] U.S. patent application Ser. No. 29/459,681 for an Electronic Device Enclosure, filed Jul. 2, 2013 (Chaney et al.);
• [0261] U.S. patent application Ser. No. 13/933,415 for an Electronic Device Case, filed Jul. 2, 2013 (London et al.);
• [0262] U.S. patent application Ser. No. 29/459,785 for a Scanner and Charging Base, filed Jul. 3, 2013 (Fitch et al.);
• [0263] U.S. patent application Ser. No. 29/459,823 for a Scanner, filed Jul. 3, 2013 (Zhou et al.);
• [0264] U.S. patent application Ser. No. 13/947,296 for a System and Method for Selectively Reading Code Symbols, filed Jul. 22, 2013 (Rueblinger et al.);
• [0265] U.S. patent application Ser. No. 13/950,544 for a Code Symbol Reading System Having Adjustable Object Detection, filed Jul. 25, 2013 (Jiang);
• [0266] U.S. patent application Ser. No. 13/961,408 for a Method for Manufacturing Laser Scanners, filed Aug. 7, 2013 (Saber et al.);
• [0267] U.S. patent application Ser. No. 14/018,729 for a Method for Operating a Laser Scanner, filed Sep. 5, 2013 (Feng et al.);
• [0268] U.S. patent application Ser. No. 14/019,616 for a Device Having Light Source to Reduce Surface Pathogens, filed Sep. 6, 2013 (Todeschini);
• [0269] U.S. patent application Ser. No. 14/023,762 for a Handheld Indicia Reader Having Locking Endcap, filed Sep. 11, 2013 (Gannon);
• [0270] U.S. patent application Ser. No. 14/035,474 for Augmented-Reality Signature Capture, filed Sep. 24, 2013 (Todeschini);
• [0271] U.S. patent application Ser. No. 29/468,118 for an Electronic Device Case, filed Sep. 26, 2013 (Oberpriller et al.);
• [0272] U.S. patent application Ser. No. 14/055,234 for Dimensioning System, filed Oct. 16, 2013 (Fletcher);
• [0273] U.S. patent application Ser. No. 14/053,314 for Indicia Reader, filed Oct. 14, 2013 (Huck);
• [0274] U.S. patent application Ser. No. 14/065,768 for Hybrid System and Method for Reading Indicia, filed Oct. 29, 2013 (Meier et al.);
• [0275] U.S. patent application Ser. No. 14/074,746 for Self-Checkout Shopping System, filed Nov. 8, 2013 (Hejl et al.);
• [0276] U.S. patent application Ser. No. 14/074,787 for Method and System for Configuring Mobile Devices via NFC Technology, filed Nov. 8, 2013 (Smith et al.);
• [0277] U.S. patent application Ser. No. 14/087,190 for Optimal Range Indicators for Bar Code Validation, filed Nov. 22, 2013 (Hejl);
• [0278] U.S. patent application Ser. No. 14/094,087 for Method and System for Communicating Information in an Digital Signal, filed Dec. 2, 2013 (Peake et al.);
• [0279] U.S. patent application Ser. No. 14/101,965 for High Dynamic-Range Indicia Reading System, filed Dec. 10, 2013 (Xian);
• [0280] U.S. patent application Ser. No. 14/150,393 for Indicia-reader Having Unitary Construction Scanner, filed Jan. 8, 2014 (Colavito et al.);
• [0281] U.S. patent application Ser. No. 14/154,207 for Laser Barcode Scanner, filed Jan. 14, 2014 (Hou et al.);
• [0282] U.S. patent application Ser. No. 14/165,980 for System and Method for Measuring Irregular Objects with a Single Camera filed Jan. 28, 2014 (Li et al.);
• [0283] U.S. patent application Ser. No. 14/166,103 for Indicia Reading Terminal Including Optical Filter filed Jan. 28, 2014 (Lu et al.);
• [0284] U.S. patent application Ser. No. 14/200,405 for Indicia Reader for Size-Limited Applications filed Mar. 7, 2014 (Feng et al.);
• [0285] U.S. patent application Ser. No. 14/231,898 for Hand-Mounted Indicia-Reading Device with Finger Motion Triggering filed Apr. 1, 2014 (Van Horn et al.);
• [0286] U.S. patent application Ser. No. 14/250,923 for Reading Apparatus Having Partial Frame Operating Mode filed Apr. 11, 2014, (Deng et al.);
• [0287] U.S. patent application Ser. No. 14/257,174 for Imaging Terminal Having Data Compression filed Apr. 21, 2014, (Barber et al.);
• [0288] U.S. patent application Ser. No. 14/257,364 for Docking System and Method Using Near Field Communication filed Apr. 21, 2014 (Showering);
• [0289] U.S. patent application Ser. No. 14/264,173 for Autofocus Lens System for Indicia Readers filed Apr. 29, 2014 (Ackley et al.);
• [0290] U.S. patent application Ser. No. 14/274,858 for Mobile Printer with Optional Battery Accessory filed May 12, 2014 (Marty et al.);
• [0291] U.S. patent application Ser. No. 14/277,337 for MULTIPURPOSE OPTICAL READER, filed May 14, 2014 (Jovanovski et al.);
• [0292] U.S. patent application Ser. No. 14/283,282 for TERMINAL HAVING ILLUMINATION AND FOCUS CONTROL filed May 21, 2014 (Liu et al.);
• [0293] U.S. patent application Ser. No. 14/300,276 for METHOD AND SYSTEM FOR CONSIDERING INFORMATION ABOUT AN EXPECTED RESPONSE WHEN PERFORMING SPEECH RECOGNITION, filed Jun. 10, 2014 (Braho et al.);
• [0294] U.S. patent application Ser. No. 14/305,153 for INDICIA READING SYSTEM EMPLOYING DIGITAL GAIN CONTROL filed Jun. 16, 2014 (Xian et al.);
• [0295] U.S. patent application Ser. No. 14/310,226 for AUTOFOCUSING OPTICAL IMAGING DEVICE filed Jun. 20, 2014 (Koziol et al.);
• [0296] U.S. patent application Ser. No. 14/327,722 for CUSTOMER FACING IMAGING SYSTEMS AND METHODS FOR OBTAINING IMAGES filed Jul. 10, 2014 (Oberpriller et al,);
• [0297] U.S. patent application Ser. No. 14/327,827 for a MOBILE-PHONE ADAPTER FOR ELECTRONIC TRANSACTIONS, filed Jul. 10, 2014 (Hejl);
• [0298] U.S. patent application Ser. No. 14/329,303 for CELL PHONE READING MODE USING IMAGE TIMER filed Jul. 11, 2014 (Coyle);
• [0299] U.S. patent application Ser. No. 14/333,588 for SYMBOL READING SYSTEM WITH INTEGRATED SCALE BASE filed Jul. 17, 2014 (Barten);
• [0300] U.S. patent application Ser. No. 14/334,934 for a SYSTEM AND METHOD FOR INDICIA VERIFICATION, filed Jul. 18, 2014 (Hejl);
• [0301] U.S. patent application Ser. No. 14/336,188 for METHOD OF AND SYSTEM FOR DETECTING OBJECT WEIGHING INTERFERENCES, Filed Jul. 21, 2014 (Amundsen et al.);
• [0302] U.S. patent application Ser. No. 14/339,708 for LASER SCANNING CODE SYMBOL READING SYSTEM, filed Jul. 24, 2014 (Xian et al.);
• [0303] U.S. patent application Ser. No. 14/340,627 for an AXIALLY REINFORCED FLEXIBLE SCAN ELEMENT, filed Jul. 25, 2014 (Reublinger et al.);
• [0304] U.S. patent application Ser. No. 14/340,716 for an OPTICAL IMAGER AND METHOD FOR CORRELATING A MEDICATION PACKAGE WITH A PATIENT, filed Jul. 25, 2014 (Ellis);
• [0305] U.S. patent application Ser. No. 14/342,544 for Imaging Based Barcode Scanner Engine with Multiple Elements Supported on a Common Printed Circuit Board filed Mar. 4, 2014 (Liu et al.);
• [0306] U.S. patent application Ser. No. 14/345,735 for Optical Indicia Reading Terminal with Combined Illumination filed Mar. 19, 2014 (Ouyang);
• [0307] U.S. patent application Ser. No. 14/336,188 for METHOD OF AND SYSTEM FOR DETECTING OBJECT WEIGHING INTERFERENCES, Filed Jul. 21, 2014 (Amundsen et al.);
• [0308] U.S. patent application Ser. No. 14/355,613 for Optical Indicia Reading Terminal with Color Image Sensor filed May 1, 2014 (Lu et al.);
• [0309] U.S. patent application Ser. No. 14/370,237 for WEB-BASED SCAN-TASK ENABLED SYSTEM AND METHOD OF AND APPARATUS FOR DEVELOPING AND DEPLOYING THE SAME ON A CLIENT-SERVER NETWORK filed Jul. 2, 2014 (Chen et al.);
• [0310] U.S. patent application Ser. No. 14/370,267 for INDUSTRIAL DESIGN FOR CONSUMER DEVICE BASED SCANNING AND MOBILITY, filed Jul. 2, 2014 (Ma et al.);
• [0311] U.S. patent application Ser. No. 14/376,472, for an ENCODED INFORMATION READING TERMINAL INCLUDING HTTP SERVER, filed Aug. 4, 2014 (Lu);
• [0312] U.S. patent application Ser. No. 14/379,057 for METHOD OF USING CAMERA SENSOR INTERFACE TO TRANSFER MULTIPLE CHANNELS OF SCAN DATA USING AN IMAGE FORMAT filed Aug. 15, 2014 (Wang et al.);
• [0313] U.S. patent application Ser. No. 14/452,697 for INTERACTIVE INDICIA READER, filed Aug. 6, 2014 (Todeschini);
• [0314] U.S. patent application Ser. No. 14/453,019 for DIMENSIONING SYSTEM WITH GUIDED ALIGNMENT, filed Aug. 6, 2014 (Li et al.);
• [0315] U.S. patent application Ser. No. 14/460,387 for APPARATUS FOR DISPLAYING BAR CODES FROM LIGHT EMITTING DISPLAY SURFACES filed Aug. 15, 2014 (Van Horn et al.);
• [0316] U.S. patent application Ser. No. 14/460,829 for ENCODED INFORMATION READING TERMINAL WITH WIRELESS PATH SELECTION CAPABILITY, filed Aug. 15, 2014 (Wang et al.);
• [0317] U.S. patent application Ser. No. 14/462,801 for MOBILE COMPUTING DEVICE WITH DATA COGNITION SOFTWARE, filed on Aug. 19, 2014 (Todeschini et al.);
• [0318] U.S. patent application Ser. No. 14/446,387 for INDICIA READING TERMINAL PROCESSING PLURALITY OF FRAMES OF IMAGE DATA RESPONSIVELY TO TRIGGER SIGNAL ACTIVATION filed Jul. 30, 2014 (Wang et al.);
• [0319] U.S. patent application Ser. No. 14/446,391 for MULTIFUNCTION POINT OF SALE APPARATUS WITH OPTICAL SIGNATURE CAPTURE filed Jul. 30, 2014 (Good et al.);
• [0320] U.S. patent application Ser. No. 29/486,759 for an Imaging Terminal, filed Apr. 2, 2014 (Oberpriller et al.);
• [0321] U.S. patent application Ser. No. 29/492,903 for an INDICIA SCANNER, filed Jun. 4, 2014 (Zhou et al.); and
• [0322] U.S. patent application Ser. No. 29/494,725 for an IN-COUNTER BARCODE SCANNER, filed Jun. 24, 2014 (Oberpriller et al.).

[0323] In the specification and/or figures, typical embodiments of the invention have been disclosed. The present invention is not limited to such exemplary embodiments. The use of the term “and/or” includes any and all combinations of one or more of the associated listed items. The figures are schematic representations and so are not necessarily drawn to scale. Unless otherwise noted, specific terms have been used in a generic and descriptive sense and not for purposes of limitation.