Systems and methods for generating markup-language based expressions from multi-modal and unimodal inputs
First Claim
1. A method comprising:
- generating, via a processor, from an input lattice representing a first modality of an input, a first markup-language expression;
generating, via a finite-state transducer, a concatenated mapping, wherein the finite-state transducer;
uses the input lattice and a first finite-state machine having associated markup-language semantics to relate the first markup-language expression to a second markup-language expression representing a second modality based on a level of coincidence between the first modality and the second modality, to yield a mapping; and
concatenates input symbols of the mapping associated with the markup-language semantics, to yield the concatenated mapping;
generating, using the input and a second finite-state machine representing the concatenated mapping, a third markup-language expression; and
outputting the third markup-language expression.
4 Assignments
0 Petitions
Accused Products
Abstract
When using finite-state devices to perform various functions, it is beneficial to use finite state devices representing regular grammars with terminals having markup-language-based semantics. By using markup-language-based symbols in the finite state devices, it is possible to generate valid markup-language expressions by concatenating the symbols representing the result of the performed function. The markup-language expression can be used by other applications and/or devices. Finite-state devices are used to convert strings of words and gestures into valid markup-language, for example, XML, expressions that can be used, for example, to provide an application program interface to underlying system applications.
27 Citations
22 Claims
-
1. A method comprising:
-
generating, via a processor, from an input lattice representing a first modality of an input, a first markup-language expression; generating, via a finite-state transducer, a concatenated mapping, wherein the finite-state transducer; uses the input lattice and a first finite-state machine having associated markup-language semantics to relate the first markup-language expression to a second markup-language expression representing a second modality based on a level of coincidence between the first modality and the second modality, to yield a mapping; and concatenates input symbols of the mapping associated with the markup-language semantics, to yield the concatenated mapping; generating, using the input and a second finite-state machine representing the concatenated mapping, a third markup-language expression; and outputting the third markup-language expression. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A system comprising:
-
a processor; and a computer-readable medium storing instructions for controlling the processor to perform a method comprising; generating, from an input lattice representing a first modality of an input, a first markup-language expression; generating, via a finite-state transducer, a concatenated mapping, wherein the finite-state transducer; uses the input lattice and a first finite-state machine having associated markup-language semantics to relate the first markup-language expression to a second markup-language expression representing a second modality based on a level of coincidence between the first modality and the second modality, to yield a mapping; and concatenates input symbols of the mapping associated with the markup-language semantics, to yield the concatenated mapping; generating, using the input and a second finite-state machine representing the concatenated mapping, a third markup-language expression; and outputting the third markup-language expression. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. A computer-readable storage medium storing instructions which, when executed by a computing device, cause the computing device to perform a method comprising:
-
generating, from an input lattice representing a first modality of an input, a first markup-language expression; generating, via a finite-state transducer, a concatenated mapping, wherein the finite state transducer; uses the input lattice and a first finite-state machine having associated markup-language semantics to relate the first markup-language expression to a second markup-language expression representing a second modality based on a level of coincidence between the first modality and the second modality, to yield a mapping; and concatenates input symbols of the mapping associated with the markup-language semantics, to yield the concatenated mapping; generating, using a second finite-state machine representing the concatenated mapping and the input, a third markup-language expression; and outputting the third markup-language expression. - View Dependent Claims (17, 18, 19, 20, 21, 22)
-
Specification