RECORDING MEDIUM WHERE TREE STRUCTURE DICTIONARY IS RECORDED AND LANGUAGE SCORE TABLE GENERATING PROGRAM FOR TREE STRUCTURE DICTIONARY

摘要

PROBLEM TO BE SOLVED: To provide a tree structure capable of suppressing a search error while efficiently reducing necessary capacity. SOLUTION: It is decided whether the number of words sharing each non-terminal node of the tree structure dictionary stored on the storage medium (the number of terminal nodes which can be reached from the non-terminal node through child nodes) is larger than a specified threshold (444) and when it exceeds the threshold, a nonapproximate bigram language score table is held (446), but when not, scores which are approximated by unigram are requested of all of the child nodes (448), so that a maximum value among obtained apprximiate scores is held as an approximate score of the non-terminal node (450). COPYRIGHT: (C)2005,JPO&NCIPI