Abstract: Methods and systems for indexing document passages are presented. In some embodiments, a computing device may identify a plurality of documents that comprise a plurality of passages. A passage index comprising a plurality of entries may be generated. Each entry may comprise keywords from a passage of the plurality of passages in one of the plurality of documents. Each entry may further comprise at least one annotation associated with the passage. A search query comprising at least one search keyword may be received. The passage index for each document of the plurality of documents may be analyzed using the at least one search keyword to identify at least one passage from the plurality of documents that matches the search query. In response to the query, the at least one passage may be presented.

Abstract: Methods and systems for indexing document passages are presented. In some embodiments, a computing device may identify a plurality of documents that comprise a plurality of passages. A passage index comprising a plurality of entries may be generated. Each entry may comprise keywords from a passage of the plurality of passages in one of the plurality of documents. Each entry may further comprise at least one annotation associated with the passage. A search query comprising at least one search keyword may be received. The passage index for each document of the plurality of documents may be analyzed using the at least one search keyword to identify at least one passage from the plurality of documents that matches the search query. In response to the query, the at least one passage may be presented.

Abstract: A method of semi-supervised synonym inference for a call handling application, such as automated directory assistance or call routing, is described. In one embodiment the method comprises examining a database of caller interaction results from a directory assistance system that includes an automated directory assistance engine, detecting a specified characteristic in the caller interaction results, and using the detected characteristic to automatically train a destination map, where the destination map is for use by the automated directory assistance engine in automatically mapping human speech to a destination. The detecting of the specified characteristic in the caller interaction results may include a statistical analysis of the caller interaction results for each of one or more speech recognition strings.

Abstract: A method of semi-supervised synonym inference for a call handling application, such as automated directory assistance or call routing, is described. In one embodiment the method comprises examining a database of caller interaction results from a directory assistance system that includes an automated directory assistance engine, detecting a specified characteristic in the caller interaction results, and using the detected characteristic to automatically train a destination map, where the destination map is for use by the automated directory assistance engine in automatically mapping human speech to a destination. The detecting of the specified characteristic in the caller interaction results may include a statistical analysis of the caller interaction results for each of one or more speech recognition strings.

Abstract: A method of semi-supervised synonym inference for a call handling application, such as automated directory assistance or call routing, is described. In one embodiment the method comprises examining a database of caller interaction results from a directory assistance system that includes an automated directory assistance engine, detecting a specified characteristic in the caller interaction results, and using the detected characteristic to automatically train a destination map, where the destination map is for use by the automated directory assistance engine in automatically mapping human speech to a destination. The detecting of the specified characteristic in the caller interaction results may include a statistical analysis of the caller interaction results for each of one or more speech recognition strings.

Abstract: A method of semi-supervised synonym inference for a call handling application, such as automated directory assistance or call routing, is described. In one embodiment the method comprises examining a database of caller interaction results from a directory assistance system that includes an automated directory assistance engine, detecting a specified characteristic in the caller interaction results, and using the detected characteristic to automatically train a destination map, where the destination map is for use by the automated directory assistance engine in automatically mapping human speech to a destination. The detecting of the specified characteristic in the caller interaction results may include a statistical analysis of the caller interaction results for each of one or more speech recognition strings.

Abstract: A system and method for continuous speech recognition (CSR) is optimized to reduce processing time for connected word grammars bounded by semantically null words. The savings, which reduce processing time both during the forward and the backward passes of the search, as well as during rescoring, are achieved by performing only the minimal amount of computation required to produce an exact N-best list of semantically meaningful words (N-best list of salient words). This departs from the standard Spoken Language System modeling which any notion of meaning is handled by the Natural Language Understanding (NLU) component. By expanding the task of the recognizer component from a simple acoustic match to allow semantic information to be fed to the recognizer, significant processing time savings are achieved, and make it possible to run an increased number of speech recognition channels in parallel for improved performance, which may enhance users perception of value and quality of service.

Abstract: The invention relates to a system for providing a dialogue enabled speech application system, more particularly to a system apparatus and method for providing a mixed-initiative dialog with a user. The invention provides a discourse manager unit utilizing a dynamic finite-state machine that allows the creation of temporary transitions to accommodate a given context of the conversation without leading to an explosion in the number of finite-state machine states. The invention is particularly useful for use in natural-dialogue speech applications in particular for allowing users to perform actions by simply providing information to the system through spoken request.

Abstract: A system and method for continuous speech recognition (CSR) is optimized to reduce processing time for connected word grammars bounded by semantically null words. The savings, which reduce processing time both during the forward and the backward passes of the search, as well as during rescoring, are achieved by performing only the minimal amount of computation required to produce an exact N-best list of semantically meaningful words (N-best list of salient words). This departs from the standard Spoken Language System modeling which any notion of meaning is handled by the Natural Language Understanding (NLU) component. By expanding the task of the recognizer component from a simple acoustic match to allow semantic information to be fed to the recognizer, significant processing time savings are achieved, and make it possible to run an increased number of speech recognition channels in parallel for improved performance, which may enhance users perception of value and quality of service.

Abstract: Comparing a series of observations representing unknown speech, to stored models representing known speech, the series of observations being divided into at least two blocks each comprising two or more of the observations, is carried out in an order which makes better use of memory. First, the observations in one of the blocks are compared (31), to a subset comprising one or more of the models, to determine a likelihood of a match to each of the one or more models. This step is repeated (33) for models other than those in the subset; and the whole process is repeated (34) for each block.

Abstract: In a lossless compression algorithm, the left most point of a current interval, i.e., the code point is updated by using a code point updating device which handles inputs identified by R and X, and uses two registers. The first of the two register is an interval width register, and the second is a code point register. The updating device comprises a grid of n.times.n cells chosen from four basic component cells, i.e.,(i) above diagonal cells designated "ad" and located above the principal diagonal of the grid,(ii) diagonal cells designated "d" and located on the principal diagonal, incorporating and adder (31) and a multiplexer (30) and at least one register (32);(iii) a single cell designated "fd" for "final diagonal", located at the bottom end of the diagonal and incorporating an adder (31) a multiplexer (30) and at least one register (32), and(iv) output retiming cells designated "or", incorporating a register (35).

Abstract: The present invention relates to an interval width update process in arithmetic coding, characterized in thata set of values ={A[0],A[1], . . . ,A[r-1]}, is selected and the interval width is maintained as an index Wi in said set,a single table lookup simultaneously updates the interval width and supplies the augend and shift by performing the following operation:(Wi+1, Xi, Ri)=.function."(Si, Wi)in which the function .function." is implemented by a single table lookup, in which p(Si) and P(Si) are determined from Si, A[Wi] is determined from Wi, p(Si).multidot.A[Wi] and Ri=P(Si).multidot.A[Wi] are computed, the shift Xi necessary for representing p(Si).multidot.A[Wi].multidot.2.sup.Xi in is determined. Wi+1 is determined in such a way that A[Wi+1] is the best representative of p(Si).multidot.A[Wi].multidot.2.sup.Xi, followed by return to Wi+1, Xi and Ri.