Patent US6356869B1 successfully refreshed from Google Patents.
US6356869B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for discourse management
Assignee: Avaya Inc
•
Filing: 1999-04-30
•
Granted: 2002-03-12
•
Expires: 2019-04-30
Abstract
Abstract The invention relates to a system for providing a dialogue enabled speech application system, more particularly to a system apparatus and method for providing a mixed-initiative dialog with a user. The invention provides a discourse manager unit utilizing a dynamic finite-state machine that allows the creation of temporary transitions to accommodate a given context of the conversation without leading to an explosion in the number of finite-state machine states. The invention is particularly useful for use in natural-dialogue speech applications in particular for allowing users to perform actions by simply providing information to the system through spoken request.
Inventors
- 👤 Nicolas Chapados
- 👤 Peter R. Stubley
- 👤 Claudia Pateras
- 👤 Réal R. Tremblay
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 15:40
CPC Classifications
G; G10; G10L; G10L15/00; G10L15/22
Claims Analysis
Total Claims: 31
Claim 1
Independent Claim
170 words
A discourse management apparatus, said apparatus comprising: an input for receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; a processing unit coupled to said input for processing said signals, said processing unit being operative to implement a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; said processing unit being responsive to an information data element in a first signal applied to said input for enabling a sub-set of said set of transitions; said processing unit processing an information data element in a second signal applied to said input subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; said processing unit having an output, said processing unit being operative to generate a signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
Claim 2
Dependent Claim
170 words
A discourse management apparatus, said apparatus comprising: an input for receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; a processing unit coupled to said input for processing said signals, said processing unit being operative to implement a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; said processing unit being responsive to an information data element in a first signal applied to said input for enabling a sub-set of said set of transitions; said processing unit processing an information data element in a second signal applied to said input subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; said processing unit having an output, said processing unit being operative to generate a signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
Claim 3
Dependent Claim
33 words
An apparatus as defined in claim 1 , wherein the evolution of said finite state machine in response to said signals applied to said input define a context associated to the certain task.
Claim 4
Dependent Claim
37 words
An apparatus as defined in claim 2 , wherein said processing unit includes an expectation handling unit for processing the signals applied to the input on the basis of said context to derive context dependent data items.
Claim 5
Dependent Claim
29 words
An apparatus as defined in claim 3 , wherein said expectation handling unit makes use of a plurality of context dependent remapping rules to generate context dependent data items.
Claim 6
Dependent Claim
32 words
An apparatus as defined in claim 3 , wherein said processing unit is operative to cause said finite state machine to evolve at least in part on the context dependent data items.
Claim 7
Dependent Claim
39 words
An apparatus as defined in claim 4 , wherein said processing unit further comprises a prompt generator for generating a prompt signal, said processing unit further including an output for releasing the prompt signal for communication to the user.
Claim 8
Dependent Claim
28 words
An apparatus as defined in claim 6 , wherein said prompt generator is operative to generate said context dependent remapping rules on the basis of said prompt signal.
Claim 9
Dependent Claim
18 words
An apparatus as defined in claim 1 , wherein said transition set includes transitions that are permanently enabled.
Claim 10
Dependent Claim
33 words
An apparatus as defined in claim 2 , wherein said processing unit is operative to cause said finite state machine to evolve at least in part on the basis of context-dependent transition rules.
Claim 11
Dependent Claim
39 words
An apparatus as defined in claim 9 , wherein said processing unit further comprises a prompt generator for generating a prompt signal, said processing unit further including an output for releasing the prompt signal for communication to the user.
Claim 12
Dependent Claim
28 words
An apparatus as defined in claim 10 , wherein said prompt generator is operative to generate said context dependent transition rules on the basis of said prompt signal.
Claim 13
Dependent Claim
65 words
An apparatus as defined in claim 1 , comprising: a processor; a computer readable storage medium coupled to said processor, said computer readable storage medium comprising a program element for execution by said processor for implementing said processing unit, said computer readable storage medium comprising a plurality of data storage locations associated to respective functional states for storing data relative to the associated functional state.
Claim 14
Dependent Claim
38 words
An apparatus as defined in claim 1 , wherein at least some of said functional states are grouped into subsets, functional states in one of said subsets being linked to other functional states by a common wildcard transition.
Claim 15
Independent Claim
133 words
A method for performing discourse management, said method comprising: receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; implementing a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; processing an information data element in a first signal applied to said input to enable a sub-set of said set of transitions; processing an information data element in a second signal applied to said input subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; generating an output signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
Claim 16
Independent Claim
133 words
A method for performing discourse management, said method comprising: receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; implementing a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; processing an information data element in a first signal applied to said input to enable a sub-set of said set of transitions; processing an information data element in a second signal applied to said input subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; generating an output signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
Claim 17
Dependent Claim
29 words
A method as defined in claim 14 , wherein the evolution of said finite state machine in response to said signals defines a context associated to the certain task.
Claim 18
Dependent Claim
28 words
A method as defined in claim 15 , further comprising the step of processing the signals on the basis of said context to derive context dependent data items.
Claim 19
Dependent Claim
31 words
A method as defined in claim 16 , wherein said context dependent data items are derived at least in part on the basis of a plurality of context dependent remapping rules.
Claim 20
Dependent Claim
27 words
A method as defined in claim 16 , wherein said finite state machine evolves at least in part on the basis of said context dependent data items.
Claim 21
Dependent Claim
27 words
A method as defined in claim 17 , further comprising the step of generating a prompt signal and releasing the prompt signal for communication to the user.
Claim 22
Dependent Claim
26 words
A method as defined in claim 19 , further comprising the step of generating said context dependent remapping rules on the basis of said prompt signal.
Claim 23
Dependent Claim
18 words
A method as defined in claim 14 , wherein said transition set includes transitions that are permanently enabled.
Claim 24
Dependent Claim
31 words
A method as defined in claim 15 , further comprising the step of causing said finite state machine to evolve at least in part on the basis of context-dependent transition rules.
Claim 25
Dependent Claim
27 words
A method as defined in claim 22 , further comprising the step of generating a prompt signal and releasing the prompt signal for communication to the user.
Claim 26
Dependent Claim
25 words
A method as defined in claim 23 , further comprising the step of generating context dependent transition rules on the basis of said prompt signal.
Claim 27
Dependent Claim
38 words
A method as defined in claim 14 , wherein at least some of said functional states are grouped into subsets, functional states in one of said subsets being linked to other functional states by a common wildcard transition.
Claim 28
Dependent Claim
12 words
A computerized reservation system comprising the apparatus defined in claim 1 .
Claim 29
Dependent Claim
67 words
A natural-dialogue speech application system comprising: an input for receiving a first signal representative of a spoken utterance; a speech recognition unit for processing the first signal to derive a sequence of word potentially corresponding to the spoken utterance; a natural language understanding unit being operative to process said sequence of words to derive summary data elements; a discourse management unit as defined in claim 1 .
Claim 30
Dependent Claim
155 words
A discourse management apparatus, said apparatus comprising: means for receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; processing means coupled to said input for processing said signals, said processing means being operative to implement a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; said processing means being responsive to an information data element in a first signal for enabling a sub-set of said set of transitions; said processing means processing an information data element in a second signal received subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; said processing means being operative to generate a signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
Claim 31
Dependent Claim
155 words
A discourse management apparatus, said apparatus comprising: means for receiving successively signals representative of information data elements relating to a certain task a user is desirous of achieving; processing means coupled to said input for processing said signals, said processing means being operative to implement a finite state machine capable to acquire a plurality of functional states linked by transitions, said transitions forming a set; said processing means being responsive to an information data element in a first signal for enabling a sub-set of said set of transitions; said processing means processing an information data element in a second signal received subsequently to said first signal to cause said finite state machine to evolve by following at least one of said transitions in said sub-set of transitions; said processing means being operative to generate a signal having a practical utility in achieving the certain task when the finite state machine evolves to a given state.
References Cited (Backward Citations)
US5222188A
Cited
US5477451A
Cited
US5768603A
Cited
US5805832A
Cited
US5510981A
Cited
US5615296A
Cited
US5913062A
Cited
US5610812A
Cited
US5848389A
Cited
US6044347A
Cited
US6154722A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-03-11 | 2005-09-10 | 2006-03-12 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-03-11 | 2009-09-10 | 2010-03-12 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-03-11 | 2013-09-10 | 2014-03-12 | $7700.00 | Window Closed / Lapsed |