4. A computer apparatus for performing morphological analysis of natural language sentences, comprising: a word candidate retrieving means for retrieving words of a natural language sentence from a word dictionary; a concatenation rule retrieving means for retrieving concatenation rules for concatenation of words from a grammar dictionary based on a part of speech of each word retrieved by said word candidate retrieving means; and a searching means for searching for an optimal solution of morphological analysis by creating an automaton corresponding to the natural language sentence based on the words retrieved by said word candidate retrieving means and the concatenation rules retrieved by said concatenation rule retrieving means; wherein said searching means generates, responsive to an input word entered into the automaton, states necessary for transition according to the concatenation rules corresponding to the input word without generating any state that is transited by pursuing a null transition succeeding the generated states.
4. A computer apparatus for performing morphological analysis of natural language sentences, comprising: a word candidate retrieving means for retrieving words of a natural language sentence from a word dictionary; a concatenation rule retrieving means for retrieving concatenation rules for concatenation of words from a grammar dictionary based on a part of speech of each word retrieved by said word candidate retrieving means; and a searching means for searching for an optimal solution of morphological analysis by creating an automaton corresponding to the natural language sentence based on the words retrieved by said word candidate retrieving means and the concatenation rules retrieved by said concatenation rule retrieving means; wherein said searching means generates, responsive to an input word entered into the automaton, states necessary for transition according to the concatenation rules corresponding to the input word without generating any state that is transited by pursuing a null transition succeeding the generated states. 7. The apparatus according to claim 4 , wherein said searching means, responsive to entry of an input word in the automaton, searches a concatenation rule, a transition source of which is a just-previously generated state, from among the concatenation rules regarding the input word retrieved by said concatenation rule retrieving means.