| 摘要 |
PROBLEM TO BE SOLVED: To deepen the degree of relation for a classified word as well and to improve the accuracy of chain probability by semantically classifying the word according to a thesaurus. SOLUTION: A processing block 3 divides the pair of input sentences into respective three parts and by exchanging these parts, a non-semantic sentence is generated. A morpheme analytic block 2 divides the pair of generated non- semantic sentences for the unit of a word. A storage block 4 stores the thesaurus. A word classifying block 6 converts a word to a class code based on the thesaurus. A storage block 8 stores the table of trigram probability between classes. A processing block 10 calculates Perplexity based on the class trigram concerning the set of all the generated non-semantic sentences and selects the set of non-semantic sentences having the highest Perplexity. Thus, the classification of the thesaurus is stored and according to this classification of the thesaurus, the word is classified. |
