Abstract: A method of processing limited natural language data to automatically develop an optimal feature set, bypassing the standard Wizard of OZ (WOZ) approach. Natural language understanding models process existing data from other domains, such as the Internet, for domain-specific adaptation through the use of an optimal feature set. When the optimal feature set is passed on to any engine, the optimal feature set produces robust models that can be used for natural language call routing.

Abstract: A system and method for real-time network communications provides a session identifier as a public key for group communication between clients, and provides a channel identifier representing a private key for each of a plurality of clients. The channel identifier includes client-specific attributes, which function to indicate grouping criteria for the group communication. A dynamic communication link is created over a network between a client and a service based upon the public and private key combination such that group communication is enabled based upon the attributes of the private key and the public key. Communications are translated using a translation service which employs the attributes associated with the private key and the public key combination to provide response information in a designated language to enable multi-lingual real-time communications.

Abstract: A method of generating a statistical machine translation database through a game in which a monolingual structure is provided to a plurality of players. A first translation attempt is received from each of the plurality of players. The first translation attempt from each of the plurality of players is compared. Feedback is provided to each of the plurality of players and the attempts are received and compared to provide feedback to iteratively converge subsequent translations from each of the plurality of players into a final translated structure.

Abstract: A system and method for real-time network communications provides a session identifier as a public key for group communication between clients, and provides a channel identifier representing a private key for each of a plurality of clients. The channel identifier includes client-specific attributes, which function to indicate grouping criteria for the group communication. A dynamic communication link is created over a network between a client and a service based upon the public and private key combination such that group communication is enabled based upon the attributes of the private key and the public key. Communications are translated using a translation service which employs the attributes associated with the private key and the public key combination to provide response information in a designated language to enable multi-lingual real-time communications.

Abstract: A communications apparatus is configured to bridge modalities and different communications formats. The apparatus may include a bridge to receive an input through a modality gateway and to deliver an output through an output channel, a communication engine configured to manipulate the input into the output, a router configured to route the configured output to a respective output channel, and a controller configured to control the bridge. The controller may determine a new modality depending on a context of the communications apparatus.

Abstract: A system and method for representing call content in a searchable database includes transcribing call content to text. The call content is projected to vector space, by creating a vector by indexing the call based on the content and determining a similarity of the call to an atomic-class dictionary. The call is classified in a relational database in accordance with the vector.

Abstract: A system and method for representing call content in a searchable database includes transcribing call content to text. The call content is projected to vector space, by creating a vector by indexing the call based on the content and determining a similarity of the call to an atomic-class dictionary. The call is classified in a relational database in accordance with the vector.

Abstract: A method of processing limited natural language data to automatically develop an optimal feature set, bypassing the standard Wizard of OZ (WOZ) approach is provided. The method provides for building natural language understanding models or for processing existing data from other domains, such as the Internet, for domain-specific adaptation through the use of an optimal feature set. Consequently, when the optimal feature set is passed on to any engine, the optimal feature set produces robust models that can be used for natural language call routing.

Abstract: A method of processing limited natural language data to automatically develop an optimal feature set, bypassing the standard Wizard of OZ (WOZ) approach is provided. The method provides for building natural language understanding models or for processing existing data from other domains, such as the Internet, for domain-specific adaptation through the use of an optimal feature set. Consequently, when the optimal feature set is passed on to any engine, the optimal feature set produces robust models that can be used for natural language call routing.

Abstract: Techniques are provided for addressing a problem pertaining to a computer of a user. In an exemplary method, the obtaining of a problem statement associated with the problem pertaining to the computer of the user is facilitated. This can be carried out via speech over a telephony connection. The establishment of a remote access connection between the computer of the user and a remote help desk application can also be facilitated. Furthermore, substantially parallel interaction with the user can be facilitated, via both the telephony connection and the remote access connection to the remote help desk application.

Abstract: The invention provides devices for the disruption of one or more layers of skin and methods of their use to administer therapeutic agents, e.g., antigens or drugs. The devices are designed to disrupt a defined area of skin. The defined area can approximate the area that a patch or other suitable vehicle for therapeutic agent, e.g., drug or vaccine, delivery is designed to contact. Exemplary devices employ a mask to define the area to be disrupted. Other devices disrupt a defined area by rotating in place. For devices that employ a mask that is secured to the skin, the invention provides methods of disrupting the stratum corneum by first securing the mask to the skin and then disrupting the skin. For rotating devices, the disrupting member is simply placed against the skin and actuated to effect disruption.

