| 摘要 |
PROBLEM TO BE SOLVED: To provide a dictionary device, a morpheme analysis device, data structure, a method and a program of morpheme analysis capable of canceling candidates which do not satisfy conditions in the respective nodes, and improving efficiency of processing in morpheme analysis.SOLUTION: In a dictionary device 120 for morpheme analysis which stores data on character strings by structure based on a trie branching from a root to leaves, characters or partial character strings constituting morphemes are stored by being associated with the branches, at least information on a character or partial a character string associated with a branch closest to a root side of nodes connecting the branches is stored by being associated with all the nodes. Thus, a morpheme analysis device can refer to information regarding reading from the head to the middle of registered morphemes in the middle of common prefix search. |
