Applications server and method

• US 7,634,259 B2
• Filed: 03/17/2006
• Issued: 12/15/2009
• Est. Priority Date: 03/18/2005
• Status: Expired due to Fees

• Current Assignee: Orange S.A.
• Original Assignee: Orange S.A.
• Inventors: Shienbrood, Eric R., Howe, Gregory T., Pelland, David M., Adamsky, Robert
• Primary Examiner(s): Feild; Joseph H
• Assistant Examiner(s): Nguyen; Huy D
• Application Number:
  US11/378,579
• Publication Number:
  US 20060212515A1
• Time in Patent Office: 1,369 Days
• Field of Search: 455/418, 455/419, 455/422.1, 709/217, 709/219, 709/203
• US Class Current: 455/418
• CPC Class Codes: G10L 15/183 using context dependencies, e.g. language models
• CPC Class Codes: G10L 15/22 Procedures used during a speech recognition process, e.g. man-machine dialogue
• CPC Class Codes: G10L 2015/223 Execution procedure of a spoken command
• CPC Class Codes: G10L 2015/228 of application context

Abstract

An applications server is operable to provide a plurality of user driven services by running an application program. The application program is arranged to provide the services in response to user commands for selecting service options. The applications server comprises in accordance with the application program a state machine able to determine a current state of the application program from one of a pre-determined set of states defining a logical procedure through the user selected service options. The states of the state machine includes for each of the modular services, one or more states associated with one or more forms within the service. Each form defines a state of a user interface for providing the services to the user, and each state includes one or more sub-states called situations, defining the commands to be recognised and the predicates to be satisfied to select that state depending upon the estimated user commands and the session state of the user session. The set of states includes a base service defined by one or more main states. The application program also comprises a command recognition engine, including a grammar processor and may include an automatic speech recogniser to provide the command recognition engine with a set of possible user commands which may be provided for a particular state, the possible commands determining the states which may be reached from the current state. The command recognition engine, in response to a received user command, provides the state machine with an estimate of at least one of the possible commands, which the user may have provided. The state machine changes state in response to the estimated user command. The state machine determines the transitions between the states at run-time and the grammar engine adapts the possible user commands to be recognised for a current state in association with the state transitions, which are determined at run-time. As such, the applications server can provision user driven services, which can be dynamically adapted and blended with each other in accordance with user requirements.

Claims

1. An applications server operable to provide a plurality of modular user driven services by running an application program, the application program being arranged to provide the modular services in response to user commands for selecting service options, the applications server comprising in accordance with the application program

a state machine operable by a state machine engine to determine a current state of the application program from one of a pre-determined set of states defining a logical procedure through the user selected service options, the states of the state machine including for each of the modular services, one or more states defined by one or more forms within the service, each form defining a state of a user interface for providing the services to the user, and each state including one or more sub-states representing situations, defining the commands to be recognized and conditions to be satisfied to select each sub-state depending upon the estimated user commands and the session state of the user session,

a command recognition engine, the command recognition engine including a grammar processor operable to provide the command recognition engine with grammar rules to establish a set of possible user commands which can be provided for a particular state, the possible user commands constituting a menu of available user commands for each form, the possible commands determining the states which can be reached from the current state, the command recognition engine being operable in response to a received user command to provide the state machine engine with an estimate of at least one of the possible commands, which the user may have provided, the state machine being operable to change state in response to the estimated user command, wherein the state machine is operable to determine at run-time a set of eligible states and the possible transitions between the states, the grammar processor being operable to adapt the possible user commands to be recognized for a current state in association with the state transitions, which are determined at run-time.

2. An applications server as claimed in claim 1, wherein the state machine engine includes a state sequencer operable to determine at run-time a set of eligible states from among all the states defined by the state machine of the application program, the state sequencer being arranged to determine at run-time the possible state transitions among the eligible states.

3. An applications server as claimed in claim 1, wherein the set of eligible states for a given user comprises the situations associated with the current and global forms, filtered to include only the situations contained in the modular service packages of the services to which the user subscribes.

4. An applications server as claimed in claim 1, wherein each situation is labelled with a unique identifier, the identifier consisting of the name of the situation, the name of the form of which the situation is a sub-state, and the name of the service with which the form is to be associated at run-time.

5. An applications server as claimed in claim 1, wherein each grammar rule is labelled with a unique identifier, the identifier consisting of the name of the rule and the name of the service with which the rule is to be associated at run-time.

6. An applications server as claimed in claim 1, wherein each situation has associated therewith the user commands to be recognized, and the conditions to be satisfied, in order for the state machine engine to consider that state for selection.

7. An applications server as claimed in claim 1, wherein each situation has associated therewith instructions for enabling transitions to the next state, some of the possible instructions including,

an instruction to make a transition to a different user interface form, or

an instruction to perform a recognition operation with respect to a specified grammar rule or rules, the grammar rule or rules determining the set of possible user commands to be recognized, the set of possible user commands determining the possible transitions to a next state.

8. An applications server as claimed in claim 1, wherein the state machine engine is operable to determine the next state in the state machine by filtering all eligible states with respect to the user commands which were recognized, and also with respect to the situation conditions that are satisfied, and finally, if the filtering does not result in the selection of a unique state, applying a tie-breaker algorithm to select a single state from among the states resulting from the filtering process.

