Abstract: Methods, systems and program product are disclosed for determining a matching level of a text lookup segment with a plurality of source texts in a translation memory in terms of context. In particular, the invention determines any exact matches for the lookup segment in the plurality of source texts, and determines, in the case that at least one exact match is determined, that a respective exact match is an in-context exact (ICE) match for the lookup segment in the case that a context of the lookup segment matches that of the respective exact match. The degree of context matching required can be predetermined, and results prioritized. The invention also includes methods, systems and program products for storing a translation pair of source text and target text in a translation memory including context, and the translation memory so formed. The invention ensures that content is translated the same as previously translated content and reduces translator intervention.

Abstract: In one embodiment, the method includes receiving an audio data frame having at least first and second channels. The first and second channels are independently subdivided into blocks if the first and second channels are not correlated with each other. The first and second channels are decoded, and the subdivided blocks of the first and second channels are not interleaved if the first and second channels are independently subdivided.

Abstract: An enhancement system extracts pitch from a processed speech signal. The system estimates the pitch of voiced speech by deriving filter coefficients of an adaptive filter and using the obtained filter coefficients to derive pitch. The pitch estimation may be enhanced by using various techniques to condition the input speech signal, such as spectral modification of the background noise and the speech signal, and/or reduction of the tonal noise from the speech signal.

Abstract: A system and method is provided for handling the collation of linguistic symbols of different languages that may have various types of compressions (e.g., from 2-to-1 to 8-to-1). A symbol table of the symbols identified as Unicode code points is generated, with each symbol tagged with a highest compression type of that symbol by sorting the compression tables of the various languages. During a sorting operation with respect to a given string, the tag of a symbol in the string is checked to identify the highest compression type of compressions beginning with that symbol, and the compression tables for the language with compression types equal or lower than the highest compression type of the symbol are searched using a binary search method to find a matching compression for the symbols in the string. A common search module is used to perform binary searches through compression tables of different compression types.

Abstract: A graphical user interface for a semantic normalizer of natural language comprising: a link to a preference menu, in which a user may set the semantic normalizer to operate in a predictive or learning mode; an input textbox disposed to display user-typed text in a first font color and user-spoken text in a second font color; a semantic echo textbox disposed to display semantically normalized text in a third font color, wherein the first, second, and third font colors are different from each other; graphical buttons that are only enabled when the semantic normalizer is in learning mode, wherein the graphical buttons may be selected by the user after the user has been prompted by the semantic normalizer to verify the accuracy of the semantically normalized text, the graphical buttons comprising a “Yes” button, a “No” button, and an “Enter Correction” button.

Abstract: An audio codec system and an encoding method using the same are provided. According to the method, encoding and decoding processes are repeatedly performed so as to determine optimized coding parameters when analog audio signals being inputted are encoded. The processes of encoding and decoding inputted analog audio signals using initial coding parameters, and computing new parameters using a differential computed during the encoding process are repeatedly performed.

Abstract: The present invention is a method of database searching. First, a language is selected and elements received. The system is searched to identify a unit number associated with each element, which is linked to a data unit containing morphological variants of the element. If none are identified, the element is broken into sub-textual units that may contain a prefix, compound-prefix, and/or suffix along with a primary element. A unit number is then obtained for the primary element. If this does not result in a match, the elements may be saved in a database for further linguistic development. A unit number associated with each matched element is then chosen, and the elements contained in the data units linked to the unit numbers are compared to a database index. If an element is associated with multiple unit numbers, this process is repeated until all data units have been compared to the database.

Abstract: A bi-phase decoder suitable for use in a broadcast router and an associated method for extracting subframes of digital audio data from a stream of digital audio data. Logical circuitry within the bi-phase decoder extracts subframes of the digital audio data by constructing a transition window from an estimated bit time, sampling the stream of digital audio data using a fast clock and applying the sampled stream of digital audio data to the transition window to identify transitions indicative of preambles of the subframes of digital audio data.

Abstract: A system, method, and computer program product for domain-independent natural language understanding, including at least one of forming pairs of words and/or phrases in a sentence, wherein each word and/or phrase is paired with every other word and/or phrase; determining meanings for the words and/or phrases; assigning numeric codes that uniquely identify semantic concepts to those word and/or phrase meanings; comparing the numeric code of each word and/or phrase with each numeric code of the other word and/or phrase in the pair; selecting the pairs with the best relationships; combining highly-related pairs with other highly-related pairs to form longer groups of words; exchanging numeric codes for the longer groups with numeric codes having a weaker relationship to determine if the exchanged numeric codes provide an overall stronger relationship; and forming longer and longer groups until the sentence is understood.

Abstract: A speech recognition apparatus equipped with the garbage acoustic model storage unit storing the garbage acoustic model which learned the collection of unnecessary words. A feature value calculation unit calculates the feature parameter necessary for recognition by acoustically analyzing the unidentified input speech including the non-language speech per frame which is a unit for speech analysis. A garbage acoustic score calculation unit calculates the garbage acoustic score by comparing the feature parameter and the garbage acoustic model, and a garbage acoustic score correction unit corrects the garbage acoustic score calculated by the garbage acoustic score calculation unit so as to raise it in the frame where the non-language speech is inputted.

