Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Math Query Language with an Expanded Set of Wildcards

A Math Query Language with an Expanded Set of Wildcards Math search is a new area of research with many enabling technologies but also many challenges. Some of the enabling technologies include XML, XPath, XQuery, and MathML. Some of the challenges involve enabling search systems to recognize mathematical symbols and structures. Several math search projects have made considerable progress in meeting those challenges. One of the remaining challenges is the creation and implementation of a math query language that enables the general users to express their information needs intuitively yet precisely. This paper will present such a language and detail its features. The new math query language offers an alternative way to describe mathematical expressions that is more consistent and less ambiguous than conventional mathematical notation. In addition, the language goes beyond the Boolean and proximity query syntax found in standard text search systems. It defines a powerful set of wildcards that are deemed important for math search. These wildcards provide for more precise structural search and multi-levels of abstractions. Three new sets of wildcards and their implementation details will also be discussed. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

A Math Query Language with an Expanded Set of Wildcards

Download PDF
27 pages

Loading next page...
 
/lp/springer-journals/a-math-query-language-with-an-expanded-set-of-wildcards-Rp0lCVH0m4

References (9)

Publisher
Springer Journals
Copyright
Copyright © 2008 by Birkhäuser Verlag Basel/Switzerland
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-008-0056-4
Publisher site
See Article on Publisher Site

Abstract

Math search is a new area of research with many enabling technologies but also many challenges. Some of the enabling technologies include XML, XPath, XQuery, and MathML. Some of the challenges involve enabling search systems to recognize mathematical symbols and structures. Several math search projects have made considerable progress in meeting those challenges. One of the remaining challenges is the creation and implementation of a math query language that enables the general users to express their information needs intuitively yet precisely. This paper will present such a language and detail its features. The new math query language offers an alternative way to describe mathematical expressions that is more consistent and less ambiguous than conventional mathematical notation. In addition, the language goes beyond the Boolean and proximity query syntax found in standard text search systems. It defines a powerful set of wildcards that are deemed important for math search. These wildcards provide for more precise structural search and multi-levels of abstractions. Three new sets of wildcards and their implementation details will also be discussed.

Journal

Mathematics in Computer Science – Springer Journals

Published: Dec 5, 2008

There are no references for this article.