154 results about "Language representation" patented technology

Techniques for enhanced linguistic transformation are disclosed. For example, a method of linguistic transformation includes the steps of providing at least one input to a plurality of modules, wherein at least one module has a different configuration than at least another module, obtaining at least one output from each of at least a subset of the plurality of modules, and generating a set of distinct outputs. The input and the output include linguistic representations and at least a portion of the output is a result of applying one or more linguistic transformations to at least a portion of the input. Techniques for displaying a plurality of results so as to emphasize component-level differences are also disclosed. By way of example, a method of displaying a plurality of results includes the steps of determining at least one primary result within the plurality of results; displaying the at least one primary result with at least a first set of color attributes; and displaying at least one alternative result with at least a second set of color attributes. Each result represents an application of at least one linguistic transformation to a common input and each result comprises a plurality of components.

The apparatus and methods for using earcons as user prompts in mobile communication devices described herein are directed to implementing a mode of communication in these communication devices having speech recognition capabilities wherein spoken prompts are disabled and replaced with short identifiable sound prompts such as the earcons. In general, according to one aspect of the invention, a method for operating a communication device that includes speech recognition capabilities, comprises implementing on the device a user interface that employs a plurality of different user prompts, wherein each user prompt is for soliciting a corresponding spoken input from the user or informing the user about an action or state of the device; implementing on the device a plurality of different earcons, each earcon being mapped to a corresponding different one of the plurality of user prompts; and when any selected one of said plurality of user prompts is issued by the user interface on the device, generating the earcon that is mapped to the selected user prompt. Each prompt of the plurality of user prompts has a corresponding language representation and wherein generating the earcon for the selected user prompts includes generating the corresponding language representation through the user interface.

An automated name searching system incorporates an automatic name classifier and a multi-path architecture in which different algorithms are applied based on cultural identity of the query name. The name classifier operates with a preemptive list, analysis of morphological elements, length, and linguistic rules. A name regularizer produces a character based computational representation of the name. A pronunciation equivalent representation such as an IPA language representation, and language specific rules to generate name searching keys, are used in a first pass to eliminate database entries which are obviously not matches for the query name. The methods can also be implemented as a callable set of library routines including an intelligent preprocessor and a name evaluator that produces a score comparing a query name and database name, based on a variety of user-adjustable parameters. The user-controlled parameters permit tuning of the search methodologies for specific custom applications.

An optimizer/normalizer is used to generate optimized intermediate language representation of an input query, such as an XML input query. A method of optimization of an input query in intermediate language form includes receiving the input query, examining the nodes in a left-depth first manner to identify code patterns and node types which are subjects for optimization, tagging the identified code patterns until the intermediate language representation of the input query has been examined in its entirety, searching from the top of the intermediate language representation for tagged code patterns, and adjusting the tagged code patterns with improved code patterns to form an optimal representation for an input query. The input to the optimizer/normalizer is assumed to be an input query transformed into an intermediate language representation containing code patterns and nodes, each node having a respective node type.

A data representation language representation of the state of a process executing on a client or service in a distributed computing environment may be created. The representation may include a computation state of the device and/or virtual machine on which the process is executing, wherein the computation state of the device and/or virtual machine comprises information about the execution state of the process on the device and/or virtual machine. A process state may include, but is not limited to: threads, all objects referenced by the threads, transient variables created during the execution of the process, objects and their data, etc. In one embodiment, data describing one or more leases representing grants of access to external services, obtained from spaces by the process, may also be stored with the process state. The data representation language representation of the state of a process may be moved from node to node within the distributed computing environment. The representation of the state of a process may also be stored as a data representation language object in a store mechanism, and later retrieved from the store mechanism to resume the process execution on the same node or on a different node in the distributed computing environment. In one embodiment, an object compilation/decompilation process may be used in creating the representation of the state of a process and in regenerating the state of the process by decompiling the representation of the state of the process.

Systems and methods for optimizing database queries involving aggregates identify instantiations of rules in an internal language representation of the original query, and then applies the rules to those instantiations to form an optimized query execution plan.

The present invention is a sentence realization system that processes an abstract linguistic representation (ALR) of a sentence into a structure that can be fully realizable. The system includes a tree conversion component that receives the ALR and generates a basic syntax tree from the ALR. A global movement component then receives the basic syntax tree and hierarchically orders child nodes in that syntax tree relative to ancestor nodes. An intra-constituent ordering component then establishes a linear order among the nodes such that the syntax tree is fully ordered. A surface cleanup component receives the fully ordered tree and performs a number of realization operations to generate surface realizations for constituents that are still represented in an abstract way in the fully ordered syntax tree.

