Abstract: A speech signal is decoded by determining a production-related value for a current state based on an optimal production-related value at the end of a preceding state, the optimal production-related value being selected from a set of continuous values. The production-related value is used to determine a likelihood of a phone being represented by a set of observation vectors that are aligned with a path between the preceding state and the current state. The likelihood of the phone is combined with a score from the preceding state to determine a score for the current state, the score from the preceding state being associated with a discrete class of production-related values wherein the class matches the class of the optimal production-related value.

Abstract: A reliable full covariance matrix estimation algorithm for pattern unit's state output distribution in pattern recognition system is discussed. An intermediate hierarchical tree structure is built to relate models for product units. Full covariance matrices of pattern unit's state output distribution are estimated based on all the related nodes in the tree.

Abstract: Input is received from at least two different input sources. Information from these sources are combined together to provide a result. In a particular example, input from one source corresponds to potential recognition candidates, and input from another source corresponds to other potential candidates. These candidates are combined together to select a result.

Abstract: Systems and methods for analyzing the content of audio/video files using speech recognition and data mining technologies are provided. As it can generally be assumed that a user's interest is highly correlated with an audio/video clip or television program the user may be watching, methods and systems for utilizing the results of speech recognition and data mining technology implementation to retrieve relevant advertising content for display are also provided.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.

Abstract: A mechanism for recognizing and inputting handwritten mathematical expressions into a computer by providing a part of a multi-path framework is described. The part of the multi-path framework includes a symbol grouping and recognition component that is designed to group input strokes that correspond to a handwritten mathematical expression into a symbol and to recognize the symbol based upon information associated with the grouped input strokes. A method for grouping and recognizing symbols of a handwritten mathematical expression includes receiving a plurality of input strokes corresponding to a handwritten mathematical expression, grouping the plurality of input strokes into symbols, recognizing the symbols based upon information, such as shape and time series information, associated with the grouped input strokes. Intra-group and inter-group information associated with the plurality of input strokes may be utilized to group the input strokes.

Abstract: A mechanism for recognizing and inputting handwritten mathematical expressions into a computer by providing part of a multi-path framework is described. The part of the multi-path framework includes a subscript/superscript analysis and character determination component that is designed to identify subscript and superscript elements. A method for analyzing a handwritten mathematical expression includes receiving a symbols corresponding to handwritten mathematical expression input strokes, identifying subscript and/or superscript structures, and determining a character for each symbol of the set. A graph of vertexes and edges may be created based upon the set of symbols and the graph may be searched to determine optimized candidates.

Abstract: A mechanism for recognizing and inputting handwritten mathematical expressions into a computer by providing part of a multi-path framework is described. The part of the multi-path framework includes a subordinate sub-expression analysis component. A method for analyzing a handwritten mathematical expression for a subordinate sub-expression includes identifying sub-expressions based on dominant symbols and determining a character for potential dominant symbols based upon sub-expression information. A determination may be made whether an expression structure candidate is valid and valid expression structure candidates may be stored in a parse tree.

Abstract: A mechanism for recognizing and inputting handwritten mathematical expressions into a computer by providing a multi-path framework is described. The framework may include symbol grouping and recognition, tabular structure analysis, subordinate sub-expression analysis, subscript/superscript analysis and character determination, and semantic structure analysis components. A method for recognizing a handwritten mathematical expression includes receiving a plurality of input strokes corresponding to a handwritten mathematical expression and providing a candidate list of recognized candidate expressions based upon the input strokes. Input strokes are grouped into symbols, tabular structures are determined, dominant symbol candidates and subordinate symbols are determined, and subscript and superscript structures are determined.

Abstract: A method and apparatus are provided for refining segmental boundaries in speech waveforms. Contextual acoustic feature similarities are used as a basis for clustering adjacent phoneme speech units, where each adjacent pair phoneme speech units include a segmental boundary. A refining model is trained for each cluster and used to refine boundaries of contextual phoneme speech units forming the clusters.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.

Abstract: Systems, methods, and computer-readable media for processing electronic ink receive an electronic ink input; convert the electronic ink input to a first machine-generated object using handwriting recognition; display the first machine-generated object on a display; receive speech input; convert the speech input to a second machine-generated object using speech recognition; generate a list of machine-generated objects based on the electronic ink input, the list including the first machine-generated object and alternative machine-generated objects and functioning as a dictionary for converting the speech input; and replace the first machine-generated object with the second machine-generated object. The machine-generated objects may correspond to words, lines, and/or other groupings of machine-generated text. A user may confirm that the second machine-generated object should replace the first machine-generated object and the system will perform the replacement.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.

Abstract: A computationally efficient and robust pitch detection and tracking system and related methods are presented. According to certain exemplary implementations a method is presented comprising identifying an initial set of pitch period candidates using a first estimation algorithm, filtering the initial set of candidates and passing the filtered candidates through a second, more accurate pitch estimation algorithm to generate a final set of pitch period candidates from which the most likely pitch value is selected.