首页> 外文会议>International Conference on Digital Information Management >Equivalence Detection Using Parse-tree Normalization for Math Search
【24h】

Equivalence Detection Using Parse-tree Normalization for Math Search

机译:使用Parse-Tree标准化进行数学搜索的等价检测

获取原文
获取外文期刊封面目录资料

摘要

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. text-based 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.
机译:近年来,努力已经开始将数学内容放在网络上。对于其他类型的Web信息,应提供搜索功能以使用户能够找到所需的内容,因为没有搜索特定项的数据,数据是没用的。常规(即,基于文本的甚至基于多媒体的)搜索引擎缺少提供数学搜索功能。创建数学搜索系统的初步努力已经开始,并且已经确定了许多问题和建立此类系统的挑战。一个更困难的挑战之一是检测用户在数学内容中的表达式和表达式中的表达式之间的数学等效。该研究的目的是开发基于等同的物算的数学数学搜索技术和算法。特别是,该研究旨在探讨一些提议的正常化规则,然后开发一种可以用于将存储库内容和用户输入表达式转换为统一的归一化表单的一般方式。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利