An inherently safe code format for representing computer programs is disclosed. The format provides incorruptible referential integrity and uses type separation to achieve intrinsic type safety. The format preserves a safety guarantee found in a source code language representation of the computer program while the computer program proceeds through various stages of the code compilation process.

An optimizing compiler and method thereof performs a sequence of optimizing changes to an intermediate language representation of a routine, and measures an execution characteristic of each optimization, such as a timing of the machine language representation performed on an architecture similar to the target machine using a user selectable initialization state. The sequence of optimizations is selected according to a criterion that includes a lexicographic search and other methods. The pre-optimized code is also broken into segments wherein discrete optimizations are performed on each segment and measured using a user provided routine. The target routine is tested with the object code in main memory if not the cache if possible and optimizations are chosen only if they improve the target subroutine according to the user defined metric. After a stopping criterion is achieved, the most optimized code is selected.

The invention discloses a speech synthesis method and device, electronic equipment and a storage medium, relates to the artificial intelligence technology, and uses the machine learning technology inartificial intelligence to carry out speech synthesis, and the method comprises the following steps: obtaining a word segmentation sequence corresponding to an input text; determining a vector sequence corresponding to the word segmentation sequence by utilizing a trained attention mechanism-based language representation model; carrying out rhythm structure prediction processing on the vector sequence by utilizing a rhythm structure model, and determining rhythm structure information which comprises pause duration and pronunciation intensity corresponding to word segmentation fragments corresponding to each feature vector in the vector sequence in the synthesized speech; and synthesizing speech corresponding to the input text according to the rhythm structure information and pronunciationcorresponding to each word segmentation fragment in the word segmentation sequence. According to the speech synthesis method and device, the electronic equipment and the storage medium provided by theinvention, the accurate and real semantics of the input text can be expressed based on the vector sequence obtained by the language representation model, so that the synthesized speech is more natural.

A method includes writing JAVA™ language source code that includes a definition of a generic class, generating an instance of the generic class; and compiling the instance of the generic class into common intermediate language code executable by a runtime engine. A system operably receives input representing a generic class definition in a JAVA™ language, receives source code that references the generic class, compiles the source code with an instance of the generic class into common intermediate language code executable by a runtime engine.

A method, system, and computer program product for selectively displaying alternative language representations of text rendered by an application executing on a computer system.

Middleware is validated using a two layered modeling strategy for the generation of test suites. A high level model of the syntax of the programming language used to program the middleware generates a series of high level abstract programs. These high level abstract programs then undergo two separate translations. First they are translated directly into actual test programs, which are expressed in the programming language of the middleware. Second, they are translated into second models of the high level abstract programs. Running the model based test generator again on the second models produces a set of suites of test cases, each test case consisting of data inputs and predicted results for one of the actual test programs. The actual test programs are run repetitively using the middleware execution engine. The results are compared with the predicted results, using a generic validation engine.

A system and method for generating a human readable, e.g. English language, description of a formal specification of network security policy that allows non-technical staff within a user's organization to comprehend the policy. The description is simple enough to be understood, yet captures salient details of the policy.

A device stores one or more compression rules for an action language. Upon receipt of a signal from a tag (such as an RFID tag, a visual tag, or an audio tag), a compressed data stream corresponding to the tag is decoded from the signal. Based on the one or more compression rules, one or more action parameters are derived from the compressed data stream. With these parameters, a corresponding action is performed. The action may include communicating across a wireless communications network as well as obtaining content from a remote content provider. Also the action may include storing data, such as a contact entry, or a calendar event.

The invention discloses an event-structure-based Chinese statement analysis method, which is used for expressing a Chinese statement into a tree structure consisting of a plurality of event designators and event characters comprising event character uncorrelated components corresponding to the event designators. The method comprises the following analysis steps of first preprocessing the Chinese statement; then performing event-structure-based Chinese statement analysis, finding the event designators in the statement and the event characters corresponding to the event designators, and analyzing multi-character components and the event character uncorrelated components; and finally labeling each statement component, adding function descriptions of each component, and giving a parenthesis representation form of a tree representation structure. The method is more applied to Chinese syntactic analysis, relationships between event elements are reflected, support is provided for semantic synthesis, and a language representation method and representation rules of an event can be reflected. According to the method, the event designators which are not verbs can be processed, and semantic functions of modifiers, prepositions, conjunctions and other components can be described.