According to an embodiment, an automaton deforming device includes a transforming unit and a deforming unit. The transforming unit generates second values by transforming first values, which either represent weights assigned to transitions in a weighted finite state automaton or represent values that are transformed into weights assigned to transitions in a weighted finite state automaton, in such a way that number of elements of a set of the first values are reduced and an order of the first values is preserved. The deforming unit deforms a weighted finite state automaton in which weights according to the second values are assigned to transitions.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. An automaton deforming device comprising: a transforming unit to generate second values by transforming first values, which either represent weights assigned to transitions in a weighted finite state automaton or represent values that are transformed into weights assigned to transitions in a weighted finite state automaton, in such a way that number of elements of a set of the first values are reduced and an order of the first values is preserved; and a deforming unit to deform a weighted finite state automaton in which weights according to the second values are assigned to transitions. 2. The device according to claim 1, wherein the first values represent weights assigned to transitions in a weighted finite state automaton, and the deforming unit deforms a weighted finite state automaton in which the second values are assigned as weights to transitions. 3. The device according to claim 1, wherein the first values represent values that are set in a model which is to be transformed into a weighted finite state automaton and that represent values assigned as weights to transitions in a weighted finite state automaton at time of transforming the model into the weighted finite state automaton, the transforming unit transforms the model, in which the second values obtained from transforming the first values are set, into a weighted finite state automaton in which third values according to the second values are assigned as weights to transitions, and the deforming unit deforms the weighted finite state automaton in which the third values are assigned as weights to transitions. 4. The device according to claim 3, wherein the model is either one of a language model, a pronunciation model, a pronunciation deformation model, a character model, and a hidden Markov model. 5. The device according to claim 1, wherein expression format of the second values is different from expression format of the first values. 6. The device according to claim 5, wherein expression format of the second values is determined according to a deformation operation performed by the deforming unit. 7. The device according to claim 5, wherein the deforming unit deforms the weighted finite state automaton in such a way that expression format of post-deformation weights is same as expression format of the second values. 8. The device according to claim 5, wherein the deforming unit deforms the weighted finite state automaton by performing a deformation operation including CONV(−logb(b−x+b−y)), where x and y represent weights, b represents a positive real number other than one, and CONV represents a function for transforming weights of transitions into a predetermined expression format. 9. The device according to claim 5, wherein number of bits expressing the second values is smaller than number of bits expressing the first values. 10. The device according to claim 5, wherein the expression format of the first values is floating-point format, and the expression format of the second values is integer format. 11. The device according to claim 5, wherein the expression format of the first values is floating-point format, and the expression format of the second values is fixed-point format. 12. The device according to claim 5, wherein the transforming unit performs constant multiplication of the first values and then transforms the first values into the second values having a different expression format. 13. The device according to claim 1, wherein the transforming unit further transforms expression format of weights that are assigned to transitions in the weighted finite state automaton which has been deformed by the deforming unit. 14. The device according to claim 13, wherein the transforming unit further corrects one or more weights, from among weights subjected to transformation of expression format, in such a way that difference with post-correction values is within a permissible value. 15. The device according to claim 14, wherein the transforming unit corrects one or more weights, from among weights subjected to transformation of expression format, to randomly-selected values in such a way that difference with post-correction values is within a permissible value. 16. The device according to claim 14, wherein the weighted finite state automaton is generated based on a language model in which probabilities of appearance of words are set, and the transforming unit corrects one or more weights, from among weights subjected to transformation of expression format, to values that are based on probabilities of appearance of words assigned to corresponding transitions and that differ from post-correction values within a permissible value. 17. The device according to claim 1, wherein the deforming unit deforms a weighted finite state automaton, in which weights according to the second values are assigned to transitions, by performing a deformation operation including an operation of changing weight assigned to at least a single transition. 18. The device according to claim 1, wherein the deforming unit deforms a weighted finite state automaton, in which weights according to the second values are assigned to transitions, by performing a deformation operation including one of a determinization operation, a pushing operation, a composing operation, and an s-removal operation. 19. The device according to claim 18, wherein the deforming unit performs the determinization operation, the pushing operation, and a minimization operation in this order on a weighted finite state automaton that is obtained by performing the composing operation for composing a plurality of weighted finite state automatons in which weights according to the second values are assigned to transitions. 20. An automaton deforming method comprising: generating second values by transforming first values, which either represent weights assigned to transitions in a weighted finite state automaton or represent values that are transformed into weights assigned to transitions in a weighted finite state automaton, in such a way that number of elements of a set of the first values are reduced and an order of the first values is preserved; and deforming a weighted finite state automaton in which weights according to the second values are assigned to transitions. 21. A computer program product comprising a computer-readable medium including programmed instructions, wherein the instructions, when executed by a computer, cause the computer to function as: a transforming unit to generate second values by transforming first values, which either represent weights assigned to transitions in a weighted finite state automaton or represent values that are transformed into weights assigned to transitions in a weighted finite state automaton, in such a way that number of elements of a set of the first values are reduced and an order of the first values is preserved; and a deforming unit to deform a weighted finite state automaton in which weights according to the second values are assigned to transitions.