Abstract: Disclosed methods and systems are directed to natural language understanding cache usage. The methods and systems may include receiving a first natural language input comprising a set of one or more terms, and parsing the first natural language input to determine a first pretag result comprising a first string comprising at least one term from the set of one or more terms. The methods and systems may also determine that if the first pretag result corresponds to a key stored in a cache, then retrieve one or more cached NLU results corresponding to the at least one key. The methods and systems may also determine that if the first pretag result does not correspond to a key stored in the cache, then determine, based on the set of one or more terms, a first NLU result corresponding to the first natural language input.

Abstract: Disclosed methods and systems are directed to natural language understanding cache usage. The methods and systems may include receiving a first natural language input comprising a set of one or more terms, and parsing the first natural language input to determine a first pretag result comprising a first string comprising at least one term from the set of one or more terms. The methods and systems may also determine that if the first pretag result corresponds to a key stored in a cache, then retrieve one or more cached NLU results corresponding to the at least one key. The methods and systems may also determine that if the first pretag result does not correspond to a key stored in the cache, then determine, based on the set of one or more terms, a first NLU result corresponding to the first natural language input.

Abstract: The invention concerns a synergistic fungicide and/or bactericide composition comprising dodine and a derivative of the anilino-pyrimidine family. The invention also concerns a preventive or curative method for fighting against phytopathogenic fungi and/or bacteria using such a composition.

Abstract: Speech recognition systems and methods consistent with the present invention process input speech signals organized into a series of frames. The input speech signal is decimated to select K frames out of every L frames of the input speech signal according to a decimation rate K/L. A first set of model distances is then calculated for each of the K selected frames of the input speech signal, and a Hidden Markov Model (HMM) topology of a first set of models is reduced according to the decimation rate K/L. The system then selects a reduced set of model distances from the computed first set of model distances according to the reduced HMM topology and selects a first plurality of candidate choices for recognition according to the reduced set of model distances. A second set of model distances is computed, using a second set of models, for a second plurality of candidate choices, wherein the second plurality of candidate choices correspond to at least a subset of the first plurality of candidate choices.

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.