Abstract: Embodiments of the present invention relate to a method and system for augmenting a training database of an automated language-understanding system. In one embodiment, a training example in a first language may be received from the training database. The first language-training example may be translated to a second language output. The second language output may be translated to a first variant of the first language-training example. An action pair including the first variant of the first language-training example and an action command associated with the first language-training example may be stored in an augmented training database.

Abstract: The invention relates to a method for defining a sequence of sound modules for synthesis of a speech signal in a tonal language corresponding to a sequence of speech modules. The method according to the invention differs from known methods in that the speech modules represent triphones, which each comprise one phoneme with the respective context, and with syllables in the tonal language being composed of one or more triphones. This results in a high level of flexibility for the synthesis of tonal languages.

Abstract: An authoring tool (or process) to facilitate the performance of an annotation function and an indexing function. The annotation function may generate informational annotations and word annotations to a database design schema (e.g., an entity-relationship diagram or “ERD”). The indexing function may analyze the words of the annotations by classifying the words in accordance with a concordance and dictionary, and assign a normalized weight to each word of each of the annotations based on the classification(s) of the word(s) of the annotation. A query translator (or query translation process) to (i) accept a natural language query from a user interface process, (ii) convert the natural language query to a formal command query (e.g., an SQL query) using the indexed annotations generated by the authoring tool and the database design schema, and (iii) present the formal command query to a database management process for interrogating the relational database.

Abstract: A method factors an ambiguous finite state transducer (FST) into two finite state transducers. The first FST is functional (i.e., unambiguous). The second FST retains the ambiguity of the original FST but is fail-safe (i.e., no failing paths) when applied to the output of the first FST. That is, the application of the second FST to an input string never leads to a state that does not provide a transition for the next symbol in the input. Subsequently, the first FST can be factorized into a left-sequential FST and a right-sequential FST that jointly represent a bi-machine.

Abstract: A method factors an input finite state transducer (FST) with unknown symbols into a left-sequential FST and a right-sequential FST while avoiding direct factorization of the unknown symbols. The left-sequential FST is formed by replacing each occurrence of the unknown symbol in the input FST with a sequence of the unknown symbol and a diacritic. The right-sequential FST is formed by replacing each occurrence of the diacritic with a symbol representative of an empty string and an output symbol.