Mathematical Equation Structural Syntactical Similarity Patterns: A Tree Overlapping Algorithm and Its Evaluation

Abstract

In this paper we examine mathematical equations structural syntactical similarity patterns. The major focus of this contribution is an NLP tree overlapping algorithm modication adopted to the case of syntactical similarity of mathematical equations presented in MathML. We describe the software implementation and the tests arranged for the cases of both structural and subexpression based similarity. The paper also contains a discussion of algorithm evaluation problems conditioned by the lack of relevant syntac tical similarity centered equation corpora.

Authors

  • Evgeny Pyshkin University of Aizu
  • Mikhail Ponomarev Peter the Great St. Petersburg Polytechnic University

Downloads

Published

12/23/2016

How to Cite

Pyshkin, E., & Ponomarev, M. (2016). Mathematical Equation Structural Syntactical Similarity Patterns: A Tree Overlapping Algorithm and Its Evaluation. Informatica, 40(4). Retrieved from https://www.informatica.si/index.php/informatica/article/view/1461

Issue

Vol. 40 No. 4 (2016)

Section

Special issue papers

License

Authors retain copyright in their work. By submitting to and publishing with Informatica, authors grant the publisher (Slovene Society Informatika) the non-exclusive right to publish, reproduce, and distribute the article and to identify itself as the original publisher.

All articles are published under the Creative Commons Attribution license CC BY 3.0. Under this license, others may share and adapt the work for any purpose, provided appropriate credit is given and changes (if any) are indicated.

Authors may deposit and share the submitted version, accepted manuscript, and published version, provided the original publication in Informatica is properly cited.