The invention relates to providing natural language processing, such as determining an information domain associated with a natural language input, confirming whether the domain is correctly determined or identified, and/or determining an action responsive to the natural language input.
Generally, in the context of natural language processing or understanding, before a specific action is performed in response to a natural language (NL) input, an information domain (from a plurality of pre-configured information domains) to which the NL input belongs is identified or determined (with a particular likelihood). By classifying an NL input to a particular domain, a natural language understanding (NLU) system may extract possible intent of the NL input, and identify or determine specific computer-executable actions related to that information domain, which, when executed, are responsive to the intended request in the NL input.
However, based on the complexity of the NL input and capabilities of (e.g., scope of the grammar configured for) the NLU system, the domain for the NL input may not be correctly determined. This may result in incorrect or unintended actions being executed in response to the NL input, resulting in an inefficient and unsatisfactory user experience. These and other drawbacks exist.
An NLU system may parse a received NL user input into one or more tokens according to a lexicon and a semantic grammar, and based on the tokens, may classify the NL input into one or more of many pre-configured information domains or classes (referred herein interchangeably as “information domains” or “domains”). The pre-configured domains may be defined as part of or related to the semantic grammar of the NLU system. These domains may be “action-centric,” i.e., each domain may represent a specific type of (computer-executable) task or action performed for a given NL input (e.g., “call,” “map,” “shop,” “play,” “record,” “online search,” domains, etc.). For example, NL inputs “call John Doe” and “dial John Doe's number” both may be classified as belonging to the “call” domain. Additionally, or alternatively, the pre-configured domains may be “entity-centric,” i.e., each domain may represent a specific type of entity or subject mentioned in a given NL input (e.g., “song,” “business,” “person,” etc.) for which a certain task or action is to be performed responsive to the NL input. For example, NL inputs “search John Doe's address” and “dial John Doe's number” both may be classified as belonging to the “person” domain based on recognizing “John Doe” as a person's name in the NL inputs. Accordingly, by classifying an NL input to one or more specific domains (from the action-centric and/or entity-centric domains), the NLU system may understand possible intent of the NL input, and identify or determine specific computer-executable actions related to those information domains, which, when executed, are responsive to the intended request in the NL input.
The present disclosure relates to methods, systems and other embodiments directed to determining an information domain match for a natural language (NL) input (e.g., a spoken utterance), and confirming whether the NL input is correctly matched to the determined information domain. For example, after receiving an NL input, based on a semantic pattern matching technique, the system may determine a first information domain to which the NL input belongs and a feature value set. Further, the system may determine a second information domain to which the NL input belongs, and a corresponding confidence score related to the second information domain. The second information domain may be determined based on a first statistical classification technique. Based on the determined feature value set and the confidence score related to the second information domain, the system may confirm whether the NL input correctly belongs to the first information domain, e.g., based on a second statistical classification technique.
In an implementation, the NL input is represented using one or more tokens. In this implementation, for example, to determine the first domain and the feature value set based the semantic pattern matching technique, the system may match the one or more tokens to one or more computer-executable tasks and one or more entities, based at least on a sematic grammar. The semantic grammar may be specific to the semantic pattern matching technique and may include pre-configured rules based on which an NL input (or tokens thereof) may be structured, parsed and/or understood. The one or more tasks and the one or more entities may also be a part of the semantic grammar associated with the semantic pattern matching technique.
The feature value set for the NL input generated from the semantic pattern matching may include one or more of the following: a total number of the one or more tokens matched, a fraction number of the one or more tokens matched, a matching score assigned to at least one of the one or more tokens, and a matching score assigned to the NL input.
In an implementation, the system may determine the second information domain to which the NL input belongs based on a first statistical classification technique (e.g., using a maximum-entropy classifier). To that end, the system may generate an input feature vector for the NL input, wherein each element of the input feature vector represents at least one of the one or more tokens of the NL input. The system may process such an input feature vector in accordance with the statistical classification technique to determine the second information domain and the confidence score.
In an implementation, the system may determine whether the NL input correctly belongs to the first information domain based on another statistical classification technique. For example, the system may process the feature value set (from the semantic pattern matching) and the confidence score (from the first statistical classifier) based on a second statistical classification technique. As part of such processing, the system may obtain coefficient weights associated with the second statistical classification technique for the feature value set and the confidence score, and process the feature value set and the confidence score with the coefficient weights to determine a confirmation score related to the first information domain. The system may compare the confirmation score related to the first information domain with a certain (pre-defined) threshold, and based a result of the comparison, the system may determine whether the NL input correctly belongs to the first information domain. Once the system confirms that the NL input has been correctly classified to the first information domain, the system identifies/determines and performs a specific computer-executable action from that information domain to complete the query or command mentioned in the NL input.
The techniques described herein may be applied to a wide range of natural language applications that use natural language input from a user. For example, and without limitation, applications of various methods and systems discussed herein may include natural language interfaces to computing systems, communication with robots in natural language, personalized digital assistants, question-answer query systems, and/or other natural language processing or understanding applications.
Various other aspects of the invention will be apparent through the detailed description below and the drawings attached hereto. It is also to be understood that both the foregoing general description and the following detailed description are exemplary and not restrictive of the scope of the invention. As used in the specification and in the claims, the singular form of “a”, “an”, and “the” include plural referents unless the context clearly dictates otherwise. In addition, as used in the specification and the claims, the term “or” means “and/or” unless the context clearly dictates otherwise.
In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the implementations of the invention. It will be appreciated, however, by those having skill in the art that the implementations of the invention may be practiced without these specific details or with an equivalent arrangement. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the implementations of the invention.
As an example, system 100 may include a NLU system based on a semantic pattern matching technique (or a rules-based NLU (RNLU) technique). Such RNLU system may parse a received NL user input into one or more tokens according to a lexicon and a semantic grammar, and based on the tokens, may classify the NL input into one or more of many pre-configured domains or classes. The pre-configured domains may be defined as part of or related to the semantic grammar of the RNLU system. These domains may be “action-centric,” i.e., each domain may represent a specific type of (computer-executable) task or action performed for a given NL input (e.g., “call,” “map,” “shop,” “play,” “record,” “online search,” domains, etc.). Additionally, or alternatively, the pre-configured domains may be “entity-centric,” i.e., each domain may represent a specific type of entity or subject mentioned in a given NL input (e.g., “song,” “business,” “person,” etc.) for which a certain task or action is to be performed responsive to the NL input.
As one example, system 100 may receive a spoken NL utterance input “send a text to Larry saying “I cannot call John tomorrow”.” The domains defined for the RNLU system may or may not include a domain for the action “send text” (or any other texting-related domains). However, based on criteria defined by the sematic grammar of the RNLU system (e.g., assigning the highest priority to the word “call”), the RNLU system may resolve that the NL input includes a token “call John,” and as such, the NL input belongs to the “call” domain, indicating that the user intends to (immediately) place a phone call to a contact named “John.” Accordingly, based on the erroneous assignment of the NL input to the “call” domain, system 100 may identify and/or execute an unintended or erroneous action (e.g., initiating a phone call to “John”), resulting in an inefficient and unsatisfactory user experience. In an implementation, the RNLU system also provides one or more features related to the processing of the NL input to determine its domain. Such features may include, but not limited to, a total number of the one or more tokens matched, a fraction number of the one or more tokens matched, a matching score assigned to at least one of the one or more tokens, and a matching score assigned to the NL input.
To ensure that the NL input is correctly assigned to an intended domain (and a correct and appropriate computer-executable action is determined), system 100 may employ another NLU system, e.g., a statistical classification-based NLU (SNLU) system, configured therewithin. The SNLU system may receive the same NL utterance input as the RNLU system, and process the NL input to generate an input feature vector. Each element of the input feature vector may represent at least one of the one or more tokens of the NL input. The SNLU system may process such an input feature vector in accordance with the statistical classification technique configured therein (e.g., a maximum-entropy classification technique) to determine one or more domains to which the NL input possibly belongs. The SNLU system may also generate one or more confidence scores (e.g., probability values) corresponding to the one or more determined domains, the confidence scores indicating the likelihood of the NL input belonging to the respective domains. For example, for the NL input “send a text to Larry saying “I cannot call John tomorrow”,” the SNLU system, based on the statistical classification technique thereof, may determine that the NL input belongs to (a) “send text” domain with a confidence score equal to 0.5 (out of 1), (b) “call” domain with a confidence score equal to 0.4, and (c) “set reminder” domain with a confidence score equal to 0.1.
In an implementation, system 100 may utilize and process the output of the RNLU system (e.g., the feature set) and the output of the SNLU system (e.g., the domain confidence scores) to ascertain whether the NL input correctly belongs to the domain determined by the RNLU system. For example, system 100 may include a domain-confirm system including a statistical classifier (e.g., based on a logistic classifier) that takes the feature value set from the RNLU system and the confidence scores from the SNLU system as its input, and generate a confirmation score related to the domain determined by the RNLU system. System 100 may compare the confirmation score with a certain (pre-defined) threshold, and based a result of the comparison, determines whether the NL input correctly belongs to the domain determined by the RNLU system.
For example, with regard to the foregoing example, the domain-confirm system, based on the parameters provided by the SNLU and RNLU systems, may calculate a confirmation score of 0.3 for the “call” domain determined by the RNLU system. Comparing with a fixed threshold equal to 0.5, system 100 may determine that, since the confirmation score (0.3) of the “call” domain is lower than the threshold (0.5), the NL input does not belong to the “call” domain. In other words, the result of the threshold comparison indicates that the output of the RNLU system that user utterance belongs to the “call” domain is erroneous. Accordingly, system 100 may not advance the processing of the NL input, e.g., system 100 may not prepare for or execute an action (e.g., initiating a phone call) responsive to the NL input.
In this case, system 100 may output a message to the user indicating that system 100 is not configured to complete the request indicated in the NL input and/or requesting another NL input from the user. Alternatively, system 100 may request the RNLU system to consider another domain for the original NL input (e.g., a domain that the RNLU system may have determined as less likely than the previously-determined domain) and provide new features for the other domain to the domain-confirm classifier. The domain-confirm classifier may process the new features along with the (previously-computed) confidence scores from the SNLU system to determine whether the NL input belongs to the other domain (based on the threshold comparison discussed above).
However, based on the confirmation score from the domain-confirm system, if system 100 confirms that the NL input has been correctly classified to the domain determined by the RNLU system, system 100 (or the RNLU system) identifies and performs a specific computer-executable action pre-defined for that domain to responsive to the NL input. For example, if the NL input was indeed “call John,” and it is confirmed that the RNLU system correctly identified the NL input as belonging to the “call” domain, system 100 may perform one or more computer-executable tasks to complete the user request. For example, system 100 may extract a phone number for the contact “John” from the contact information stored at a user's device, and initiate a phone call to the phone number from the user's device.
Other uses of system 100 are described herein and still others will be apparent to those having skill in the art. Having described a high level overview of some of the system functions, attention will now be turned to various system components that facilitate these and other functions.
System Components
Computer system 104 may interface with service provider(s) 140 to allow users access to services offered by service provider(s) 140, interface with content provider(s) 150 to allow users to access content offered by content provider(s) 150, and provide various interfaces to user device(s) 160 so that users may interact with computer system 104.
To facilitate these and other functions, computer system 104 may include one or more computing devices 110. Each computing device 110 may include one or more processors 112, one or more storage devices 114, one or more databases 130, one or more APIs 190 (e.g., to interface with service provider(s) 140, content provider(s) 150, user device(s) 160, etc.), and/or other components.
Processor(s) 112 may be programmed with one or more computer program instructions, which may be stored in storage device(s) 114, to perform one or more operations. The one or more computer program instructions may comprise user input processing instructions 120, domain-related instructions 131, first domain-determination instructions 132, second domain-determination instructions 134, domain-confirmation instructions 136, and/or other instructions.
In some implementations, a given user device 160 may comprise a given computer device 110. As such, the given user device 160 may comprise processor(s) 112 that are programmed with one or more computer program instructions, such as user input processing instructions 120, domain-related instructions 131, and/or other instructions. Domain-related instructions 131 may be part of user input processing instructions 120, and/or may further include first domain-determination instructions 132, second domain-determination instructions 134, domain-confirmation instructions 136, and/or other instructions.
As used hereinafter, for convenience, the foregoing instructions will be described as performing one or more operations, when, in fact, the various instructions may program processor(s) 112 (and thereafter computer system 104) to perform the operation(s).
User Input Processing Including Natural Language Processing/Understanding
In an implementation, user input processing instructions 120 may process one or more user inputs of a user to determine one or more user requests (e.g., queries or commands) that are intended by the user when the user provided the user inputs. The user inputs may comprise an auditory input (e.g., received via a microphone), a visual input (e.g., received via a camera), a tactile input (e.g., received via a touch sensor device), an olfactory input, a gustatory input, a keyboard input, a mouse input, or other user input. As described elsewhere herein, user input processing instructions 120 and/or domain-related instructions 131 may comprise instructions associated with one or more speech recognition engines (e.g., speech recognition engine(s) 220 of
In one use case, if the user input is a natural language utterance spoken by a user, the natural language utterance may be processed by a speech recognition engine to recognize one or more words of the natural language utterance. The recognized words may then be processed, along with context information associated with the user, by a NLP/NLU engine to determine and/or confirm a user request intended by the user when the user provided the natural language utterance. An example of the processing of the user request may include predicting one or more information domains that the user request may belong to (e.g., indicating a type of action needed to complete the request and/or a type of entity mentioned in the request), assigning a confidence score to each of the potential domains, selecting the domain with the highest confidence score as the domain to the user request belongs, determining or confirming whether the selected domain is the correct domain to which the user request should be assigned or classified, and if so, selecting an action or task related to the selected (and confirmed) domain to respond to the intended user request.
In an implementation, one or more components of system 200 may comprise one or more computer program instructions of
Input device(s) 210 may comprise an auditory input device (e.g., microphone), a visual input device (e.g., camera), a tactile input device (e.g., touch sensor), an olfactory input device, a gustatory input device, a keyboard, a mouse, or other input devices. Input received at input device(s) 210 may be provided to speech recognition engine(s) 220 and/or NLP/NLU engine(s) 230.
Speech recognition engine(s) 220 may process one or more inputs received from input device(s) 210 to recognize one or more words represented by the received inputs. As an example, with respect to auditory input, speech recognition engine(s) 220 may process an audio stream captured by an auditory input device to isolate segments of sound of the audio stream. The sound segments (or a representation of the sound segments) are then processed with one or more speech models (e.g., acoustic model, lexicon list, language model, etc.) to recognize one or more words of the received inputs. Upon recognition of the words of received inputs, the recognized words may then be provided to zero-pass processing engine 225, and/or NLP/NLU engine(s) 230 for further processing. In other examples, zero-pass processing engine 225, and/or NLP/NLU engine(s) 230 may process one or more other types of inputs (e.g., visual input representing sign language communication, gestures, or other forms of communication) to recognize one or more words represented by the other types of inputs.
Zero-pass Processing
Zero-pass processing engine 225 may receive one or more inputs from input device(s) 210, speech recognition engine(s) 220, application(s) 240, database(s) 130, or other components. In an implementation, operations related to processing of user input and determining suitable action by zero-pass processing engine 225 are performed before and as a faster alternative to the natural language processing by NLP/NLU engines 230. As an example, zero-pass processing engine 225 may process inputs received from input device(s) 210 or speech recognition engine(s) 220 based matching an exact phrase or text string of a user input to entries in one or more look up tables to determine an action or task responsive to the user input. The look up table(s) (or similar data structure) used by zero-pass processing engine 225 may be stored at database(s) 130, and may be pre-configured to include a listing of a number of fixed text strings or phrases, and a set of corresponding actions to be executed (e.g., in relation to application(s) 240 and output device(s) 250) to respond to the user request.
The look up tables may be generated based on a collection of user logs (anonymously) recorded over one or more certain periods of time for a plurality of users. Such user logs may include specific text strings provided (e.g., spoken) by users as inputs to system 104, and computer-executable actions that were determined and performed responsive to those specific text strings. In an implementation, if a particular and exact text string (e.g., “call mom”) is frequently found in the user logs (e.g., every nth entry in the logs), that particular text string is selected to be added to the look up table(s) with an associated set of actions responsive to the text string. For example, one of the listings of the look up table may include a text string “call mom” with the corresponding set of actions (e.g., performed using application(s) 240) including searching for a contact named “mom” in a contact information database, extracting a phone number for the contact “mom,” and initiating a phone call from a user device to the extracted phone number. In the look up table(s), many text strings may have a same set of actions associated therewith, e.g., “call mom” and “dial mother's phone” may be associated with a same set of phone call-related actions.
The look up table(s) may include one or more static look up tables, and one or more dynamic look up tables. In an implementation, the static look up tables include text string-action entries which may not be updated or modified based on user environment, context, and/or other criteria. For example, the static look up tables may include entries such as “call mom,” “watch ESPN,” “open e-mail,” etc., each of which are associated with a fixed set of actions that are performed responsive to the text string, where these text strings and their associated actions may not be modified or updated over time.
On the other hand, dynamic look up table(s) may include text string-action entries that relate to a specific location, event, context, etc. For example, based on recent user logs (e.g., collected for the past one week), it may be determined that a number of frequent user requests (having exactly same phrases) relate to a certain event. For example, user logs collected during late January/early February may indicate that many frequent user requests relate to NFL Super Bowl with exact input phrases such as “what day is the Super Bowl,” “weather for Super Bowl,” etc. Accordingly, a “Super Bowl” dynamic table may be generated with event-specific entries and corresponding sets of computer-executable actions. The dynamic look up table(s) may be updated, modified, or deleted when the underlying location, event details, context, etc., change.
In an implementation, before the user input, e.g., from speech recognition engine 220, is provided to NLP/NLU engine(s) 230, the user input is provided to zero-pass processing engine(s) 225 that accesses the look up table(s) in the database(s) 130, determines whether any entry in the look up table(s) exactly matches the text string of the user input. If a match is found, zero-pass processing engine(s) 225 extracts the set of actions associated with the matched table entry, determines application(s) 240 that may execute (or facilitate execution of) the set of actions, and provides the set of actions to the determined application(s) 240 for execution responsive to the user input. In this case, since the intended user request is addressed by zero-pass processing engine(s) 225, the user input may not be provided to NLP/NLU engine(s) 230 for any further processing. If, however, a match at the look up table(s) is not found, the user input may be provided to the NLP/NLU engine(s) 230 for further processing and execution as discussed below.
Natural Language Processing/Understanding
NLP/NLU engine(s) 230 may receive one or more inputs from input device(s) 210, speech recognition engine(s) 220, application(s) 240, database(s) 130, or other components. As an example, NLP/NLU engine(s) 230 may process inputs received from input device(s) 210, such as user inputs (e.g., voice, non-voice, etc.), location-based inputs (e.g., GPS data, cell ID, etc.), other sensor data input, or other inputs to determine context information associated with one or more user inputs. As another example, NLP/NLU engine(s) 230 may obtain grammar information, profile information, context information, or other information from database(s) 130. The obtained information (or context information determined based on inputs from input device(s) 210) may be processed to determine one or more intended user requests associated with one or more user inputs of a user. In yet another example, NLP/NLU engine(s) 230 may process one or more recognized words (“triggers”) from speech recognition engine(s) 220 and other information (e.g., information from input device(s) 210, application(s) 240, and/or database(s) 130) to determine one or more intended user requests associated with one or more user inputs of a user.
In an implementation, NLP/NLU engine(s) 230 may solicit further inputs from a user by responding with a request for more information via output device(s) 250 if, for instance, a user request associated with a user input of a user cannot be determined with sufficient confidence, more information would helpful to process the user request, etc.
An example of the processing of the user request by NLP/NLU engine(s) 230 may include the operations of predicting one or more information domains to which the user request may belong (e.g., indicating a type of action needed to complete the request and/or a type of entity mentioned in the request); assigning a confidence score to each of the potential domains; selecting the domain with the highest confidence score as the domain to the user request belongs; confirming whether the selected domain is the correct domain to which the user request should be assigned or classified; and if so, selecting an action or task related to the selected (and confirmed) domain to respond to the intended user request. To perform these and other natural language processing operations, NLP/NLU engine(s) 230 may include one or more components, e.g., as illustrated in
In an implementation, one or more components of system 300 may comprise one or more computer program instructions of
RNLU Processing
In an implementation, RNLU engine(s) 310 may employ rules-based (or grammar-based) semantic pattern matching to parse and understand a meaning and intent of an NL input (in one or more languages). For example, RNLU engine(s) 310 may parse a received NL user input into one or more tokens according to a lexicon and a semantic grammar. Based on the tokens and the semantic grammar, RNLU engine(s) 310 may classify the NL input into one or more of many pre-configured domains or classes. RNLU engine(s) 310 may also generate a score for each of the domains determined to be associated with the NL input, where the score indicates the confidence level of the NL input belonging to that domain. The grammar, lexicon, corpus, rules, agents, and other rules-based components used by RNLU engine(s) 310 may be generated and updated manually by linguistic experts or by automatic machine learning techniques, and stored at database(s) 130.
The pre-configured domains or classes may be defined as part of or related to the semantic grammar of RNLU engine(s) 310, and may be stored at database(s) 130. These domains may be “action-centric,” i.e., each domain may represent a specific type of (computer-executable) task or action performed for a given NL input (e.g., a “call” domain, a “map” domain, a “shop” domain, a “play” domain, a “record” domain, an “online search” domain, etc.). For example, the input “buy coffee” may be classified to the “shop” domain based on the recognition (by RNLU engine(s) 310) of the action term “buy”, and the input “call Jack and order pizza” may be determined as belonging to both “call” and “shop” domains based on the action terms “call” and “order,” respectively.
Additionally, or alternatively, the pre-configured domains may be “entity-centric,” i.e., each domain may represent a specific type of entity or subject mentioned in or related to a given NL input (e.g., a “song” domain, a “business” domain, a “person” domain, etc.) for which a certain task or action is to be performed responsive to the NL input. For example, the inputs “call Peter” and “meet Peter on Friday” both may be classified under the “person” domain based on the recognition (by RNLU engine(s) 310) of the term “Peter” in the inputs as a person's name. In an implementation, one or more domains may be a combination of an “action-centric” domain and an “entity-centric” domain. For example, a domain may be directed to “call business.”
In general, a domain may include a set of information that includes subject matter that may be searched or otherwise executed on. For example, a domain may include a listing of action terms (e.g., similar action terms that result in a same action or task), a listing of businesses, a listing of addresses, a listing of songs, a listing of personal contacts, and/or other corpus of information that may be searched, played or otherwise executed. An information item or listing in a domain may be associated with a keyword. For example, a listing of action terms in the “shop” domain may include terms or keywords such as “buy,” “purchase,” “pay,” etc. A listing of businesses (in the “business” domain) may include the name of a business and/or other business-related information. A listing of songs (in the “music” domain) may include a song title, artist name, genre, and/or other song-related information. The domains may be indexed to facilitate rapid searching of its content, such as its keywords.
In an implementation, the grammar or other rules-based components used RNLU engine(s) 310 may include rules to remove or ignore “non-salient” terms from the NL input without changing its meaning. For example, based on these rules, RNLU engine(s) 310 may remove “non-salient” words such as “please,” “thanks” etc., articles of prepositions, etc., from the NL input before determining a domain for the NL input. Such rules may also include ignoring morphological variations such as pluralization, etc. These rules may also specify exceptions as to specific phrase(s) or specific type(s) of phrase(s) for which the “non-salient” words should not be removed or ignored for the processing of the NL input. For example, although ignoring the word “on” in the phrase “call John on Friday” may not affect its meaning (in terms of natural language understanding), in the phrase “Turn on Madonna,” removing or ignoring “on” would render the phrase being misinterpreted or meaningless. Accordingly, specific rules and their exceptions may be written in the grammar with respect to the “non-salient” terms to improve computational efficiency.
In operation, as one example, RNLU engine(s) 310 may receive a spoken NL utterance input, e.g., “send text to Larry saying “I cannot call John tomorrow”” from speech recognition engine(s) 220 (e.g., after the zero-pass processing failed). RNLU engine(s) 310 may generate one or more tokens for the NL input based on the related lexicon and grammar. The token(s) may represent each word, each possible pair of words, and/or other combinations of words in the NL input. As such, the tokens generated by RNLU engine(s) 310 may relate to uni-grams, bi-grams, tri-grams, and/or other n-grams. For example, for the foregoing NL input, tokens may include “send,” “text,” “call,” “send text,” “call tomorrow,” “send text tomorrow,” “Larry,” “John,” “tomorrow,” etc. The tokens may be stored at database(s) 130.
RNLU engine(s) 310 may process the token(s) based on the semantic grammar to determine or identify one or more domains to which the NL input belongs. Based on the domain(s) for the NL input, RNLU engine(s) 310 may be able to identify one or more computer-executable tasks and one or more entities involved with the tasks needed to complete the intended request of the NL input. In an implementation, RNLU engine(s) 310 may identify a plurality of possible domains for the NL input, and generate and assign a confidence score (e.g., in terms of probabilities) for each of the possible domains (as an “n-best” list). For example, for the foregoing NL input, RNLU engine(s) 310 may determine and list that the NL input is associated with the “call” domain with a confidence score equal to 0.8 (out of 1), and the “send text” domain with a confidence score equal to 0.2. It may also be possible that the domains defined in relation to the semantic grammar of RNLU engine(s) 310 do not include the “send text” domain (or any other texting-related domains). RNLU engine(s) 310 may thus determine that the NL input is associated with only one domain, e.g., the “call” domain with a confidence score equal to 1.
In addition to identifying domains, RNLU engines(s) 310 may also generate parameters related to the process of domain determination/identification. For example, RNLU engines(s) 310 may generate parameters or “feature value set” including a number of tokens matched, a fraction number of the tokens matched, a matching score assigned to at least one of the tokens, and a matching score assigned to the complete NL input, and/or other parameters.
In an implementation, RNLU engine(s) 310 may determine that the NL input belongs to domain with the highest confidence score (however, other criteria may be used). As such, in this case, RNLU engine(s) 310 may determine that the NL input belongs to the “call” domain, e.g., indicating that the user intends to (immediately) place a phone call to a contact named “John.” Given the NL input, such interpretation is obviously incorrect, as the user intends to send a text message to Larry (and the correct domain should be the “send text” domain), and not call John. Accordingly, based on the erroneous assignment of the NL input to the “call” domain, RNLU engine(s) 310 may identify and/or execute an unintended or erroneous action (e.g., initiating a phone call to “John”), resulting in an inefficient and unsatisfactory user experience.
SNLU Processing
Accordingly, to ensure that the NL input is correctly assigned to an intended domain (and a correct and appropriate computer-executable action is determined and performed), NLP/NLU engine(s) 230 may employ another NLU system, e.g., SNLU engine(s) 320. SNLU engine(s) 320 may receive the same NL input as the RNLU system (“send text to Larry saying “I cannot call John tomorrow””). SNLU engine(s) 320 process the NL input based on a machine learning classification technique and associated training data (stored at database(s) 130, for example) to determine the NL input's domain(s).
The machine learning classification technique used by SNLU engine(s) 320 may be based on one or more of a maximum-entropy classifier, a logistic regression classifier, a Naïve Bayes classifier, a support vector machine, and/or other classifiers known in the art. The training data used by SNLU engine(s) 320 may be pre-established and static for the classification technique used therein, and/or may be dynamically updated based on information obtained from the NL input. In an implementation, the training data includes a pool of words, known domains or classes for the pool of words, and various probabilities and statistics associated with the words and their domains. Before processing the unknown (and real-time) inputs, the machine learning classification technique is first trained to classify the words from the training data pool. Once satisfactorily trained, SNLU engine(s) 320 may then accept the NL input, e.g., as above, to determine its domains.
SNLU engine(s) 320 may obtain tokens of the NL input described above (e.g., from database(s) 130 or RNLU engine(s) 310) and generate an input feature vector. Each element of the input feature vector may represent at least one of the tokens of the NL input. SNLU engine(s) 320 may the feature vector as the input to the statistical classification technique configured therein (e.g., a maximum-entropy classification technique), and determine one or more domains to which the NL input possibly belongs. SNLU engine(s) 320 may also generate one or more confidence scores (e.g., probability values) corresponding to the one or more determined domains, the confidence scores indicating the likelihood of the NL input belonging to the respective domains.
For example, for the foregoing NL input, SNLU engine(s) 320, based on the statistical classification technique thereof, may classify the NL input to (a) “send text” domain with a confidence score equal to 0.5 (out of 1), (b) “call” domain with a confidence score equal to 0.4, and (c) “set reminder” domain with a confidence score equal to 0.1. In an implementation, SNLU engine(s) 320 may also generate a parameter value (e.g., a binary value) indicative of whether the domains determined by SNLU engine(s) 320 are related to the domains specified for and associated with RNLU engine(s) 310 (or its semantic pattern matching technique).
Confirming Domain Correctness
In an implementation, NLP/NLU engine(s) 230 may utilize and process the outputs of RNLU engine(s) 310 and SNLU engine(s) 320 to ascertain whether the NL input correctly belongs to the domain determined by RNLU engine(s) 310. For example, NLP/NLU engine(s) 230 may include a classifier engine(s) 330 including a statistical classifier (e.g., a logistic classifier). Classifier engine(s) 330 may accept, as its input, identification information and confidence score(s) of the domain(s) determined by RNLU engine(s) 310, the feature value set from RNLU engine(s) 310, identification information and confidence score(s) of the domain(s) determined by SNLU engine(s) 320, the binary value from SNLU engine(s) 320, and/or other RNLU and SNLU-related parameters.
Classifier engine(s) 330 may arrange the inputs as a feature vector for the classification technique implemented therein, and obtain training data (e.g., trained weight values) from database(s) 130. In an implementation, classifier engine(s) 330 may process the input feature vector based on the weight values to generate a confirmation score related to the domain determined by RNLU engine(s) 310 (e.g., “call” domain in the above example). Classifier engine(s) 330 may compare the confirmation score with a certain (pre-defined) threshold, and based a result of the comparison, determine whether the NL input correctly belongs to the domain determined by RNLU engine(s) 310 (“call” domain).
For example, with regard to the foregoing example, classifier engine(s) 330, based on the parameters provided by the SNLU and RNLU systems, may calculate a confirmation score of 0.3 for the “call” domain. Comparing with a fixed threshold of 0.5, classifier engine(s) 330 may conclude that, since the confirmation score (0.3) of the “call” domain is lower than the threshold (0.5), the NL input does not belong to the “call” domain. In other words, the result of the threshold comparison indicates that the assessment of RNLU engine(s) 310 that user utterance belongs to the “call” domain is erroneous. Accordingly, NLP/NLU engine(s) 230 may not advance the processing of the NL input, e.g., NLP/NLU engine(s) 230 may not prepare for or execute an action (e.g., initiating a phone call) responsive to the NL input.
In this case, classifier engine(s) 330 or NLP/NLU engine(s) 230 may output a message to the user indicating that computer system 104 is not configured to complete the request indicated in the NL input and/or requesting another NL input from the user. Alternatively, NLP/NLU engine(s) 230 may request RNLU engine(s) 310 to consider another domain for the original NL input (e.g., “send text” domain that RNLU engine(s) 310 determined to be less likely than “call” domain). In that case, RNLU engine(s) 310 may provide a new feature value set (as discussed above) for “send text” domain. Classifier engine(s) 330 may process the new outputs from RNLU engine(s) 310 along with the (previously-computed) outputs from SNLU engine(s) 320 to determine whether the NL input belongs to “send text” domain (based on the threshold comparison discussed above).
Once classifier engine(s) 330 confirms that the NL input has been correctly classified to the domain determined by RNLU engine(s) 310, RNLU engine(s) 310 may identify and trigger execution of one or more (pre-defined) actions or applications 240 responsive to the NL input. In an implementation, upon determination of the intended domain and requested task in the NL input, NLP/NLU engine(s) 230 may determine an application 240 suitable for executing the requested task, and provide the task to the application for further processing. In one scenario, application 240 may provide one or more results of the execution and/or completion of the task to output device(s) 250 for presentation to the user.
In an implementation, application 240 may provide the results of the task to NLP/NLU engine(s) 230 for further processing. As an example, the results of the task may comprise intermediate results that are provided as a parameter for another task that is to be executed at another application 240. As such, the NLP/NLU engine(s) 230 may generate the other task based on the intermediate results, and provide the other task to the other application 240. As another example, NLP/NLU engine(s) 230 may formulate a natural language response (e.g., a phrase) based on the results received from the application 240, and provide the natural language response to output device(s) 250 for presentation to the user.
In an implementation, a given application 240 may obtain profile information, account information, or other information from database(s) 130 to authenticate a user before executing a user request in an NL input. As an example, application 240 may be part of a given service provider. As such, the application 240 may determine whether the user has access to one or more services associated with the application 240 before executing the user request on behalf of the user.
In an implementation, a given application 240 may obtain content from database(s) 130 and/or content provider(s) 160 to provide one or more results of a user request of a user. In one use case, where the user request comprises a command to play a media item (e.g., song, video clip, movie, etc.), and the application 240 comprises a media stream application, the application 240 may obtain the media item from a given content provider(s) 160 and stream the media item to output device(s) 250 for presentation to the user.
Unsupported Feature Handling
In an implementation, although NLP/NLU engine(s) 230 may be able to determine and/or confirm the domain for the NL input (i.e., understand the intent and/or requested task of the NL input), NLP/NLU engine(s) 230 or other components of system 200 may not be configured to execute the intended task and generate an appropriate response for the user. For example, as illustrated in a screenshot 800 of
In this regard, because the system understands the user request but cannot execute it, the system (e.g., an application 240 to handle such “unsupported requests”) may provide a response to the user indicating that the service or feature requested by the user is not supported by the system. For example, as depicted, a personal assistant response “I understand your request for Seattle's weather for next week, but I am sorry, I am only capable of giving you weather information for San Jose” may be displayed at the user interface in response to the user request. As such, the user would know about the system's limitations, and may not repeat the request under the assumption that the system did not understand the request the first time.
In an implementation, NLP/NLU engine(s) 230, application(s) 240, or other components may store information in database(s) 130 for later use by NLP/NLU engine(s) 230, application(s) 240, or other components. As an example, NLP/NLU engine(s) 230 may store information regarding user inputs in database(s) 130 and/or update profile information, grammar information, training data for engine(s) 320, 330, or other information in database(s) 130 based on the information regarding the user inputs.
Hybrid NLP/NLU Processing
As discussed above, RNLU engine(s) 310, SNLU engine(s) 320 and/or other NLP/NLU engines may determine a plurality of domains to which an NL input likely belongs, and their corresponding confidence scores indicating the likelihood with which the NL input is related to the respective domain. The domains and confidence scores may be determined based on rules, grammar, context information, etc., associated with the NLP/NLU engines. In an implementation, NLP/NLU engine(s) 230 may be configured with a hybrid NLP/NLU technique in which the domains and confidence scores from RNLU engine(s) 310 and/or SNLU engine(s) 320 are improved or updated based on information from a database or search engine service. For example,
As shown in
Further, the NL input may also be provided to database service 920, which may be a third-party search engine (e.g., Google) or a service/application to search information from database(s) 130, and/or other similar services. In an implementation, database service 920 takes the NL input as a search query, and generates search results relevant to the search query. Database service 920 may parse and process the search results to classify the search results into one or more predefined categories. Further, database service 920 may rank the search results (or their categories) and assign them a ranking score. For instance, considering the above example, database service 920 may perform a search for the input “find details about beatles,” and generate results (e.g., links to websites) mostly related to the band “The Beatles,” but also some results related to the insect “beetle,” the car “Volkswagen Beetle,” etc. Based on the number of results obtained in each category (and/or other criteria), database service 920 may assign the highest ranking score to the band-related results (e.g., rank score equal to 10), second highest ranking score to the insect-related results (e.g., rank score equal to 7), third highest ranking score to the car-related results (e.g., rank score equal to 6), and so on.
In an implementation, the RNLU/SNLU engines may provide the domain information and domain confidence score(s) to domain refinement engine(s) 930 (as shown by directional flow 940). Also, database service 920 may provide the result categories information and ranking scores to domain refinement engine(s) 930 (as shown by directional flow 950) for further refinement or strengthening of the determination of the intended domain. For example, domain refinement engine(s) 930 may consider and process the domain confidence score set and the ranking score set to determine whether the domain decided upon by RNLU engine(s) 310/SNLU engine(s) 320 is correct, and generate an output value (e.g., a binary value) to indicate the determination result. Additionally, or alternatively, based on ranking score set, the domain refinement engine(s) 930 may generate its own preference order of the domains with corresponding refinement scores. For example, based on ranking score set of [band=10, insect=7, car=6], domain refinement engine(s) 930 may update the domain set from RNLU/SNLU engines [music=0.3, living organism=0.5, car-0.2] to indicate that, instead of the “living organism” domain, the NL input most likely belongs to the “music” domain. Accordingly, domain refinement engine(s) 930 may generate a domain refinement score set of [music=0.6, living organism=0.25, car-0.15].
In an implementation, domain refinement engine(s) 930 may provide the domain refinement score set to the RNLU/SNLU engines (as shown by directional flow 960). RNLU 310/SNLU 320 engines may select the domain that has the highest score in the domain refinement score set, e.g., the “music” domain (instead of the “living organism” domain) in this example. Accordingly, based on the information from domain refinement engine(s) 930, RNLU 310/SNLU 320 engines are able to confirm or update the initially-determined domain, which may result in accurately assessing the intent and request action in the NL input.
In an implementation, upon determination of the intended domain and requested task in the NL input, NLP/NLU engine(s) 230 (or its RNLU/SNLU engines) may determine an application 240 suitable for executing the requested task, and provide the task to the application for further processing. In one scenario, application 240 may provide one or more results of the execution and/or completion of the task to output device(s) 250 for presentation to the user.
Examples of System Architectures and Configurations
Different system architectures may be used. For example, all or a portion of instructions 120, 131, 132, 134, 136 (or other instructions described herein) may be executed on a user device. In other words, computing device 110 as illustrated may include a user device operated by the user. In implementations where all or a portion of instructions 120, 131, 132, 134, 136 are executed on the user device, the user device may interface with database(s) 130, service provider(s) 140 and/or content provider(s) 150 to retrieve information, determine a context, domain and intended task in an NL input, and/or perform other functions/operations of instructions 120, 131, 132, 134, 136.
As another example, all or a portion of instructions 120, 131, 132, 134, 136 (or other instructions described herein) may be executed on a server device. In other words, computing device 110 as illustrated may include a server device that obtains a user input from a user device operated by the user. In implementations where all or a portion of instructions 120, 131, 132, 134, 136 are executed on the server device, the server may interface with database(s) 130, service provider(s) 140 and/or content provider(s) 150 to retrieve information, determine a context, domain and intended task in an NL input, and/or perform other functions/operations of instructions 120, 131, 132, 134, 136.
Although illustrated in
It should be appreciated that although the various instructions are illustrated in
The description of the functionality provided by the different instructions described herein is for illustrative purposes, and is not intended to be limiting, as any of instructions may provide more or less functionality than is described. For example, one or more of the instructions may be eliminated, and some or all of its functionality may be provided by other ones of the instructions. As another example, processor(s) 112 may be programmed by one or more additional instructions that may perform some or all of the functionality attributed herein to one of the instructions.
The various instructions described herein may be stored in a storage device 114, which may comprise random access memory (RAM), read only memory (ROM), and/or other memory. The storage device may store the computer program instructions (e.g., the aforementioned instructions) to be executed by processor(s) 112 as well as data that may be manipulated by processor(s) 112. The storage device may comprise floppy disks, hard disks, optical disks, tapes, or other storage media for storing computer-executable instructions and/or data.
The various components illustrated in
User device(s) may include a device that can interact with computer system 104 through network 102. Such user device(s) may include, without limitation, a tablet computing device, a smartphone, a laptop computing device, a desktop computing device, a network-enabled appliance such as a “Smart” television, a vehicle computing device, and/or other device that may interact with computer system 104.
The various databases 130 described herein may be, include, or interface to, for example, an Oracle™ relational database sold commercially by Oracle Corporation. Other databases, such as Informix™, DB2 (Database 2) or other data storage, including file-based (e.g., comma or tab separated files), or query formats, platforms, or resources such as OLAP (On Line Analytical Processing), SQL (Structured Query Language), a SAN (storage area network), Microsoft Access™, MySQL, PostgreSQL, HSpace, Apache Cassandra, MongoDB, Apache CouchDB™, or others may also be used, incorporated, or accessed. The database may comprise one or more such databases that reside in one or more physical devices and in one or more physical locations. The database may store a plurality of types of data and/or files and associated data or file descriptions, administrative information, or any other data. The database(s) 130 may be stored in storage device 114 and/or other storage that is accessible to computer system 104.
Example Flow Diagrams
The following flow diagrams describe operations that may be accomplished using some or all of the system components described in detail above and, in some implementations, various operations may be performed in different sequences and various operations may be omitted. Additional operations may be performed along with some or all of the operations shown in the depicted flow diagrams. One or more operations may be performed simultaneously. Accordingly, the operations as illustrated (and described in greater detail below) are exemplary by nature and, as such, should not be viewed as limiting.
Referring to
For example, with regard to an operation 404, if it is determined that the word(s) or phrase(s) in the NL input match exactly with an entry in the look up table(s) (i.e., output “YES”), the corresponding action(s) listed in the look up table for that entry is identified. In an operation 405, one or more applications 240 that may be used to perform the identified action are identified and triggered. In an operation 406, based on the execution of the appropriate application(s) 240, a response to the NL input is provided to the user.
Still with regard to an operation 404, if it is determined that the word(s) or phrase(s) in the NL input do not match exactly with any entry in the look up table(s) (i.e., output “NO”), the process flow is directed to processing the NL input based on natural language processing/understanding techniques, e.g., provided by NLP/NLU engine(s) 230. For example, in an operation 407, the NL input is processed at NLP/NLU engine(s) 230 to determine a domain to which the NL input belongs, and thus understand the intent and request action for the NL input.
Upon determining the intended action for the NL input, in operation 405, one or more applications 240 that may be used to perform the identified action are identified and triggered. In an operation 406, based on the execution of the appropriate application(s) 240, a response to the NL input is provided to the user.
In an operation 502, one or more tokens for the NL input may be generated. Each of the tokens may correspond to each word or each combination of the words of the NL input. In an operation 503, based on a rules-based semantic pattern matching technique (configured at RNLU engine(s) 310), a first domain (and a corresponding confidence score) to which the NL input belongs may be determined. A feature value set (e.g., number of tokens matched, etc.) associated with the processing the NL input (at engine(s) 310) may also be determined. For example, the tokens are matched to one or more computer-executable tasks and one or more entities, based at least on a sematic grammar. The semantic grammar may be specific to the semantic pattern matching technique used at RNLU engine(s) 310, and may include pre-configured rules based on which an NL input (or tokens thereof) may be structured, parsed and/or understood. The one or more tasks and the one or more entities may also be a part of the semantic grammar associated with the semantic pattern matching technique.
Further, in an operation 504, one or more second domains to which the NL input belongs and corresponding confidence scores may be determined, e.g., based a statistic classification technique (e.g., using a maximum-entropy classifier) configured at SNLU engine(s) 320. To that end, an input feature vector for the NL input may be generated, wherein each element of the input feature vector represents at least one of the one or more tokens of the NL input. The input feature vector may be processed in accordance with the statistic classification technique to determine the second domain(s) and the corresponding confidence score(s).
In an operation 505, based at least on the determined feature value set (from 503) and the confidence score related to the second domain (from 504), it may be confirmed whether the NL input correctly belongs to the first domain (determined at 503). The confirmation aspect at operation 505 may be executed based on another statistic classification technique.
In an operation 602, trained coefficient weight values associated with the second statistical classification technique (e.g., based on logistic regression classifier) may be obtained, e.g., from database(s) 130. In an operation 603, at least the received feature value set and the confidence scores may be processed based on the coefficient weight values to determine a confirmation score related to the first domain.
In an operation 604, the confirmation score related to the first domain may be compared with a certain (pre-defined) threshold, and based a result of the comparison (e.g., the confirmation score being higher, lower or equal to the threshold), it may be determined whether the NL input correctly belongs to the first domain. For example, if the confirmation score is greater than the threshold, the NL input is determined to be correctly assigned to the first domain. Once the NL input has been determined to be correctly classified to the first domain, appropriate application(s) 240 are triggered to complete the request action (query or command) of the NL input, and provide a suitable response to the user.
In an operation 1002, based on a rules-based semantic pattern matching technique (configured at RNLU engine(s) 310) and/or a statistical classification technique (configured at SNLU engine(s) 320), one or more domains and a corresponding confidence score set for the NL input belongs is determined.
Further, in an operation 1003, the NL input is processed by database service 920 as a search query, and search results relevant to the NL input are generated. Search results may be ranked, and are assigned ranking scores (e.g., for each search result or each category of search results).
In an operation 1004, the domain confidence scores and the search results ranking scores are processed, e.g., by domain refinement engine(s) 930, to determine whether the domain decided upon by RNLU engine(s) 310/SNLU engine(s) 320 is correct, and generate a binary value to indicate that determination, and generate a refinement score set for each of the considered domains.
In an operation 1005, the domain that has the highest score in the refinement score set is selected as the final domain for the NL input, and the requested action or task and appropriate application to execute the task are determined.
Other implementations, uses and advantages of the invention will be apparent to those skilled in the art from consideration of the specification and practice of the present disclosure. The specification should be considered exemplary only, and the scope of the invention is accordingly intended to be limited only by the following claims.
This application claims the benefit of U.S. Provisional Patent Application Ser. No. 62/085,029 filed Nov. 26, 2014 entitled “System and Method of Determining a Domain and/or an Action Related to a Natural Language Input,” the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
4430669 | Cheung | Feb 1984 | A |
4821027 | Mallory | Apr 1989 | A |
4829423 | Tennant | May 1989 | A |
4887212 | Zamora | Dec 1989 | A |
4910784 | Doddington | Mar 1990 | A |
5027406 | Roberts | Jun 1991 | A |
5155743 | Jacobs | Oct 1992 | A |
5164904 | Sumner | Nov 1992 | A |
5208748 | Flores | May 1993 | A |
5265065 | Turtle | Nov 1993 | A |
5274560 | LaRue | Dec 1993 | A |
5331554 | Graham | Jul 1994 | A |
5357596 | Takebayashi | Oct 1994 | A |
5369575 | Lamberti | Nov 1994 | A |
5377350 | Skinner | Dec 1994 | A |
5386556 | Hedin | Jan 1995 | A |
5424947 | Nagao | Jun 1995 | A |
5471318 | Ahuja | Nov 1995 | A |
5475733 | Eisdorfer | Dec 1995 | A |
5479563 | Yamaguchi | Dec 1995 | A |
5488652 | Bielby | Jan 1996 | A |
5499289 | Bruno | Mar 1996 | A |
5500920 | Kupiec | Mar 1996 | A |
5517560 | Greenspan | May 1996 | A |
5533108 | Harris | Jul 1996 | A |
5537436 | Bottoms | Jul 1996 | A |
5539744 | Chu | Jul 1996 | A |
5557667 | Bruno | Sep 1996 | A |
5559864 | Kennedy, Jr. | Sep 1996 | A |
5563937 | Bruno | Oct 1996 | A |
5577165 | Takebayashi | Nov 1996 | A |
5590039 | Ikeda | Dec 1996 | A |
5608635 | Tamai | Mar 1997 | A |
5615296 | Stanford | Mar 1997 | A |
5617407 | Bareis | Apr 1997 | A |
5633922 | August | May 1997 | A |
5634086 | Rtischev | May 1997 | A |
5652570 | Lepkofker | Jul 1997 | A |
5675629 | Raffel | Oct 1997 | A |
5696965 | Dedrick | Dec 1997 | A |
5708422 | Blonder | Jan 1998 | A |
5721938 | Stuckey | Feb 1998 | A |
5722084 | Chakrin | Feb 1998 | A |
5740256 | CastelloDaCosta | Apr 1998 | A |
5742763 | Jones | Apr 1998 | A |
5748841 | Morin | May 1998 | A |
5748974 | Johnson | May 1998 | A |
5752052 | Richardson | May 1998 | A |
5754784 | Garland | May 1998 | A |
5761631 | Nasukawa | Jun 1998 | A |
5774841 | Salazar | Jun 1998 | A |
5774859 | Houser | Jun 1998 | A |
5794050 | Dahlgren | Aug 1998 | A |
5794196 | Yegnanarayanan | Aug 1998 | A |
5797112 | Komatsu | Aug 1998 | A |
5799276 | Komissarchik | Aug 1998 | A |
5802510 | Jones | Sep 1998 | A |
5829000 | Huang | Oct 1998 | A |
5832221 | Jones | Nov 1998 | A |
5839107 | Gupta | Nov 1998 | A |
5848396 | Gerace | Dec 1998 | A |
5855000 | Waibel | Dec 1998 | A |
5867817 | Catallo | Feb 1999 | A |
5878385 | Bralich | Mar 1999 | A |
5878386 | Coughlin | Mar 1999 | A |
5892813 | Morin | Apr 1999 | A |
5892900 | Ginter | Apr 1999 | A |
5895464 | Bhandari | Apr 1999 | A |
5895466 | Goldberg | Apr 1999 | A |
5897613 | Chan | Apr 1999 | A |
5899991 | Karch | May 1999 | A |
5902347 | Backman | May 1999 | A |
5911120 | Jarett | Jun 1999 | A |
5918222 | Fukui | Jun 1999 | A |
5926784 | Richardson | Jul 1999 | A |
5933822 | Braden-Harder | Aug 1999 | A |
5950167 | Yaker | Sep 1999 | A |
5953393 | Culbreth | Sep 1999 | A |
5960384 | Brash | Sep 1999 | A |
5960397 | Rahim | Sep 1999 | A |
5960399 | Barclay | Sep 1999 | A |
5960447 | Holt | Sep 1999 | A |
5963894 | Richardson | Oct 1999 | A |
5963940 | Liddy | Oct 1999 | A |
5983190 | Trower, II | Nov 1999 | A |
5987404 | DellaPietra | Nov 1999 | A |
5991721 | Asano | Nov 1999 | A |
5995119 | Cosatto | Nov 1999 | A |
5995928 | Nguyen | Nov 1999 | A |
5995943 | Bull | Nov 1999 | A |
6009382 | Martino | Dec 1999 | A |
6014559 | Amin | Jan 2000 | A |
6018708 | Dahan | Jan 2000 | A |
6021384 | Gorin | Feb 2000 | A |
6028514 | Lemelson | Feb 2000 | A |
6035267 | Watanabe | Mar 2000 | A |
6044347 | Abella | Mar 2000 | A |
6049602 | Foladare | Apr 2000 | A |
6049607 | Marash | Apr 2000 | A |
6058187 | Chen | May 2000 | A |
6067513 | Ishimitsu | May 2000 | A |
6073098 | Buchsbaum | Jun 2000 | A |
6076059 | Glickman | Jun 2000 | A |
6078886 | Dragosh | Jun 2000 | A |
6081774 | deHita | Jun 2000 | A |
6085186 | Christianson | Jul 2000 | A |
6101241 | Boyce | Aug 2000 | A |
6108631 | Ruhl | Aug 2000 | A |
6119087 | Kuhn | Sep 2000 | A |
6119101 | Peckover | Sep 2000 | A |
6122613 | Baker | Sep 2000 | A |
6134235 | Goldman | Oct 2000 | A |
6144667 | Doshi | Nov 2000 | A |
6144938 | Surace | Nov 2000 | A |
6154526 | Dahlke | Nov 2000 | A |
6160883 | Jackson | Dec 2000 | A |
6167377 | Gillick | Dec 2000 | A |
6173266 | Marx | Jan 2001 | B1 |
6173279 | Levin | Jan 2001 | B1 |
6175858 | Bulfer | Jan 2001 | B1 |
6185535 | Hedin | Feb 2001 | B1 |
6188982 | Chiang | Feb 2001 | B1 |
6192110 | Abella | Feb 2001 | B1 |
6192338 | Haszto | Feb 2001 | B1 |
6195634 | Dudemaine | Feb 2001 | B1 |
6195651 | Handel | Feb 2001 | B1 |
6199043 | Happ | Mar 2001 | B1 |
6208964 | Sabourin | Mar 2001 | B1 |
6208972 | Grant | Mar 2001 | B1 |
6219346 | Maxemchuk | Apr 2001 | B1 |
6219643 | Cohen | Apr 2001 | B1 |
6219645 | Byers | Apr 2001 | B1 |
6226612 | Srenger | May 2001 | B1 |
6233556 | Teunen | May 2001 | B1 |
6233559 | Balakrishnan | May 2001 | B1 |
6233561 | Junqua | May 2001 | B1 |
6236968 | Kanevsky | May 2001 | B1 |
6243679 | Mohri | Jun 2001 | B1 |
6246981 | Papineni | Jun 2001 | B1 |
6246990 | Happ | Jun 2001 | B1 |
6266636 | Kosaka | Jul 2001 | B1 |
6269336 | Ladd | Jul 2001 | B1 |
6272455 | Hoshen | Aug 2001 | B1 |
6272461 | Meredith | Aug 2001 | B1 |
6275231 | Obradovich | Aug 2001 | B1 |
6278377 | DeLine | Aug 2001 | B1 |
6278968 | Franz | Aug 2001 | B1 |
6286002 | Axaopoulos | Sep 2001 | B1 |
6288319 | Catona | Sep 2001 | B1 |
6292767 | Jackson | Sep 2001 | B1 |
6301560 | Masters | Oct 2001 | B1 |
6308151 | Smith | Oct 2001 | B1 |
6311159 | VanTichelen | Oct 2001 | B1 |
6314402 | Monaco | Nov 2001 | B1 |
6321196 | Franceschi | Nov 2001 | B1 |
6356869 | Chapados | Mar 2002 | B1 |
6362748 | Huang | Mar 2002 | B1 |
6366882 | Bijl | Apr 2002 | B1 |
6366886 | Dragosh | Apr 2002 | B1 |
6374214 | Friedland | Apr 2002 | B1 |
6374226 | Hunt | Apr 2002 | B1 |
6377913 | Coffman | Apr 2002 | B1 |
6381535 | Durocher | Apr 2002 | B1 |
6385596 | Wiser | May 2002 | B1 |
6385646 | Brown | May 2002 | B1 |
6389398 | Lustgarten | May 2002 | B1 |
6393403 | Majaniemi | May 2002 | B1 |
6393428 | Miller | May 2002 | B1 |
6397181 | Li | May 2002 | B1 |
6404878 | Jackson | Jun 2002 | B1 |
6405170 | Phillips | Jun 2002 | B1 |
6408272 | White | Jun 2002 | B1 |
6411810 | Maxemchuk | Jun 2002 | B1 |
6411893 | Ruhl | Jun 2002 | B2 |
6415257 | Junqua | Jul 2002 | B1 |
6418210 | Sayko | Jul 2002 | B1 |
6420975 | DeLine | Jul 2002 | B1 |
6429813 | Feigen | Aug 2002 | B2 |
6430285 | Bauer | Aug 2002 | B1 |
6430531 | Polish | Aug 2002 | B1 |
6434523 | Monaco | Aug 2002 | B1 |
6434524 | Weber | Aug 2002 | B1 |
6434529 | Walker | Aug 2002 | B1 |
6442522 | Carberry | Aug 2002 | B1 |
6446114 | Bulfer | Sep 2002 | B1 |
6453153 | Bowker | Sep 2002 | B1 |
6453292 | Ramaswamy | Sep 2002 | B2 |
6456711 | Cheung | Sep 2002 | B1 |
6456974 | Baker | Sep 2002 | B1 |
6466654 | Cooper | Oct 2002 | B1 |
6466899 | Yano | Oct 2002 | B1 |
6470315 | Netsch | Oct 2002 | B1 |
6487494 | Odinak | Nov 2002 | B2 |
6487495 | Gale | Nov 2002 | B1 |
6498797 | Anerousis | Dec 2002 | B1 |
6499013 | Weber | Dec 2002 | B1 |
6501833 | Phillips | Dec 2002 | B2 |
6501834 | Milewski | Dec 2002 | B1 |
6505155 | Vanbuskirk | Jan 2003 | B1 |
6510417 | Woods | Jan 2003 | B1 |
6513006 | Howard | Jan 2003 | B2 |
6522746 | Marchok | Feb 2003 | B1 |
6523061 | Halverson | Feb 2003 | B1 |
6532444 | Weber | Mar 2003 | B1 |
6539348 | Bond | Mar 2003 | B1 |
6549629 | Finn | Apr 2003 | B2 |
6553372 | Brassell | Apr 2003 | B1 |
6556970 | Sasaki | Apr 2003 | B1 |
6556973 | Lewin | Apr 2003 | B1 |
6560576 | Cohen | May 2003 | B1 |
6560590 | Shwe | May 2003 | B1 |
6567778 | ChaoChang | May 2003 | B1 |
6567797 | Schuetze | May 2003 | B1 |
6567805 | Johnson | May 2003 | B1 |
6570555 | Prevost | May 2003 | B1 |
6570964 | Murveit | May 2003 | B1 |
6571279 | Herz | May 2003 | B1 |
6574597 | Mohri | Jun 2003 | B1 |
6574624 | Johnson | Jun 2003 | B1 |
6578022 | Foulger | Jun 2003 | B1 |
6581103 | Dengler | Jun 2003 | B1 |
6584439 | Geilhufe | Jun 2003 | B1 |
6587858 | Strazza | Jul 2003 | B1 |
6591185 | Polidi | Jul 2003 | B1 |
6591239 | McCall | Jul 2003 | B1 |
6594257 | Doshi | Jul 2003 | B1 |
6594367 | Marash | Jul 2003 | B1 |
6598018 | Junqua | Jul 2003 | B1 |
6601026 | Appelt | Jul 2003 | B2 |
6601029 | Pickering | Jul 2003 | B1 |
6604075 | Brown | Aug 2003 | B1 |
6604077 | Dragosh | Aug 2003 | B2 |
6606598 | Holthouse | Aug 2003 | B1 |
6611692 | Raffel | Aug 2003 | B2 |
6614773 | Maxemchuk | Sep 2003 | B1 |
6615172 | Bennett | Sep 2003 | B1 |
6622119 | Ramaswamy | Sep 2003 | B1 |
6629066 | Jackson | Sep 2003 | B1 |
6631346 | Karaorman | Oct 2003 | B1 |
6631351 | Ramachandran | Oct 2003 | B1 |
6633846 | Bennett | Oct 2003 | B1 |
6636790 | Lightner | Oct 2003 | B1 |
6643620 | Contolini | Nov 2003 | B1 |
6647363 | Claassen | Nov 2003 | B2 |
6650747 | Bala | Nov 2003 | B1 |
6658388 | Kleindienst | Dec 2003 | B1 |
6678680 | Woo | Jan 2004 | B1 |
6681206 | Gorin | Jan 2004 | B1 |
6691151 | Cheyer | Feb 2004 | B1 |
6701294 | Ball | Mar 2004 | B1 |
6704396 | Parolkar | Mar 2004 | B2 |
6704576 | Brachman | Mar 2004 | B1 |
6704708 | Pickering | Mar 2004 | B1 |
6707421 | Drury | Mar 2004 | B1 |
6708150 | Hirayama | Mar 2004 | B1 |
6721001 | Berstis | Apr 2004 | B1 |
6721633 | Funk | Apr 2004 | B2 |
6721706 | Strubbe | Apr 2004 | B1 |
6726636 | DerGhazarian | Apr 2004 | B2 |
6732088 | Glance | May 2004 | B1 |
6735592 | Neumann | May 2004 | B1 |
6739556 | Langston | May 2004 | B1 |
6741931 | Kohut | May 2004 | B1 |
6742021 | Halverson | May 2004 | B1 |
6745161 | Arnold | Jun 2004 | B1 |
6751591 | Gorin | Jun 2004 | B1 |
6751612 | Schuetze | Jun 2004 | B1 |
6754485 | Obradovich | Jun 2004 | B1 |
6754627 | Woodward | Jun 2004 | B2 |
6754647 | Tackett | Jun 2004 | B1 |
6757544 | Rangarajan | Jun 2004 | B2 |
6757718 | Halverson | Jun 2004 | B1 |
6785651 | Wang | Aug 2004 | B1 |
6795808 | Strubbe | Sep 2004 | B1 |
6801604 | Maes | Oct 2004 | B2 |
6801893 | Backfried | Oct 2004 | B1 |
6804330 | Jones | Oct 2004 | B1 |
6810375 | Ejerhed | Oct 2004 | B1 |
6813341 | Mahoney | Nov 2004 | B1 |
6816830 | Kempe | Nov 2004 | B1 |
6829603 | Chai | Dec 2004 | B1 |
6832230 | Zilliacus | Dec 2004 | B1 |
6833848 | Wolff | Dec 2004 | B1 |
6850603 | Eberle | Feb 2005 | B1 |
6856990 | Barile | Feb 2005 | B2 |
6865481 | Kawazoe | Mar 2005 | B2 |
6868380 | Kroeker | Mar 2005 | B2 |
6868385 | Gerson | Mar 2005 | B1 |
6871179 | Kist | Mar 2005 | B1 |
6873837 | Yoshioka | Mar 2005 | B1 |
6877001 | Wolf | Apr 2005 | B2 |
6877134 | Fuller | Apr 2005 | B1 |
6882970 | Garner | Apr 2005 | B1 |
6901366 | Kuhn | May 2005 | B1 |
6910003 | Arnold | Jun 2005 | B1 |
6912498 | Stevens | Jun 2005 | B2 |
6915126 | Mazzara, Jr. | Jul 2005 | B2 |
6928614 | Everhart | Aug 2005 | B1 |
6934756 | Maes | Aug 2005 | B2 |
6937977 | Gerson | Aug 2005 | B2 |
6937982 | Kitaoka | Aug 2005 | B2 |
6941266 | Gorin | Sep 2005 | B1 |
6944594 | Busayapongchai | Sep 2005 | B2 |
6950821 | Faybishenko | Sep 2005 | B2 |
6954755 | Reisman | Oct 2005 | B2 |
6959276 | Droppo | Oct 2005 | B2 |
6961700 | Mitchell | Nov 2005 | B2 |
6963759 | Gerson | Nov 2005 | B1 |
6964023 | Maes | Nov 2005 | B2 |
6968311 | Knockeart | Nov 2005 | B2 |
6973387 | Masclet | Dec 2005 | B2 |
6975993 | Keiller | Dec 2005 | B1 |
6980092 | Turnbull | Dec 2005 | B2 |
6983055 | Luo | Jan 2006 | B2 |
6990513 | Belfiore | Jan 2006 | B2 |
6996531 | Korall | Feb 2006 | B2 |
7003463 | Maes | Feb 2006 | B1 |
7016849 | Arnold | Mar 2006 | B2 |
7020609 | Thrift | Mar 2006 | B2 |
7024364 | Guerra | Apr 2006 | B2 |
7027586 | Bushey | Apr 2006 | B2 |
7027974 | Busch | Apr 2006 | B1 |
7027975 | Pazandak | Apr 2006 | B1 |
7035415 | Belt | Apr 2006 | B2 |
7036128 | Julia | Apr 2006 | B1 |
7043425 | Pao | May 2006 | B2 |
7054817 | Shao | May 2006 | B2 |
7058890 | George | Jun 2006 | B2 |
7062488 | Reisman | Jun 2006 | B1 |
7069220 | Coffman | Jun 2006 | B2 |
7072834 | Zhou | Jul 2006 | B2 |
7072888 | Perkins | Jul 2006 | B1 |
7076362 | Ohtsuji | Jul 2006 | B2 |
7082469 | Gold | Jul 2006 | B2 |
7085708 | Manson | Aug 2006 | B2 |
7092928 | Elad | Aug 2006 | B1 |
7107210 | Deng | Sep 2006 | B2 |
7107218 | Preston | Sep 2006 | B1 |
7110951 | Lemelson | Sep 2006 | B1 |
7127395 | Gorin | Oct 2006 | B1 |
7127400 | Koch | Oct 2006 | B2 |
7130390 | Abburi | Oct 2006 | B2 |
7136875 | Anderson | Nov 2006 | B2 |
7137126 | Coffman | Nov 2006 | B1 |
7143037 | Chestnut | Nov 2006 | B1 |
7143039 | Stifelman | Nov 2006 | B1 |
7146319 | Hunt | Dec 2006 | B2 |
7149696 | Shimizu | Dec 2006 | B2 |
7165028 | Gong | Jan 2007 | B2 |
7170993 | Anderson | Jan 2007 | B2 |
7171291 | Obradovich | Jan 2007 | B2 |
7174300 | Bush | Feb 2007 | B2 |
7177798 | Hsu | Feb 2007 | B2 |
7184957 | Brookes | Feb 2007 | B2 |
7190770 | Ando | Mar 2007 | B2 |
7197069 | Agazzi | Mar 2007 | B2 |
7197460 | Gupta | Mar 2007 | B1 |
7203644 | Anderson | Apr 2007 | B2 |
7206418 | Yang | Apr 2007 | B2 |
7207011 | Mulvey | Apr 2007 | B2 |
7215941 | Beckmann | May 2007 | B2 |
7228276 | Omote | Jun 2007 | B2 |
7231343 | Treadgold | Jun 2007 | B1 |
7236923 | Gupta | Jun 2007 | B1 |
7254482 | Kawasaki | Aug 2007 | B2 |
7272212 | Eberle | Sep 2007 | B2 |
7277854 | Bennett | Oct 2007 | B2 |
7283829 | Christenson | Oct 2007 | B2 |
7283951 | Marchisio | Oct 2007 | B2 |
7289606 | Sibal | Oct 2007 | B2 |
7299186 | Kuzunuki | Nov 2007 | B2 |
7301093 | Sater | Nov 2007 | B2 |
7305381 | Poppink | Dec 2007 | B1 |
7321850 | Wakita | Jan 2008 | B2 |
7328155 | Endo | Feb 2008 | B2 |
7337116 | Charlesworth | Feb 2008 | B2 |
7340040 | Saylor | Mar 2008 | B1 |
7366285 | Parolkar | Apr 2008 | B2 |
7366669 | Nishitani | Apr 2008 | B2 |
7376645 | Bernard | May 2008 | B2 |
7386443 | Parthasarathy | Jun 2008 | B1 |
7398209 | Kennewick | Jul 2008 | B2 |
7406421 | Odinak | Jul 2008 | B2 |
7415100 | Cooper | Aug 2008 | B2 |
7415414 | Azara | Aug 2008 | B2 |
7421393 | DiFabbrizio | Sep 2008 | B1 |
7424431 | Greene | Sep 2008 | B2 |
7447635 | Konopka | Nov 2008 | B1 |
7451088 | Ehlen | Nov 2008 | B1 |
7454368 | Stillman | Nov 2008 | B2 |
7454608 | Gopalakrishnan | Nov 2008 | B2 |
7461059 | Richardson | Dec 2008 | B2 |
7472020 | Brulle-Drews | Dec 2008 | B2 |
7472060 | Gorin | Dec 2008 | B1 |
7472075 | Odinak | Dec 2008 | B2 |
7477909 | Roth | Jan 2009 | B2 |
7478036 | Shen | Jan 2009 | B2 |
7487088 | Gorin | Feb 2009 | B1 |
7487110 | Bennett | Feb 2009 | B2 |
7493259 | Jones | Feb 2009 | B2 |
7493559 | Wolff | Feb 2009 | B1 |
7502672 | Kolls | Mar 2009 | B1 |
7502738 | Kennewick | Mar 2009 | B2 |
7516076 | Walker | Apr 2009 | B2 |
7529657 | Wang | May 2009 | B2 |
7529675 | Maes | May 2009 | B2 |
7536297 | Byrd | May 2009 | B2 |
7536374 | Au | May 2009 | B2 |
7542894 | Murata | Jun 2009 | B2 |
7546382 | Healey | Jun 2009 | B2 |
7548491 | Macfarlane | Jun 2009 | B2 |
7552054 | Stifelman | Jun 2009 | B1 |
7558730 | Davis | Jul 2009 | B2 |
7574362 | Walker | Aug 2009 | B2 |
7577244 | Taschereau | Aug 2009 | B2 |
7606708 | Hwang | Oct 2009 | B2 |
7606712 | Smith | Oct 2009 | B1 |
7620549 | DiCristo | Nov 2009 | B2 |
7634409 | Kennewick | Dec 2009 | B2 |
7640006 | Portman | Dec 2009 | B2 |
7640160 | DiCristo | Dec 2009 | B2 |
7640272 | Mahajan | Dec 2009 | B2 |
7672931 | Hurst-Hiller | Mar 2010 | B2 |
7676365 | Hwang | Mar 2010 | B2 |
7676369 | Fujimoto | Mar 2010 | B2 |
7684977 | Morikawa | Mar 2010 | B2 |
7693720 | Kennewick | Apr 2010 | B2 |
7697673 | Chiu | Apr 2010 | B2 |
7706616 | Kristensson | Apr 2010 | B2 |
7729916 | Coffman | Jun 2010 | B2 |
7729918 | Walker | Jun 2010 | B2 |
7729920 | Chaar | Jun 2010 | B2 |
7734287 | Ying | Jun 2010 | B2 |
7748021 | Obradovich | Jun 2010 | B2 |
7788084 | Brun | Aug 2010 | B2 |
7792257 | Vanier | Sep 2010 | B1 |
7801731 | Odinak | Sep 2010 | B2 |
7809570 | Kennewick | Oct 2010 | B2 |
7818176 | Freeman | Oct 2010 | B2 |
7831426 | Bennett | Nov 2010 | B2 |
7831433 | Belvin | Nov 2010 | B1 |
7856358 | Ho | Dec 2010 | B2 |
7873519 | Bennett | Jan 2011 | B2 |
7873523 | Potter | Jan 2011 | B2 |
7873654 | Bernard | Jan 2011 | B2 |
7881936 | Longe | Feb 2011 | B2 |
7890324 | Bangalore | Feb 2011 | B2 |
7894849 | Kass | Feb 2011 | B2 |
7902969 | Obradovich | Mar 2011 | B2 |
7917367 | DiCristo | Mar 2011 | B2 |
7920682 | Byrne | Apr 2011 | B2 |
7949529 | Weider | May 2011 | B2 |
7949537 | Walker | May 2011 | B2 |
7953732 | Frank | May 2011 | B2 |
7974875 | Quilici | Jul 2011 | B1 |
7983917 | Kennewick | Jul 2011 | B2 |
7984287 | Gopalakrishnan | Jul 2011 | B2 |
8005683 | Tessel | Aug 2011 | B2 |
8015006 | Kennewick | Sep 2011 | B2 |
8024186 | De Bonet | Sep 2011 | B1 |
8027965 | Takehara | Sep 2011 | B2 |
8032383 | Bhardwaj | Oct 2011 | B1 |
8060367 | Keaveney | Nov 2011 | B2 |
8069046 | Kennewick | Nov 2011 | B2 |
8073681 | Baldwin | Dec 2011 | B2 |
8077975 | Ma | Dec 2011 | B2 |
8078625 | Zhang | Dec 2011 | B1 |
8082153 | Coffman | Dec 2011 | B2 |
8086463 | Ativanichayaphong | Dec 2011 | B2 |
8103510 | Sato | Jan 2012 | B2 |
8112275 | Kennewick | Feb 2012 | B2 |
8140327 | Kennewick | Mar 2012 | B2 |
8140335 | Kennewick | Mar 2012 | B2 |
8145489 | Freeman | Mar 2012 | B2 |
8150694 | Kennewick | Apr 2012 | B2 |
8155962 | Kennewick | Apr 2012 | B2 |
8170867 | Germain | May 2012 | B2 |
8180037 | Delker | May 2012 | B1 |
8195468 | Weider | Jun 2012 | B2 |
8200485 | Lee | Jun 2012 | B1 |
8204751 | Di Fabbrizio | Jun 2012 | B1 |
8219399 | Lutz | Jul 2012 | B2 |
8219599 | Tunstall-Pedoe | Jul 2012 | B2 |
8224652 | Wang | Jul 2012 | B2 |
8255224 | Singleton | Aug 2012 | B2 |
8326599 | Tomeh | Dec 2012 | B2 |
8326627 | Kennewick | Dec 2012 | B2 |
8326634 | DiCristo | Dec 2012 | B2 |
8326637 | Baldwin | Dec 2012 | B2 |
8332224 | DiCristo | Dec 2012 | B2 |
8340975 | Rosenberger | Dec 2012 | B1 |
8346563 | Hjelm | Jan 2013 | B1 |
8370147 | Kennewick | Feb 2013 | B2 |
8438028 | Chengalvarayan | May 2013 | B2 |
8447607 | Weider | May 2013 | B2 |
8447651 | Scholl | May 2013 | B1 |
8452598 | Kennewick | May 2013 | B2 |
8503995 | Ramer | Aug 2013 | B2 |
8509403 | Chiu | Aug 2013 | B2 |
8515765 | Baldwin | Aug 2013 | B2 |
8527274 | Freeman | Sep 2013 | B2 |
8577671 | Barve | Nov 2013 | B1 |
8589161 | Kennewick | Nov 2013 | B2 |
8612205 | Hanneman | Dec 2013 | B2 |
8612206 | Chalabi | Dec 2013 | B2 |
8620659 | DiCristo | Dec 2013 | B2 |
8719005 | Lee | May 2014 | B1 |
8719009 | Baldwin | May 2014 | B2 |
8719026 | Kennewick | May 2014 | B2 |
8731929 | Kennewick | May 2014 | B2 |
8738380 | Baldwin | May 2014 | B2 |
8849652 | Weider | Sep 2014 | B2 |
8849670 | DiCristo | Sep 2014 | B2 |
8849696 | Pansari | Sep 2014 | B2 |
8849791 | Hertschuh | Sep 2014 | B1 |
8886536 | Freeman | Nov 2014 | B2 |
8972243 | Strom | Mar 2015 | B1 |
8983839 | Kennewick | Mar 2015 | B2 |
9009046 | Stewart | Apr 2015 | B1 |
9015049 | Baldwin | Apr 2015 | B2 |
9037455 | Faaborg | May 2015 | B1 |
9070366 | Mathias | Jun 2015 | B1 |
9070367 | Hoffmeister | Jun 2015 | B1 |
9105266 | Baldwin | Aug 2015 | B2 |
9171541 | Kennewick | Oct 2015 | B2 |
9269097 | Freeman | Feb 2016 | B2 |
9305548 | Kennewick | Apr 2016 | B2 |
9308445 | Merzenich | Apr 2016 | B1 |
9406078 | Freeman | Aug 2016 | B2 |
9443514 | Taubman | Sep 2016 | B1 |
9502025 | Kennewick | Nov 2016 | B2 |
20010039492 | Nemoto | Nov 2001 | A1 |
20010041980 | Howard | Nov 2001 | A1 |
20010047261 | Kassan | Nov 2001 | A1 |
20010049601 | Kroeker | Dec 2001 | A1 |
20010054087 | Flom | Dec 2001 | A1 |
20020002548 | Roundtree | Jan 2002 | A1 |
20020007267 | Batchilo | Jan 2002 | A1 |
20020010584 | Schultz | Jan 2002 | A1 |
20020015500 | Belt | Feb 2002 | A1 |
20020022927 | Lemelson | Feb 2002 | A1 |
20020022956 | Ukrainczyk | Feb 2002 | A1 |
20020029186 | Roth | Mar 2002 | A1 |
20020029261 | Shibata | Mar 2002 | A1 |
20020032752 | Gold | Mar 2002 | A1 |
20020035501 | Handel | Mar 2002 | A1 |
20020040297 | Tsiao | Apr 2002 | A1 |
20020049535 | Rigo | Apr 2002 | A1 |
20020049805 | Yamada | Apr 2002 | A1 |
20020059068 | Rose | May 2002 | A1 |
20020065568 | Silfvast | May 2002 | A1 |
20020067839 | Heinrich | Jun 2002 | A1 |
20020069059 | Smith | Jun 2002 | A1 |
20020069071 | Knockeart | Jun 2002 | A1 |
20020073176 | Ikeda | Jun 2002 | A1 |
20020082911 | Dunn | Jun 2002 | A1 |
20020087312 | Lee | Jul 2002 | A1 |
20020087326 | Lee | Jul 2002 | A1 |
20020087525 | Abbott | Jul 2002 | A1 |
20020107694 | Lerg | Aug 2002 | A1 |
20020120609 | Lang | Aug 2002 | A1 |
20020124050 | Middeljans | Sep 2002 | A1 |
20020133347 | Schoneburg | Sep 2002 | A1 |
20020133354 | Ross | Sep 2002 | A1 |
20020133402 | Faber | Sep 2002 | A1 |
20020135618 | Maes | Sep 2002 | A1 |
20020138248 | Corston-Oliver | Sep 2002 | A1 |
20020143532 | McLean | Oct 2002 | A1 |
20020143535 | Kist | Oct 2002 | A1 |
20020152260 | Chen | Oct 2002 | A1 |
20020161646 | Gailey | Oct 2002 | A1 |
20020161647 | Gailey | Oct 2002 | A1 |
20020169597 | Fain | Nov 2002 | A1 |
20020173333 | Buchholz | Nov 2002 | A1 |
20020173961 | Guerra | Nov 2002 | A1 |
20020184373 | Maes | Dec 2002 | A1 |
20020188602 | Stubler | Dec 2002 | A1 |
20020198714 | Zhou | Dec 2002 | A1 |
20030005033 | Mohan | Jan 2003 | A1 |
20030014261 | Kageyama | Jan 2003 | A1 |
20030016835 | Elko | Jan 2003 | A1 |
20030036903 | Konopka | Feb 2003 | A1 |
20030046071 | Wyman | Mar 2003 | A1 |
20030046281 | Son | Mar 2003 | A1 |
20030046346 | Mumick | Mar 2003 | A1 |
20030064709 | Gailey | Apr 2003 | A1 |
20030065427 | Funk | Apr 2003 | A1 |
20030069734 | Everhart | Apr 2003 | A1 |
20030069880 | Harrison | Apr 2003 | A1 |
20030088421 | Maes | May 2003 | A1 |
20030093419 | Bangalore | May 2003 | A1 |
20030097249 | Walker | May 2003 | A1 |
20030110037 | Walker | Jun 2003 | A1 |
20030112267 | Belrose | Jun 2003 | A1 |
20030115062 | Walker | Jun 2003 | A1 |
20030120493 | Gupta | Jun 2003 | A1 |
20030135488 | Amir | Jul 2003 | A1 |
20030144846 | Denenberg | Jul 2003 | A1 |
20030158731 | Falcon | Aug 2003 | A1 |
20030161448 | Parolkar | Aug 2003 | A1 |
20030167167 | Gong | Sep 2003 | A1 |
20030174155 | Weng | Sep 2003 | A1 |
20030182132 | Niemoeller | Sep 2003 | A1 |
20030187643 | VanThong | Oct 2003 | A1 |
20030204492 | Wolf | Oct 2003 | A1 |
20030206640 | Malvar | Nov 2003 | A1 |
20030212550 | Ubale | Nov 2003 | A1 |
20030212558 | Matula | Nov 2003 | A1 |
20030212562 | Patel | Nov 2003 | A1 |
20030225825 | Healey | Dec 2003 | A1 |
20030233230 | Ammicht | Dec 2003 | A1 |
20030236664 | Sharma | Dec 2003 | A1 |
20040006475 | Ehlen | Jan 2004 | A1 |
20040010358 | Oesterling | Jan 2004 | A1 |
20040025115 | Sienel | Feb 2004 | A1 |
20040030741 | Wolton | Feb 2004 | A1 |
20040036601 | Obradovich | Feb 2004 | A1 |
20040044516 | Kennewick | Mar 2004 | A1 |
20040093567 | Schabes | May 2004 | A1 |
20040098245 | Walker | May 2004 | A1 |
20040117179 | Balasuriya | Jun 2004 | A1 |
20040117804 | Scahill | Jun 2004 | A1 |
20040122673 | Park | Jun 2004 | A1 |
20040122674 | Bangalore | Jun 2004 | A1 |
20040133793 | Ginter | Jul 2004 | A1 |
20040140989 | Papageorge | Jul 2004 | A1 |
20040143440 | Prasad | Jul 2004 | A1 |
20040148154 | Acero | Jul 2004 | A1 |
20040148170 | Acero | Jul 2004 | A1 |
20040158555 | Seedman | Aug 2004 | A1 |
20040166832 | Portman | Aug 2004 | A1 |
20040167771 | Duan | Aug 2004 | A1 |
20040172247 | Yoon | Sep 2004 | A1 |
20040172258 | Dominach | Sep 2004 | A1 |
20040189697 | Fukuoka | Sep 2004 | A1 |
20040193408 | Hunt | Sep 2004 | A1 |
20040193420 | Kennewick | Sep 2004 | A1 |
20040199375 | Ehsani | Oct 2004 | A1 |
20040199389 | Geiger | Oct 2004 | A1 |
20040201607 | Mulvey | Oct 2004 | A1 |
20040205671 | Sukehiro | Oct 2004 | A1 |
20040243393 | Wang | Dec 2004 | A1 |
20040243417 | Pitts | Dec 2004 | A9 |
20040247092 | Timmins | Dec 2004 | A1 |
20040249636 | Applebaum | Dec 2004 | A1 |
20050015256 | Kargman | Jan 2005 | A1 |
20050021331 | Huang | Jan 2005 | A1 |
20050021334 | Iwahashi | Jan 2005 | A1 |
20050021470 | Martin | Jan 2005 | A1 |
20050021826 | Kumar | Jan 2005 | A1 |
20050033574 | Kim | Feb 2005 | A1 |
20050033582 | Gadd | Feb 2005 | A1 |
20050043940 | Elder | Feb 2005 | A1 |
20050080632 | Endo | Apr 2005 | A1 |
20050102282 | Linden | May 2005 | A1 |
20050114116 | Fiedler | May 2005 | A1 |
20050125232 | Gadd | Jun 2005 | A1 |
20050131673 | Koizumi | Jun 2005 | A1 |
20050137850 | Odell | Jun 2005 | A1 |
20050137877 | Oesterling | Jun 2005 | A1 |
20050143994 | Mori | Jun 2005 | A1 |
20050144013 | Fujimoto | Jun 2005 | A1 |
20050144187 | Che | Jun 2005 | A1 |
20050149319 | Honda | Jul 2005 | A1 |
20050216254 | Gupta | Sep 2005 | A1 |
20050222763 | Uyeki | Oct 2005 | A1 |
20050234637 | Obradovich | Oct 2005 | A1 |
20050234727 | Chiu | Oct 2005 | A1 |
20050246174 | DeGolia | Nov 2005 | A1 |
20050283364 | Longe | Dec 2005 | A1 |
20050283532 | Kim | Dec 2005 | A1 |
20050283752 | Fruchter | Dec 2005 | A1 |
20060041431 | Maes | Feb 2006 | A1 |
20060046740 | Johnson | Mar 2006 | A1 |
20060047509 | Ding | Mar 2006 | A1 |
20060072738 | Louis | Apr 2006 | A1 |
20060074670 | Weng | Apr 2006 | A1 |
20060074671 | Farmaner | Apr 2006 | A1 |
20060080098 | Campbell | Apr 2006 | A1 |
20060100851 | Schonebeck | May 2006 | A1 |
20060106769 | Gibbs | May 2006 | A1 |
20060129409 | Mizutani | Jun 2006 | A1 |
20060130002 | Hirayama | Jun 2006 | A1 |
20060182085 | Sweeney | Aug 2006 | A1 |
20060206310 | Ravikumar | Sep 2006 | A1 |
20060217133 | Christenson | Sep 2006 | A1 |
20060236343 | Chang | Oct 2006 | A1 |
20060242017 | Libes | Oct 2006 | A1 |
20060253247 | de Silva | Nov 2006 | A1 |
20060253281 | Letzt | Nov 2006 | A1 |
20060285662 | Yin | Dec 2006 | A1 |
20070011159 | Hillis | Jan 2007 | A1 |
20070033005 | Cristo | Feb 2007 | A1 |
20070033020 | Francois | Feb 2007 | A1 |
20070033526 | Thompson | Feb 2007 | A1 |
20070038436 | Cristo | Feb 2007 | A1 |
20070038445 | Helbing | Feb 2007 | A1 |
20070043569 | Potter | Feb 2007 | A1 |
20070043574 | Coffman | Feb 2007 | A1 |
20070043868 | Kumar | Feb 2007 | A1 |
20070050191 | Weider | Mar 2007 | A1 |
20070050279 | Huang | Mar 2007 | A1 |
20070055525 | Kennewick | Mar 2007 | A1 |
20070061067 | Zeinstra | Mar 2007 | A1 |
20070061735 | Hoffberg | Mar 2007 | A1 |
20070073544 | Millett | Mar 2007 | A1 |
20070078708 | Yu | Apr 2007 | A1 |
20070078709 | Rajaram | Apr 2007 | A1 |
20070078814 | Flowers | Apr 2007 | A1 |
20070094003 | Huang | Apr 2007 | A1 |
20070100797 | Thun | May 2007 | A1 |
20070112555 | Lavi | May 2007 | A1 |
20070112630 | Lau | May 2007 | A1 |
20070118357 | Kasravi | May 2007 | A1 |
20070124057 | Prieto | May 2007 | A1 |
20070135101 | Ramati | Jun 2007 | A1 |
20070146833 | Satomi | Jun 2007 | A1 |
20070162296 | Altberg | Jul 2007 | A1 |
20070174258 | Jones | Jul 2007 | A1 |
20070179778 | Gong | Aug 2007 | A1 |
20070185859 | Flowers | Aug 2007 | A1 |
20070186165 | Maislos | Aug 2007 | A1 |
20070192309 | Fischer | Aug 2007 | A1 |
20070198267 | Jones | Aug 2007 | A1 |
20070203699 | Nagashima | Aug 2007 | A1 |
20070203736 | Ashton | Aug 2007 | A1 |
20070208732 | Flowers | Sep 2007 | A1 |
20070214182 | Rosenberg | Sep 2007 | A1 |
20070250901 | McIntire | Oct 2007 | A1 |
20070265850 | Kennewick | Nov 2007 | A1 |
20070266257 | Camaisa | Nov 2007 | A1 |
20070276651 | Bliss | Nov 2007 | A1 |
20070294615 | Sathe | Dec 2007 | A1 |
20070299824 | Pan | Dec 2007 | A1 |
20080014908 | Vasant | Jan 2008 | A1 |
20080034032 | Healey | Feb 2008 | A1 |
20080046311 | Shahine | Feb 2008 | A1 |
20080059188 | Konopka | Mar 2008 | A1 |
20080065386 | Cross | Mar 2008 | A1 |
20080065389 | Cross | Mar 2008 | A1 |
20080065390 | Ativanichayaphong | Mar 2008 | A1 |
20080086455 | Meisels | Apr 2008 | A1 |
20080091406 | Baldwin | Apr 2008 | A1 |
20080103761 | Printz | May 2008 | A1 |
20080103781 | Wasson | May 2008 | A1 |
20080104071 | Pragada | May 2008 | A1 |
20080109285 | Reuther | May 2008 | A1 |
20080115163 | Gilboa | May 2008 | A1 |
20080126091 | Clark | May 2008 | A1 |
20080133215 | Sarukkai | Jun 2008 | A1 |
20080140385 | Mahajan | Jun 2008 | A1 |
20080147396 | Wang | Jun 2008 | A1 |
20080147410 | Odinak | Jun 2008 | A1 |
20080147637 | Li | Jun 2008 | A1 |
20080154604 | Sathish | Jun 2008 | A1 |
20080162471 | Bernard | Jul 2008 | A1 |
20080177530 | Cross | Jul 2008 | A1 |
20080184164 | Di Fabbrizio | Jul 2008 | A1 |
20080189110 | Freeman | Aug 2008 | A1 |
20080228496 | Yu | Sep 2008 | A1 |
20080235023 | Kennewick | Sep 2008 | A1 |
20080235027 | Cross | Sep 2008 | A1 |
20080269958 | Filev | Oct 2008 | A1 |
20080270135 | Goel | Oct 2008 | A1 |
20080270224 | Portman | Oct 2008 | A1 |
20080294437 | Nakano | Nov 2008 | A1 |
20080294994 | Kruger | Nov 2008 | A1 |
20080306743 | Di Fabbrizio | Dec 2008 | A1 |
20080319751 | Kennewick | Dec 2008 | A1 |
20090006077 | Keaveney | Jan 2009 | A1 |
20090006194 | Sridharan | Jan 2009 | A1 |
20090018829 | Kuperstein | Jan 2009 | A1 |
20090024476 | Baar | Jan 2009 | A1 |
20090030686 | Weng | Jan 2009 | A1 |
20090052635 | Jones | Feb 2009 | A1 |
20090055176 | Hu | Feb 2009 | A1 |
20090067599 | Agarwal | Mar 2009 | A1 |
20090076827 | Bulitta | Mar 2009 | A1 |
20090106029 | DeLine | Apr 2009 | A1 |
20090117885 | Roth | May 2009 | A1 |
20090144131 | Chiu | Jun 2009 | A1 |
20090144271 | Richardson | Jun 2009 | A1 |
20090150156 | Kennewick | Jun 2009 | A1 |
20090157382 | Bar | Jun 2009 | A1 |
20090164216 | Chengalvarayan | Jun 2009 | A1 |
20090171664 | Kennewick | Jul 2009 | A1 |
20090171912 | Nash | Jul 2009 | A1 |
20090197582 | Lewis | Aug 2009 | A1 |
20090216540 | Tessel | Aug 2009 | A1 |
20090248565 | Chuang | Oct 2009 | A1 |
20090248605 | Mitchell | Oct 2009 | A1 |
20090259561 | Boys | Oct 2009 | A1 |
20090259646 | Fujita | Oct 2009 | A1 |
20090265163 | Li | Oct 2009 | A1 |
20090271194 | Davis | Oct 2009 | A1 |
20090273563 | Pryor | Nov 2009 | A1 |
20090276700 | Anderson | Nov 2009 | A1 |
20090287680 | Paek | Nov 2009 | A1 |
20090299745 | Kennewick | Dec 2009 | A1 |
20090299857 | Brubaker | Dec 2009 | A1 |
20090304161 | Pettyjohn | Dec 2009 | A1 |
20090307031 | Winkler | Dec 2009 | A1 |
20090313026 | Coffman | Dec 2009 | A1 |
20090319517 | Guha | Dec 2009 | A1 |
20100023320 | Cristo | Jan 2010 | A1 |
20100023331 | Duta | Jan 2010 | A1 |
20100029261 | Mikkelsen | Feb 2010 | A1 |
20100036967 | Caine | Feb 2010 | A1 |
20100049501 | Kennewick | Feb 2010 | A1 |
20100049514 | Kennewick | Feb 2010 | A1 |
20100057443 | Cristo | Mar 2010 | A1 |
20100063880 | Atsmon | Mar 2010 | A1 |
20100064025 | Nelimarkka | Mar 2010 | A1 |
20100094707 | Freer | Apr 2010 | A1 |
20100138300 | Wallis | Jun 2010 | A1 |
20100145700 | Kennewick | Jun 2010 | A1 |
20100185512 | Borger | Jul 2010 | A1 |
20100204986 | Kennewick | Aug 2010 | A1 |
20100204994 | Kennewick | Aug 2010 | A1 |
20100217604 | Baldwin | Aug 2010 | A1 |
20100268536 | Suendermann | Oct 2010 | A1 |
20100286985 | Kennewick | Nov 2010 | A1 |
20100299142 | Freeman | Nov 2010 | A1 |
20100299336 | Bergstraesser | Nov 2010 | A1 |
20100312566 | Odinak | Dec 2010 | A1 |
20100318357 | Istvan | Dec 2010 | A1 |
20100331064 | Michelstein | Dec 2010 | A1 |
20110022393 | Waller | Jan 2011 | A1 |
20110106527 | Chiu | May 2011 | A1 |
20110112827 | Kennewick | May 2011 | A1 |
20110112921 | Kennewick | May 2011 | A1 |
20110119049 | Ylonen | May 2011 | A1 |
20110131036 | DiCristo | Jun 2011 | A1 |
20110131045 | Cristo | Jun 2011 | A1 |
20110231182 | Weider | Sep 2011 | A1 |
20110231188 | Kennewick | Sep 2011 | A1 |
20110238409 | Larcheveque | Sep 2011 | A1 |
20110307167 | Taschereau | Dec 2011 | A1 |
20120022857 | Baldwin | Jan 2012 | A1 |
20120041753 | Dymetman | Feb 2012 | A1 |
20120046935 | Nagao | Feb 2012 | A1 |
20120101809 | Kennewick | Apr 2012 | A1 |
20120101810 | Kennewick | Apr 2012 | A1 |
20120109753 | Kennewick | May 2012 | A1 |
20120150620 | Mandyam | Jun 2012 | A1 |
20120150636 | Freeman | Jun 2012 | A1 |
20120166183 | Suendermann | Jun 2012 | A1 |
20120239498 | Ramer | Sep 2012 | A1 |
20120240060 | Pennington | Sep 2012 | A1 |
20120265528 | Gruber | Oct 2012 | A1 |
20120278073 | Weider | Nov 2012 | A1 |
20130006734 | Ocko | Jan 2013 | A1 |
20130054228 | Baldwin | Feb 2013 | A1 |
20130060625 | Davis | Mar 2013 | A1 |
20130080177 | Chen | Mar 2013 | A1 |
20130211710 | Kennewick | Aug 2013 | A1 |
20130253929 | Weider | Sep 2013 | A1 |
20130254314 | Chow | Sep 2013 | A1 |
20130297293 | Cristo | Nov 2013 | A1 |
20130304473 | Baldwin | Nov 2013 | A1 |
20130311324 | Stoll | Nov 2013 | A1 |
20130332454 | Stuhec | Dec 2013 | A1 |
20130339022 | Baldwin | Dec 2013 | A1 |
20140006951 | Hunter | Jan 2014 | A1 |
20140012577 | Freeman | Jan 2014 | A1 |
20140025371 | Min | Jan 2014 | A1 |
20140108013 | Cristo | Apr 2014 | A1 |
20140156278 | Kennewick | Jun 2014 | A1 |
20140195238 | Terao | Jul 2014 | A1 |
20140236575 | Tur | Aug 2014 | A1 |
20140249821 | Kennewick | Sep 2014 | A1 |
20140249822 | Baldwin | Sep 2014 | A1 |
20140278413 | Pitschel | Sep 2014 | A1 |
20140278416 | Schuster | Sep 2014 | A1 |
20140288934 | Kennewick | Sep 2014 | A1 |
20140330552 | Bangalore | Nov 2014 | A1 |
20140365222 | Weider | Dec 2014 | A1 |
20150019211 | Simard | Jan 2015 | A1 |
20150019217 | Cristo | Jan 2015 | A1 |
20150019227 | Anandarajah | Jan 2015 | A1 |
20150066479 | Pasupalak | Mar 2015 | A1 |
20150066627 | Freeman | Mar 2015 | A1 |
20150073910 | Kennewick | Mar 2015 | A1 |
20150095159 | Kennewick | Apr 2015 | A1 |
20150142447 | Kennewick | May 2015 | A1 |
20150170641 | Kennewick | Jun 2015 | A1 |
20150193379 | Mehta | Jul 2015 | A1 |
20150199339 | Mirkin | Jul 2015 | A1 |
20150228276 | Baldwin | Aug 2015 | A1 |
20150293917 | Bufe, III | Oct 2015 | A1 |
20150348544 | Baldwin | Dec 2015 | A1 |
20150348551 | Gruber | Dec 2015 | A1 |
20150364133 | Freeman | Dec 2015 | A1 |
20160049152 | Kennewick | Feb 2016 | A1 |
20160078482 | Kennewick | Mar 2016 | A1 |
20160078491 | Kennewick | Mar 2016 | A1 |
20160078504 | Kennewick | Mar 2016 | A1 |
20160078773 | Carter | Mar 2016 | A1 |
20160110347 | Kennewick | Apr 2016 | A1 |
20160110478 | Aggour | Apr 2016 | A1 |
20160148610 | Kennewick | May 2016 | A1 |
20160188292 | Carter | Jun 2016 | A1 |
20160188573 | Tang | Jun 2016 | A1 |
20160217785 | Kennewick | Jul 2016 | A1 |
20160335676 | Freeman | Nov 2016 | A1 |
20170242843 | Jiao | Aug 2017 | A1 |
Number | Date | Country |
---|---|---|
1433554 | Jul 2003 | CN |
1860496 | Nov 2006 | CN |
1320043 | Jun 2003 | EP |
1646037 | Apr 2006 | EP |
H08263258 | Oct 1996 | JP |
H11249773 | Sep 1999 | JP |
2001071289 | Mar 2001 | JP |
2006146881 | Jun 2006 | JP |
2008027454 | Feb 2008 | JP |
2008058465 | Mar 2008 | JP |
2008139928 | Jun 2008 | JP |
2011504304 | Feb 2011 | JP |
2012518847 | Aug 2012 | JP |
9946763 | Sep 1999 | WO |
0021232 | Jan 2000 | WO |
0046792 | Jan 2000 | WO |
0171609 | Sep 2001 | WO |
0178065 | Oct 2001 | WO |
2004072954 | Jan 2004 | WO |
2005010702 | Feb 2005 | WO |
2007019318 | Jan 2007 | WO |
2007021587 | Jan 2007 | WO |
2007027546 | Jan 2007 | WO |
2007027989 | Jan 2007 | WO |
2008098039 | Jan 2008 | WO |
2008118195 | Jan 2008 | WO |
2009075912 | Jan 2009 | WO |
2009145796 | Jan 2009 | WO |
2009111721 | Sep 2009 | WO |
2010096752 | Jan 2010 | WO |
2016044290 | Mar 2016 | WO |
2016044316 | Mar 2016 | WO |
2016044319 | Mar 2016 | WO |
2016044321 | Mar 2016 | WO |
2016061309 | Apr 2016 | WO |
Entry |
---|
Lin et al “A Distributed Architecture for Cooperative Spoken Dialogue Agents with Coherent Dialogue State and History”, 1999. Retrieved online on Jan. 18, 2017 from <http://www.iis.sinica.edu.tw/˜whm/publish/papers/asru99.pdf>. |
Gabrilovich, Evgeniy, and Shaul Markovitch. “Computing semantic relatedness using wikipedia-based explicit semantic analysis.” IJcAI. vol. 7. 2007. |
“Statement in Accordance with the Notice from the European Patent Office” dated Oct. 1, 2007 Concerning Business Methods (OJ EPO Nov. 2007, 592-593), XP002456252. |
Arrington, Michael, “Google Redefines GPS Navigation Landscape: Google Maps Navigation for Android 2.0”, TechCrunch, printed from the Internet <http://www.techcrunch.com/2009/10/28/google-redefines-car-gps-navigation-google-maps-navigation-android/>, Oct. 28, 2009, 4 pages. |
Bazzi, Issam et al., “Heterogeneous Lexical Units for Automatic Speech Recognition: Preliminary Investigations”, Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing, vol. 3, Jun. 5-9, 2000, XP010507574, pp. 1257-1260. |
Belvin, Robert, et al., “Development of the HRL Route Navigation Dialogue System”, Proceedings of the First International Conference on Human Language Technology Research, San Diego, 2001, pp. 1-5. |
Chai et al., “MIND: A Semantics-Based Multimodal Interpretation Framework for Conversational Systems”, Proceedings of the International Class Workshop on Natural, Intelligent and Effective Interaction in Multimodal Dialogue Systems, Jun. 2002, pp. 37-46. |
Cheyer et al., “Multimodal Maps: An Agent-Based Approach”, International Conference on Cooperative Multimodal Communication (CMC/95), May 24-26, 1995, pp. 111-121. |
El Meliani et al., “A Syllabic-Filler-Based Continuous Speech Recognizer for Unlimited Vocabulary”, Canadian Conference on Electrical and Computer Engineering, vol. 2, Sep. 5-8, 1995, pp. 1007-1010. |
Elio et al., “On Abstract Task Models and Conversation Policies” in Workshop on Specifying and Implementing Conversation Policies, Autonomous Agents '99, Seattle, 1999, 10 pages. |
Kirchhoff, Katrin, “Syllable-Level Desynchronisation of Phonetic Features for Speech Recognition”, Proceedings of the Fourth International Conference on Spoken Language, 1996, ICSLP 96, vol. 4, IEEE, 1996, 3 pages. |
Kuhn, Thomas, et al., “Hybrid In-Car Speech Recognition for Mobile Multimedia Applications”, Vehicular Technology Conference, IEEE, Jul. 1999, pp. 2009-2013. |
Lin, Bor-shen, et al., “A Distributed Architecture for Cooperative Spoken Dialogue Agents with Coherent Dialogue State and History”, ASRU'99, 1999, 4 pages. |
Lind, R., et al., The Network Vehicle—A Glimpse into the Future of Mobile Multi-Media, IEEE Aerosp. Electron. Systems Magazine, vol. 14, No. 9, Sep. 1999, pp. 27-32. |
Mao, Mark Z., “Automatic Training Set Segmentation for Multi-Pass Speech Recognition”, Department of Electrical Engineering, Stanford University, CA, copyright 2005, IEEE, pp. I-685 to I-688. |
O'Shaughnessy, Douglas, “Interacting with Computers by Voice: Automatic Speech Recognition and Synthesis”, Proceedings of the IEEE, vol. 91, No. 9, Sep. 1, 2003, XP011100665. pp. 1272-1305. |
Reuters, “IBM to Enable Honda Drivers to Talk to Cars”, Charles Schwab & Co., Inc., Jul. 28, 2002, 1 page. |
Turunen, “Adaptive Interaction Methods in Speech User Interfaces”, Conference on Human Factors in Computing Systems, Seattle, Washington, 2001, pp. 91-92. |
Vanhoucke, Vincent, “Confidence Scoring and Rejection Using Multi-Pass Speech Recognition”, Nuance Communications, Menlo Park, CA, 2005, 4 pages. |
Weng, Fuliang, et al., “Efficient Lattice Representation and Generation”, Speech Technology and Research Laboratory, SRI International, Menlo Park, CA, 1998, 4 pages. |
Wu, Su-Lin, et al., “Incorporating Information from Syllable-Length Time Scales into Automatic Speech Recognition”, Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, 1998, vol. 2, IEEE, 1998, 4 pages. |
Wu, Su-Lin, et al., “Integrating Syllable Boundary Information into Speech Recognition”, IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP-97, 1997, vol. 2, IEEE, 1997, 4 pages. |
Zhao, Yilin, “Telematics: Safe and Fun Driving”, IEEE Intelligent Systems, vol. 17, Issue 1, 2002, pp. 10-14. |
Davis, Z., et al., A Personal Handheld Multi-Modal Shopping Assistant, IEEE, 2006, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20160148612 A1 | May 2016 | US |
Number | Date | Country | |
---|---|---|---|
62085029 | Nov 2014 | US |