By Topic

Equivalence detection using parse-tree normalization for math search

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Shatnawi, Mohammed ; Department of Computer Info. Systems, Jordan University of Science and Tech., Jordan-Irbid (22110)-P.O.Box (3030), Jordan ; Youssef, A.

In recent years, efforts have begun to put math contents on the Web. As for other types of Web information, search capabilities should be provided to enable users to find what they need because without the ability to search the data for specific items, the data is useless. Conventional (i.e. textbased or even multimedia-based) search engines fall short of providing math-search capabilities. Preliminary efforts to create math-search systems have started, and many of the issues and the challenges for building such systems have been identified. One of the more difficult challenges is the detection of mathematical equivalence between expression in users’ queries and expressions in math contents. The purpose of this research is to develop techniques and algorithm for equivalence-detection based math search. In particular, this research aims to explore some proposed normalization rules, then to develop a general way that can be utilized to transform both the repository contents and users’ input expressions into a unified normalized form.

Published in:

Digital Information Management, 2007. ICDIM '07. 2nd International Conference on  (Volume:2 )

Date of Conference:

28-31 Oct. 2007