A Digital Ecosystem-based Framework for Math-based Search System

Sructured information is one type of web information. Text-based search engines fall short in retrieving such this type of information. For example, when a user search for x(y+x) using Google, Google retrieves documents that have xyz, x+y=z, (x+y)=xyz or any other document that contains x, y, and/or z but not x(y+x) as a stand alone expression. Google ignores the structure of the expression x(y+x) because Google is not supported with the required tools to increase the accuracy when searching for math expressions. Searching for different kinds of mathematical constructs require special processing and tools because of the nature of those expressions. For example, the structure of a mathematical expression contains much information. The structure of certain math expressions conveys the correct interpretation of those expressions. In this research, a framework for math-based search system is proposed and presented. This system is based on the digital ecosystems concepts. The detailed description of this framework is presented in the following sections. This framework supposed to provide users with promising results as will be explained.

[1]  Audretsch,et al.  The Digital Ecosystems Research Vision : 2010 and Beyond July , 2022 .

[2]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[3]  Christopher W. Fraser,et al.  BURG: fast optimal instruction selection and tree parsing , 1992, SIGP.

[4]  Bonita V. Saunders,et al.  Design of a digital mathematical library for science, technology and education , 1999, Proceedings IEEE Forum on Research and Technology Advances in Digital Libraries.

[5]  H. Boley,et al.  Digital Ecosystems: Principles and Semantics , 2007, 2007 Inaugural IEEE-IES Digital EcoSystems and Technologies Conference.

[6]  Mark T. Maybury,et al.  Information Storage and Retrieval Systems: Theory and Implementation , 2000 .

[7]  Mohammed Q. Shatnawi,et al.  Expanded grammar for detecting equivalence in math expressions , 2009, 2009 3rd IEEE International Conference on Digital Ecosystems and Technologies.

[8]  Lawrence J. Henschen,et al.  What Is Automated Theorem Proving? , 1985, J. Autom. Reason..

[10]  Abdou Youssef,et al.  Equivalence detection using parse-tree normalization for math search , 2007, 2007 2nd International Conference on Digital Information Management.

[11]  Bruce R. Miller,et al.  Technical Aspects of the Digital Library of Mathematical Functions , 2003, Annals of Mathematics and Artificial Intelligence.