| 摘要 |
PROBLEM TO BE SOLVED: To reduce a memory capacity for a data structure representing a paragraph tree.SOLUTION: A program includes: first data corresponding to the paragraph tree; second data regarding characters or character strings corresponding to nodes of the paragraph tree; and third data regarding hierarchies of the paragraph tree. Regarding each of the nodes, in the first data, data making correspondent a code of a master node of the node or a maximum code among codes of slave nodes of the node, a code of the character represented by the node and the hierarchy to which the node belongs are arranged in an order of codes of each node. Regarding each of the nodes in each of the hierarchies after a second hierarchy of the paragraph tree, the second data includes codes of characters or character strings corresponding to the node in an order of codes of the node. Regarding each of the hierarchies after the second hierarchy of the paragraph tree, the third data includes data making correspondent the number of nodes belonging to the hierarchy, a minimum code among codes of nodes belonging to the hierarchy, and an offset value of an arrangement position of a character or a character string corresponding to the minimum code from a head in the second data.SELECTED DRAWING: Figure 3 |
