计算机工程2017，Vol.43Issue(6)：129-135,7.DOI:10.3969/j.issn.1000-3428.2017.06.022
基于互关联后继树的数学表达式检索
Mathematical Expression Retrieval Based on Inter-relevant Successive Tree
摘要
Abstract
Aiming at the difficulties in achieving retrieval that result from the diversity of the mathematical expression structure,a method of mathematical expression indexing and retrieval is proposed.Through analysis and induction of LaTeX mathematical expression's characteristics,a mathematical expression feature representation way is defined for the two-dimensional structure characteristic in the indexing stage.And the inter-relevant successive tree indexing pattern is applied to the construction of the mathematical expression indexing,so as to solve the problem of the hierarchical growth of the tree structure representation.In the matching stage,the matching algorithm of query pattern which includes exact matching,compatible matching,sub-expression matching and fuzzy matching is designed.In the browser/server mode,51 076 mathematical expressions are used in the experiment of indexing and matching.The results show the designed indexing and retrieval method accelerates the query speed and reduces the storage space,which can adapt the structure characteristics of the mathematical expression and achieve better retrieval effect.关键词
数学表达式/索引/检索/LaTeX格式/互关联后继树Key words
mathematical expression/indexing/retrieval/LaTeX format/inter-relevant successive tree分类
信息技术与安全科学引用本文复制引用
刘惠丛,田冰洁,田学东..基于互关联后继树的数学表达式检索[J].计算机工程,2017,43(6):129-135,7.基金项目
国家自然科学基金(61375075) （61375075）
河北省高等学校科学技术研究重点项目(ZD2017208). （ZD2017208）