9. An applications server as claimed in claim 1, wherein the state machine is defined using a mark-up language, the mark-up language including

a form instruction for defining the form of the state within the corresponding service, each form instruction providing the logical conditions for changing to the following state,

a situation instruction for defining the sub-states of a form within a corresponding service, each situation instruction providing the logical conditions for the state machine engine to consider selecting that situation as the current state.

10. An applications server as claimed in claim 1, comprising a prompt selection engine operable to execute a prompt selection rule set to provide audio prompts for prompting the commands from the user in accordance with the rules, wherein the rules determine the prompt to be selected in accordance with a current state of the state machine, the rules being evaluated at run-time.

11. An applications server as claimed in claim 1, wherein the command recognition engine is operable to determine a confidence level for the estimated user command, the state machine identifying the change of state from the estimated user command in combination with the determined confidence level, with respect to the conditions for specifying the next state identified by one or more of the situations within a form of the current state.

12. An applications server as claimed in claim 11, wherein the user commands include voice commands, the command recognition processor including a command analyser operable in response to signals received from a speech recognition processor to generate confidence levels for the estimate of a command provided by the user, the possible user commands being possible voice commands.

13. An applications server as claimed in claim 1, wherein the application program is operable to generate a mark-up language page in accordance with a current state of the application program as determined by the state machine, the mark-up language page including universal resource locations (URLs), one or more of the universal resource locators defining a location for data files providing the audio prompts, and one or more of the universal resource locators defining grammars to be generated.

14. An applications server as claimed in claim 1, wherein the applications server is coupled to a system, the system comprising

a telephony platform and a user equipment, the user equipment being operable to receive data representative of audio signals from the telephony platform, the telephony platform generating the audio signal data in accordance with the service being provided, the user equipment generating audio signals for the user,

to receive commands from the user, and

to communicate the commands to the telephony platform.

15. A method of providing a plurality of modular user driven services using an application program run by an applications server, the modular user driven services being provided in response to user commands for selecting service options, the method comprising

determining a current state of the application program from one of a pre-determined set of states defining a logical procedure through the user selected service options, the states of the application program including for each of the modular services, one or more states associated with one or more forms within the service, each form defining a state of a user interface for providing the services to the user, and each state including one or more sub-states representing situations, defining the commands to be recognised and the conditions to be satisfied to select that state depending upon the estimated user commands and the session state of the user session,

providing a set of possible user commands which may be provided for a particular state, the possible commands determining the states which may be reached from the current state,

providing in response to a received user command an estimate of at least one of the possible commands, which the user may have provided, and

changing from a current state to another of the states of the application program in response to the estimated user command, wherein the determining the current state of the application program includes

determining at run-time the set of eligible states and the possible transitions between the states, and the providing the set of possible user commands includes

adapting the possible user commands to be recognised for a current state in association with the state transitions determined at run-time.

16. A method as claimed in claim 15, wherein the determining at run-time the set of eligible states for a given user comprises

adding to the set all the situations of the current form contained in the modular service package of the service with which the current form is associated,

adding to the set all the situations associated with the current form contained in the modular service packages of services other than the service with which the current form is associated,

adding to the set all the situations of all global forms, taking into account situations contained in the modular service packages of all services that contribute situations to global forms,

finally, removing from the set all situations except those contained in the modular service packages of the services to which the user subscribes.

17. A method as claimed in claim 16, wherein the determining the possible transitions between states at run-time comprises for each situation in the set of eligible states examining the transition instructions associated with the situation,

if the transition instruction specifies a transition to a different form, establishing a possible transition between the situation and the initial situation of the different form,

if the transition instruction specifies a recognition operation with respect to a grammar rule or rules, establishing possible transitions between the situation and all the situations in the same form, and in all global forms, whose form state matches one or more of the possible user commands that can be recognized.

18. A method as claimed in claim 15, wherein each situation has associated therewith the user commands to be recognized, and the conditions to be satisfied, in order for the state machine to consider that state for selection.

19. A method as claimed in claim 18, wherein the determining the next state of the state machine comprises

determining the next state in the state machine by filtering all eligible states with respect to the user commands which were recognized, and also with respect to the situation predicates that are satisfied, and finally, if such filtering does not result in the selection of a unique state, applying a tie-breaker algorithm to select a single state from among the states resulting from the filtering process.

20. A computer program stored on a computer readable medium which when loaded onto a data processor causes the data processor to perform a method of providing a plurality of modular user driven services using an application program run by an applications server, the modular user driven services being provided in response to user commands for selecting service options, the method comprising

determining a current state of the application program from one of a pre-determined set of states defining a logical procedure through the user selected service options, the states of the state machine including for each of the modular services, one or more states associated with one or more forms within the service, each form defining a state of a user interface for providing the services to the user, and each state including one or more situations defining the commands to be recognized and the conditions to be satisfied to select that state depending upon the estimated user commands and the session state of the user session,

providing grammar rules to establish a set of possible user commands which may be provided for a particular state, the possible commands determining the states which may be reached from the current state,

providing in response to a received user command an estimate of at least one of the possible commands, which the user may have provided, and

changing from a current state to another of the states of the application program in response to the estimated user command, wherein the determining the current state of the application program includes

determining at run-time the set of eligible states and the possible transitions between the states, and the providing the set of possible user commands includes

adapting the possible user commands to be recognized for a current state in association with the state transitions determined at run-time.