Abstract: A voice and musical tone coding apparatus is provided that can perform high-quality coding by executing vector quantization taking the characteristics of human hearing into consideration. In this voice and musical tone coding apparatus, a quadrature transformation processing section (201) converts a voice and musical tone signal from time components to frequency components. An auditory masking characteristic value calculation section (203) finds an auditory masking characteristic value from a voice and musical tone signal. A vector quantization section (202) performs vector quantization changing a calculation method of a distance between a code vector found from a preset codebook and a frequency component based on an auditory masking characteristic value.

Abstract: Method and system for measuring transmission quality of an audio transmission system under test. Specifically, an input signal (X), such as an original input speech signal, is applied to the audio transmission system which results in an output signal (Y) produced by the transmission system. Both signals X and Y are mutually processed to yield a perceived quality signal. In accordance with the invention, output signal Y and/or input signal X are scaled such that, depending on a ratio of power of these two signals, relatively small deviations of power between these signals are compensated, while relatively larger deviations are only partially compensated. Further, an artificial reference speech signal may be created for which noise levels present in the input speech signal are reduced by a scale factor which reflects a local level of the noise in that input signal.

Abstract: A method for the rapid, dynamic conversion of Pin Yin words is disclosed. The present invention comprises a web-based computer program. The user identifies an input which may be a hybrid or unaccented Pin Yin word. The character is translated dynamically into an accented Pin Yin word, a Simplified Chinese character or a Traditional Chinese character. The translated character is then displayed. The translation is done in the web page without a round trip to the server.

Abstract: In accordance with the present invention, computer implemented methods and systems are provided for representing and modeling the temporal structure of audio signals. In response to receiving a signal, a time-to-frequency domain transformation on at least a portion of the received signal to generate a frequency domain representation is performed. The time-to-frequency domain transformation converts the signal from a time domain representation to the frequency domain representation. A frequency domain linear prediction (FDLP) is performed on the frequency domain representation to estimate a temporal envelope of the frequency domain representation. Based on the temporal envelope, one or more speech features are generated.

Abstract: Techniques are provided for segmenting text into categorized discourse constituents and attaching discourse constituents into a structural representation of discourse. Techniques for determining hybrid structural and non-structural summaries of a text are also provided. A text is segmented based on a theory of discourse analysis into at least a main discourse constituent containing spatio-temporal information about a single event in a possible world view. The discourse constituents are then inserted into a structural representation of discourse. Non-structural techniques are used to determine relevance scores and important discourse constituents are determined. Relevance scores are percolated through the structural representation of discourse to determine supporting preceding discourse constituents that preserve grammaticality. A hybrid text summary is then determined based on the structural representation of the discourse and relevance scores.

Abstract: A segment set before updating is read, and clustering considering a phoneme environment is performed to it. For each cluster obtained by the clustering, a representative segment of a segment set belonging to the cluster is generated. For each cluster, a segment belonging to the cluster is replaced with the representative segment so as to update the segment set.

Abstract: A method and product are provided that identify properly spelled words from an input string. Separate lexical entries are identified for different parts of an input word. Grammatical information associated with one of the lexical entries is examined to determine if it satisfies a grammatical constraint associated with another of the lexical entries. A properly spelled word is formed by combining the separate lexical entries if the grammatical information satisfies the constraint. Under some embodiments of the invention, the separate lexical entries are identified by performing a first search of a lexicon using a first part of the input string and by performing a second search of the lexicon using a second part of the input string.

Abstract: A method and apparatus for identifying a semantic structure from an input text forms at least two candidate semantic structures. A semantic score is determined for each candidate semantic structure based on the likelihood of the semantic structure. A syntactic score is also determined for each semantic structure based on the position of a word in the text and the position in the semantic structure of a semantic entity formed from the word. The syntactic score and the semantic score are combined to select a semantic structure for at least a portion of the text. In many embodiments, the semantic structure is built incrementally by building and scoring candidate structures for a portion of the text, pruning low scoring candidates, and adding additional semantic elements to the retained candidates.

Abstract: Differential dynamic content delivery including providing a session document for a presentation, wherein the session document includes a session grammar and a session structured document; selecting from the session structured document a classified structural element in dependence upon user classifications of a user participant in the presentation; presenting the selected structural element to the user; streaming presentation speech to the user including individual speech from at least one user participating in the presentation; converting the presentation speech to text; detecting whether the presentation speech contains simultaneous individual speech from two or more users; and displaying the text if the presentation speech contains simultaneous individual speech from two or more users.

Abstract: A method for specifying equivalence of language grammars and automatically translating sentences in one language to sentences in another language in a computer environment. The method uses a unified grammar specification of grammars of different languages in a single unified representation of all the individual grammars where equivalent production rules of each of the grammars are merged into a single unified production rule. This method can be used to represent the equivalence of computer languages like high level language, assembly language and machine language and for translating sentences in any of these languages to another language.