Patent Grant
8775459
The present invention relates generally to conversation systems and relates more particularly to the interpretation of input by conversation systems.
Conversation systems allow a user to interact with or search a database of information by receiving and responding to user data requests. For example, a user may search real estate listings by presenting a conversation system with a query that is defined by one or more search criteria, such as “Show all houses in Scarsdale, N.Y. priced at $400,000 or less”. The conversation system then dissects this query and searches the database for results that meet the user's search criteria.
One common shortcoming of conventional conversation systems is limited interpretation capability. Due to limited vocabularies and grammars, typical conversation systems can experience difficulties in correctly interpreting even search criteria with unambiguous meanings, such as the city name “Scarsdale, N.Y.” or the price “$400,000 or less” in the example above. These difficulties are magnified when qualitative search criteria is provided by the user. For example, a typical conversation system would not be capable of interpreting the command “Show all houses in good school districts priced at $400,000 or less”, because the search criteria “good school districts” is not clearly defined (that is, the conversation system can not know what the user means by “good”).
Some conversation systems attempt to address this difficulty by simply recognizing or understanding a wider range of potential input expressions. However, algorithms for adapting these expanded vocabularies are still imperfect or unknown. Moreover, such an approach increases the cost and the computational complexity of the conversation system. The feasibility of this solution is therefore still limited.
Thus, there is a need in the art for a method and apparatus for robust input interpretation by conversation systems.
One embodiment of the present method and apparatus for robust input interpretation by conversation systems includes receiving a user request containing at least one un-interpretable term, where a “term” is understood to be at least one component of a user request, such as a word, a phrase, a gesture, a graphical user interface input or a relationship between two or more words, phrases, gestures or graphical user interface inputs. The present invention conveys the conversation system's interpretation capabilities to the user, for example by suggesting at least one alternative request in context of the un-interpretable user request, where the alternative request is phrased in a manner that is substantially fully interpretable. A user may then select a suggested alternative request or formulate a new request in accordance with knowledge of the conversation system capabilities learned from the conveyed information. In another embodiment, a method may independently (e.g., without user prompting) adapt the un-interpretable user request in accordance with learned information regarding the meaning of any un-interpretable terms in the user request.
So that the manner in which the above recited embodiments of the invention are attained and can be understood in detail, a more particular description of the invention, briefly summarized above, may be obtained by reference to the embodiments thereof which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
To facilitate understanding, identical reference numerals have been used, where possible, to designate identical elements that are common to the figures.
In one embodiment, the present invention is a method and apparatus for robust input interpretation by conversation systems. Embodiments of the present invention may be implemented by both uni-modal (e.g., used to interpret one modality, such as natural language or gesture) and multi-modal (e.g., used to interpret multiple modalities) conversation systems to improve interpretation capability. In one embodiment, the present invention provides a two-way adaptation framework that both enables a user to adapt to the conversation system capabilities in context and enables the conversation system to dynamically learn new user expressions.
In step 106, the method 100 determines whether the user request received in step 104 can be successfully interpreted by the conversation system, e.g., whether all terms, including search criteria, and all relationships between terms in the user request are understood by the conversation system. As used herein in the context of a user request, “term” refers to any component of a user request, including a spoken or typed word or phrase, a gesture and a graphical user interface input.
In one embodiment, the ability of the conversation system to successfully interpret the user request is impacted by the manner in which the user request is phrased (e.g., “Find x” versus “Show x”), by the presence of ambiguous, subjective or evaluative words and phrases in the user request (e.g., “good” or “bad”), and/or by the absence of available information pertaining to a given term (e.g., no information available that meets the search criteria). If the method 100 determines in step 106 that the user request can be successfully interpreted by the conversation system, the method 100 proceeds to step 108 and searches the appropriate database in accordance with the interpreted user request, e.g., to produce results responsive to the user request. Thus, step 108 may be executed in accordance with any searching technique, including known searching techniques used by conventional conversation systems. The method 100 then terminates in step 110.
Alternatively, if the method 100 determines in step 106 that the user request cannot be successfully interpreted by the conversation system, the method 100 proceeds to step 112 and conveys the conversation system's interpretation capabilities to the user. In one embodiment, conveyance of the conversation system's capabilities in accordance with step 112 includes providing feedback associated with at least one un-interpretable term in the user request to the user, where the feedback is structured to enable the user to adapt the user request in a manner that is substantially fully interpretable by the conversation system. In one embodiment, the feedback is at least one of: at least one valid alternative request in context, at least one help topic (e.g., similar to a Frequently Asked Question) or a statement informing the user that the requested information is not available (e.g., “I don't have any information on Tudors”). Within the context of the present invention, a “valid” request is a request that the conversation system can successfully interpret. Thus, in this embodiment, the method 100 presents the user with alternate phrasings that potentially reflect the original, un-interpretable user request but, unlike the original user request, are substantially fully understandable by the conversation system. In one embodiment, at least one valid request is stored in a query template corpus or database that is accessible by the method 100.
Thus, for example, based on the exemplary user request described above, the method 100 may suggest alternative requests such as “Show all Tudors in school districts having average class sizes of twenty students or less” or “Show all Tudors in school districts having at least an eighty-five percent graduation rate”, where the search criteria relating to average class size and graduation rate seek to clarify or redefine the qualitative criterion “good school districts” as a criterion that the method 100 can interpret and search. The user may therefore select from among the suggested alternative requests one which most closely reflects the intent of the original user request. Alternatively, the user may revise an alternative request and submit it as a new request (e.g., “Show all Tudors in school districts having at least a ninety percent graduation rate”), or the user may select none of the suggested alternative requests and simply attempt to rephrase the original user request as a new user request.
Thus, after conveying the conversation system's interpretation capabilities to the user, the method 100 returns to step 104 and proceeds as discussed above, e.g., using a selected alternative request, a new user request or revised version of the original user request.
The method 100 thereby facilitates the interaction of a human user and a conversation system by making the conversation system's abilities apparent to the user. That is, if the user relays a request to the conversation system, and the conversation system is unable to interpret the request as it is phrased, the conversation system, by suggesting alternative requests, can “teach” the user to make requests in a manner that is understandable by the conversation system. With repeated use, the user may therefore adapt his or her manner of making requests to the known capabilities of the conversation system, enabling the conversation system to produce the desired results more quickly and leading to less frequent system interpretation failure. This method of improving conversation system interaction is therefore less costly and more practically feasible than simply programming the conversation system to understand all possible variations of various input expressions.
The method 200 then proceeds to step 206 and compares the un-interpretable request with stored request templates. In one embodiment, a stored request template comprises a semantic graph (derived from interpretation results), surface features (from raw input events) and contextual features (from a conversation history). In one embodiment, at least one stored request template is stored in a query template corpus or database that is accessible by the method 200. In one embodiment, the query template corpus is created by extracting all semantic, surface and contextual features from valid user requests. In another embodiment, the query template corpus is created via automatic template generation that systematically populates the query template corpus based on “seed” templates. In another embodiment, the query template corpus is created via automatic sentence generation based on semantic or syntactic grammar used by the method 200.
In one embodiment, the un-interpretable user request is compared to every stored request template in the query template corpus. The method 200 then ranks each stored request template to which the un-interpretable user request has been compared. In one embodiment, ranking of stored request templates is based on at least one of several criteria, including how similar the stored request template is to the un-interpretable user request (e.g., in terms of speech, text, gesture and graphical user interface) and diversity among the top-ranking stored requests templates.
In one embodiment, similarity between an un-interpretable user request and a stored request template is measured by the similarity between the semantic graph of the user request and the semantic graph of the stored request template. In one embodiment, the similarity between the semantic graph of the user request and the semantic graph of the stored request template is measured based on the number of matching nodes in the semantic graph of the user request and the semantic graph of the stored request template. In another embodiment, an exact graph matching algorithm determines the similarity between the semantic graph of the user request and the semantic graph of the stored request template. In another embodiment, similarity between the context of the user request and the context of the stored request template is measured by a linear combination of the similarity between a set of contextual features associated with the user request and a set of contextual features associated with the stored request template. In another embodiment, the similarity between two input text strings (e.g., representing an un-interpretable user request and a stored request template) is computed using the cosine measure between word vectors or using the string edit distance. In another embodiment, the similarity between two gestures, between two graphical user interface events, or between two sets of conversation history features (e.g., representing an un-interpretable user request and a stored request template) is computed using a Euclidian distance. In another embodiment, the similarity between an un-interpretable user request and a stored request template is measured by a linear combination of all of the above similarity measures.
In yet another embodiment, a similarity metric for computing the overall distance D(Q, Q′) between a user request, Q, and a stored request template, Q′, uses a weighted sum of distances D(G, G′) and D(S, S∝) between the respective semantic graphs G and G′ and surface features S and S′ of the user request Q and the stored request template Q′ such that:
D(Q,Q′)=w1×D(G,G′)+w2×D(S,S′) (EQN. 1)
where w1 is a weight applied to the distance between the semantic graphs G and G′ and w2 is a weight applied to the distance between the surface features S and S′. In one embodiment, exemplary weights for w1 and w2 are determined, empirically, to be 0.65 and 0.35, respectively. In one embodiment, the distances between the semantic graphs and the surface features D(G, G′) and D(S, S′) are normalized to lie between [0, 1], with a distance of 0.0 representing a perfect match. For the purposes of the above calculation, respective contextual features are built into the semantic graphs G and G′.
In step 208, the method 200 instantiates at least one selected top-ranking request template to generate the surface form for an alternative request. In one embodiment, instantiation in accordance with step 208 is a two-step process that involves: (1) instantiating variables; and (2) realizing context-sensitive expressions, in order to generate an alternative expression similar to the original user request.
In one embodiment, the method 200 instantiates a predefined number of the top-ranked stored request templates, where the predefined number of stored request templates to be instantiated is empirically determined. In one embodiment, step 208 also involves generating a context-appropriate expression based on the current user request and the conversation history.
Once at least one selected request template has been instantiated, the method 200 proceeds to step 210 and presents the at least one instantiated request template to the user, e.g., as a suggested alternative request in accordance with step 112 of the method 100. In one embodiment, instantiated request templates are presented as suggested alternative request in the form of text (e.g., using a display or graphical user interface) or speech (e.g., using a text-to-speech system). The method 200 then terminates in step 212.
The task 302 represents the operation or action solicited in the user request (e.g., “Show x”, “Find y”, etc.). For example, in the exemplary user request discussed above, the associated task is “Show”. The nodes 304 represent domain concepts, attributes and constraints specified in the user request. For example, the nodes 3041 and 3042 represents concepts (“House” and “School District”, respectively) and the nodes 3045 and 3047 represent attributes of those concepts (the “Style” of the “House” or the “Class Size” in the “School District”). Attributes may include one or more variables (e.g., nodes 3046 and 304n) that can be instantiated using one or more of a plurality of values (e.g., a Tudor house). The nodes 3043 and 3044 represent constraints that relate the concepts to the attributes in the semantic graph 300. In one embodiment, a constraint may indicate that an attribute in the original user request is equal to (‘EQ’), not equal to, greater than (‘GT’) and/or less than (‘LT’) a represented constraint. For example, the constraint represented by the node 3043 indicates that the “Style” is (is “equal to”) a given style. The constraint represented by the node 3044 indicates that the “Class Size” in the “School District” is less than a given amount. Moreover, each node 304 is also associated with a set of features that further describe the properties of the nodes 304, such as meta type and form (e.g., a single instance or a list).
In one embodiment, the semantic graph 300 also includes one or more relational links 306 that indicate a relationship between two or more nodes 304. For example, the relational link 306 indicates a semantic relationship (e.g., as defined in the data ontology) between the nodes 3041 (“House” concept) and 3042 (“School District” concept).
In one embodiment, the contextual features of a stored request template comprise at least one of the current conversation stage, the current visual context (e.g., including objects that are shown in the current visual display as well as the objects that are in focus) and features from one or more past user requests (e.g., intention and attention types of the previous request(s)).
The method 600 is initialized at step 602 and proceeds to step 604, where the method 600 receives a user request. The method 600 then proceeds to step 606 and determines whether the user request matches a stored association pattern (e.g., comprising an association pair).
In one embodiment, an association pattern represents an association between a previous, original user request and the valid (e.g., understandable by the conversation system) modified version of the user request. Thus, in one embodiment, an association pattern includes an association pair comprising a previous original user request and the valid modified version of the user request, as well as a confidence that indicates the strength of this association. In one embodiment, a plurality of stored association patterns is stored in an association database accessible by the method 600.
In one embodiment, matching stored association patterns are identified by abstracting the original user requests associated with each stored association pattern. To abstract an original user request, the attribute values of the original user request are replaced with variables. For example, if the original user request was, “Show Tudors in good school districts”, the abstracted version would be “Show $var$ good school district”, where the variable $var$ replaces the attribute “Tudor”. In further embodiments, unimportant surface expressions are also removed from the original user request. Thus, the key concepts (e.g., data concepts) of the original user request are preserved, and any problems that would typically occur in trying to literally or partially match the new, un-interpretable user request to the exact stored association pattern are substantially avoided. For example, trying to match the new user request “Show all Colonials in good school districts” to the original user request “Show all Tudors in good school districts” would typically succeed after abstracting the original user request. However, trying to match the new user request “Show all Tudors in good condition” to the original user request “Show all Tudors in good school districts” would typically trigger a failure even after abstracting the original user request (e.g., since what is “good” in terms of condition may not necessarily equate to what is “good” in terms of school districts). By abstracting the original user requests before comparing stored association pairs to a new user request, these problems are substantially avoided.
Thus, if the method 600 determines in step 606 that no stored association patterns correspond to the new, un-interpretable user request, the method 600 proceeds to step 104 of the method 100 in step 610. Alternatively, if the method 600 identifies at least one stored associated pattern that matches the new, un-interpretable user request, the method 600 selects the stored association pattern with the highest confidence factor and adapts the new, un-interpretable user request in accordance with the corresponding association pair in step 608. In one embodiment, the confidence factor for the selected association pattern must meet or exceed a predefined adaptation threshold for adaptation to occur. In one embodiment, this adaptation is applied by substituting for the variables in an abstracted, original user request with attributes, constraints or features that are defined in the new user request. For example, the variable $var$ in the abstracted, original user request “Show all $var$ good school district” can be substituted with the attribute “Colonials” to produce “Show all Colonials in good school districts”. Similarly, the variable $var$ in the adapted request “Show all $var$ in school districts with an average class size of 20 or less” can be substituted with the attribute “Colonials” to produce “Show all Colonials in school districts with an average class size of 20 or less”. The conversation system can then process this request in accordance with any processing method.
As discussed above, association patterns for use in adapting new user requests based on past experience may be stored in an association patterns database. In one embodiment, this association database comprises both a short-term association space and a long-term association space. The short-term association space comprises association patterns learned during a current user session. The long-term space comprises association patterns learned over multiple user sessions. One motive for dividing the association database into short- and long-term space, is to better accommodate different meanings (e.g., in the minds of different users) for substantially identical user requests. For example, a “good school district” might mean a school district having class sizes of less than 20 students for one user, while a “good school district” to another user might mean a school district having at least a ninety-percent graduation rate. Thus, to tailor the adaptation of new, un-interpretable user requests to different users, a conversation system may be more likely to trust the association patterns in the short-term space that reflect the user's previously observed preferences. The long-term space, on the other hand, enables a user to benefit from the experiences of pervious users.
In addition, the association database may dynamically update or learn as it goes.
The method 700 then proceeds to step 706 and determines whether the new association pattern already exists in the association database. In one embodiment, this determination is made by matching the new association pattern against every existing association pattern in both the short-term and long-term spaces, e.g., using the matching technique (based on abstract modification) discussed with reference to
If the method 700 determines in step 706 that the new association pattern already exists in the association database, the method 700 proceeds to step 708 and updates the confidence factor associated with the existing association pattern. In one embodiment, the confidence factor is increased by a first amount if the existing association pattern resides in the short-term space, but is increased by a different second amount if the existing association pattern resides in the long-term space.
Alternatively, if the method 700 determines in step 706 that the new association pattern does not already exist in the association database, the method 700 proceeds to step 710 and adds the new association pattern to the association database. In one embodiment, the new association pattern is added to only the short-term space with a short-term initial confidence factor. In another embodiment, the new association pattern is also added to the long-term space with a long-term initial confidence factor. In one embodiment, the long-term initial confidence factor is smaller than the short-term initial confidence factor since reuse of the expression that generated the new association pattern in the current session is intuitively “safer”. In one embodiment, the new association pattern is added to both the long-term space and short-term space with respective initial confidence factors. The method 700 then terminates in step 712.
Alternatively, the input interpretation module 805 can be represented by one or more software applications (or even a combination of software and hardware, e.g., using Application Specific Integrated Circuits (ASIC)), where the software is loaded from a storage medium (e.g., I/O devices 806) and operated by the processor 802 in the memory 804 of the general purpose computing device 800. Additionally, the software may run in a distributed or partitioned fashion on two or more computing devices similar to the general purpose computing device 800. Thus, in one embodiment, the input interpretation module 805 for interpreting input user requests described herein with reference to the preceding figures can be stored on a computer readable medium or carrier (e.g., RAM, magnetic or optical drive or diskette, and the like).
Thus, the present invention represents a significant advancement in the field of conversation systems. Embodiments of the present invention may be implemented by both uni-modal and multi-modal conversation systems to improve interpretation capability. A two-way adaptation framework not only enables a user to adapt to the conversation system capabilities in context, but also enables the conversation system to dynamically learn new user expressions. The present invention can therefore provide results in a manner that is quicker and less failure or error prone than conventional techniques implemented in conversations systems.
While foregoing is directed to the preferred embodiment of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5454106 | Burns et al. | Sep 1995 | A |
| 6006225 | Bowman et al. | Dec 1999 | A |
| 6144958 | Ortega et al. | Nov 2000 | A |
| 6523028 | DiDomizio et al. | Feb 2003 | B1 |
| 6647383 | August et al. | Nov 2003 | B1 |
| 6772150 | Whitman et al. | Aug 2004 | B1 |
| 6829603 | Chai et al. | Dec 2004 | B1 |
| 6895406 | Fables et al. | May 2005 | B2 |
| 7343371 | Ibuki et al. | Mar 2008 | B2 |
| 20020059069 | Hsu et al. | May 2002 | A1 |
| 20030041058 | Ibuki et al. | Feb 2003 | A1 |
| 20040172258 | Dominach et al. | Sep 2004 | A1 |
| 20050038781 | Ferrari et al. | Feb 2005 | A1 |
| Number | Date | Country | |
|---|---|---|---|
| 20060155673 A1 | Jul 2006 | US |
