A Math Query Language with an Expanded Set of Wildcards |
| |
Authors: | Moody Ebrahem Altamimi Abdou Youssef |
| |
Institution: | (1) Department of Computer Science, The George Washington University, Washington, DC 20052, USA |
| |
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.
|
| |
Keywords: | Mathematics Subject Classification (2000)" target="_blank">Mathematics Subject Classification (2000) 68N99 |
本文献已被 SpringerLink 等数据库收录! |