Information processing device, information processing method, computer program product, and recognition system

A recognition system comprising an information processing device and a recognition device, wherein:

• the information processing device comprising:
• one or more first processors electrically coupled to a first memory and configured to:
• convert a phonetic symbol sequence of an added word into an HMM state sequence in which states of the HMM are aligned;
• convert the HMM state sequence into a score vector sequence indicating a degree of similarity to a specific pronunciation using a similarity matrix defining similarity between the states of the HMM;
• and
• search for a path having a better score for the score vector sequence than a score of other paths out of paths included in a search network and output a phonetic symbol sequence corresponding to the path that is searched for, wherein:
• the search network is a weighted finite state transducer generated using a first weighted finite state transducer having a restriction on the phonetic symbol sequence to be output, and
• the first weighted finite state transducer receives, when N (N is an integer of 1 or larger) is the number of types of phonetic symbol, the phonetic symbol sequence alone in which the number of types of the phonetic symbol sequence having a length of M (M is an integer of 1 or larger) is smaller than NM, and
• the recognition device comprising:
• one or more second processors electrically coupled to a second memory and configured to:
• set the phonetic symbol sequence output by the one or more first processors as a phonetic symbol sequence of the added word;
• and
• register the added word as a word to be recognized.

An information processing method comprising:

• converting a phonetic symbol sequence into an HMM state sequence in which states of the HMM are aligned;
• converting the HMM state sequence into a score vector sequence indicating a degree of similarity to a specific pronunciation using a similarity matrix defining similarity between the states of the HMM;
• and
• searching for a path having a better score for the score vector sequence than a score of other paths out of paths included in a search network and outputting a phonetic symbol sequence corresponding to the path that is searched for, wherein:
• the search network is a weighted finite state transducer generated using a first weighted finite state transducer having a restriction on the phonetic symbol sequence to be output, and
• the first weighted finite state transducer receives, when N (N is an integer of 1 or larger) is the number of types of phonetic symbol, the phonetic symbol sequence alone in which the number of types of the phonetic symbol sequence having a length of M (M is an integer of 1 or larger) is smaller than NM.