Operation Structural Retrieval Of Mathematical Expressions Based On Trie Tree

Different from normal text, mathematical expressions include not only symbols, but also the plenty operation structures composed of those symbols. It is helpful for users to obtain math information in more modes through retrieving these operation structure information.In this paper, an index structure of mathematical expressions based on Trie tree is proposed to achieve their operation structural retrieval through the analysis and study of operation structure of mathematical expressions in La Te X format. Firstly, different search models in modern math retrieval systems are elaborated in the two aspects of index and matching methods. Meanwhile, the structure and relevant application of Tire tree are simply described. Then operation structure index method of mathematical expressions based on Trie tree is discussed in detail, which is including feature extraction of operation structure of mathematical expressions in La Te X format and design and construction and maintenance of index structure based on Trie tree. Finally, operation structure matching algorithm is introduced based Trie tree index of mathematical expressions. The experiment verified the effectiveness of Trie tree index and matching model.