Abstract: A system and method for representing call content in a searchable database includes transcribing call content to text. The call content is projected to vector space, by creating a vector by indexing the call based on the content and determining a similarity of the call to an atomic-class dictionary. The call is classified in a relational database in accordance with the vector.

Abstract: An interactive computer system and method includes a plurality of program components hierarchically arranged. Each component provides a specific task or set of tasks responsive to information provided to the components. A dialog manager arranges the components in accordance with the tasks needed to be performed and decides an order of performance for the tasks based on user-specific usage patterns.

Abstract: Disclosed is a method of automated speaker identification, comprising receiving a sample speech input signal from a sample handset; deriving a cepstral covariance sample matrix from the first sample speech signal; calculating, with a distance metric, all distances between the sample matrix and one or more cepstral covariance signature matrices; determining if the smallest of the distances is below a predetermined threshold value; and wherein the distance metric is selected from d 5 ? ( S , ? ) = A + 1 H - 2 , d 6 ? ( S , ? ) = ( A + 1 H ) ? ( G + 1 G ) - 4 , d 7 ? ( S , ? ) = A 2 ? ? H ? ( G + 1 G ) - 1 , d 8 ? ( S , ? ) = ( A + 1 H ) ( G + 1 G ) - 1 , d 9 ? ( S , ? ) = A G + G H - 2 , fusion derivatives thereof, and fusion derivatives thereof with ? d 1 ? ( S , ? ) = A H - 1.

Abstract: In a speech recognition system, a method of transforming speech feature vectors associated with speech data provided to the speech recognition system includes the steps of receiving likelihood of utterance information corresponding to a previous feature vector transformation, estimating one or more transformation parameters based, at least in part, on the likelihood of utterance information corresponding to a previous feature vector transformation, and transforming a current feature vector based on maximum likelihood criteria and/or the estimated transformation parameters, the transformation being performed in a linear spectral domain. The step of estimating the one or more transformation parameters includes the step of estimating convolutional noise Ni? and additive noise Ni? for each ith component of a speech vector corresponding to the speech data provided to the speech recognition system.

Abstract: A method for managing dialogue interaction includes generating a hierarchical tree representation of a set of hierarchical data entities, and identifying a leaf node in the hierarchical tree representation. A system for managing dialogue interaction includes a hierarchical data format having a plurality of hierarchical data entities, and a dialogue interaction manager that manages a dialogue with a user based upon the hierarchical data format.

Abstract: Systems, methods and tools are provided for generating applications that are automatically optimized for efficient deployment in a computing environment based on parameterized criteria. In particular, systems, methods and tools for generating network applications are provided, which automatically partition a functional description of a network application into a set of application modules (e.g., pages) according to parameterized criteria that optimizes the network application for efficient network performance by minimizing application latency.

Abstract: Disclosed is a method of automated handset identification, comprising receiving a sample speech input signal from a sample handset; deriving a cepstral covariance sample matrix from said first sample speech signal; calculating, with a distance metric, all distances between said sample matrix and one or more cepstral covariance handset matrices, wherein each said handset matrix is derived from a plurality of speech signals taken from different speakers through the same handset; and determining if the smallest of said distances is below a predetermined threshold value.

Abstract: A toolkit is provided for allowing a user to represent a domain for a natural language understanding application. The toolkit allows a user to create a graph that represents a domain. An NLU parser domain may be represented by a single graph, which includes one start node and one end node. Each utterance in the domain will traverse the graph from the start node to the end node. The user may then manipulate the graph to add or delete nodes and arcs. The user may also create subgraphs for subdomains. The toolkit allows the user to merge subdomains to create a larger domain or to remove paths from a start node to an end node to remove subcomponents of a domain. The single graph approach of the present invention also provides a visual representation of a domain to assist a developer in annotating training sentences.

Abstract: Disclosed is a method of automated speaker identification, comprising receiving a sample speech input signal from a sample handset; deriving a cepstral covariance sample matrix from said first sample speech signal; calculating, with a distance metric, all distances between said sample matrix and one or more cepstral covariance signature matrices; determining if the smallest of said distances is below a predetermined threshold value; and wherein said distance metric is selected from 1 d 5 ⁡ ( S , Σ ) = A + 1 H - 2 , 2 d 6 ⁡ ( S , Σ ) = ( A + 1 H ) ⁢ ( G + 1 G ) - 4 , d 7 ⁡ ( S , Σ ) = A 2 ⁢ H ⁢ ( G + 1 G ) - 1 , d 8 ⁡ ( S , Σ ) = ( A + 1 H ) ( G + 1 G ) - 1 , 3 d 9 ⁡ ( S , Σ ) = A G + G H - 2 ,