# Extracting mathematical semantics from LATEX documents

@article{Stuber2003ExtractingMS, title={Extracting mathematical semantics from LATEX documents}, author={J{\"u}rgen Stuber and Mark van den Brand}, journal={Lecture Notes in Computer Science}, year={2003}, pages={160-173} }

We report on a project to use SGLR parsing and term rewriting with ELAN4 to extract the semantics of mathematical formulas from a LATEX document and representing them in MathML. [...] Key Method The SGLR parser can parse general context-free languages, which suffices to extract the structure of mathematical formulas from calculus that are written in the usual mathematical style, with most parentheses and multiplication signs omitted. The parse tree is then rewritten into a more concise and uniform internal… Expand

#### 11 Citations

Transforming Large Collections of Scientific Publications to XML

- Computer Science
- Math. Comput. Sci.
- 2010

The first task of the arXMLiv project is to develop LaTeXML bindings for the (thousands of) LaTEX classes and packages used in the arχiv collection, as well as methods for coping with the eccentricities that TEX encourages. Expand

Mathematical Extension of Full Text Search Engine Indexer

- Computer Science
- 2008 3rd International Conference on Information and Communication Technologies: From Theory to Applications
- 2008

This work presents a technique how to index real-world scientific documents containing mathematical notation by exploiting the current state-of-art of full text search engines and is primarily intended for documents on the WWW, which are mostly semantically poor. Expand

Using as a Semantic Markup Format

- Computer Science
- Math. Comput. Sci.
- 2008

This work analyzes the current practice of semi-semantic markup in documents and extends it by a markup infrastructure that allows to embed semantic annotations into documents without changing their visual appearance, essentially turning into an MKM format. Expand

Transforming the arXiv to XML

- Computer Science
- AISC/MKM/Calculemus
- 2008

An experiment of transforming large collections of documents to more machine-understandable representations using the to XML converter, which has continuously improved its success rate to more than 56%. Expand

Context classification for improved semantic understanding of mathematical formulae

- Computer Science
- 2018

A novel approach for principal extraction of semantic information of mathematical formulae from their context in documents is presented and a new approach to feature representation depending on the definitions' templates that extracted from maths documents to defeat the restraint of conventional window-based features is developed. Expand

Using L A T E X as a Semantic Markup Format

- Computer Science
- 2008

This work evaluates the sTEX macro collection on a large case study: the course materials of a two-semester course in Computer Science was annotated se- mantically and converted to the OMDoc MKM format by Bruce Miller's LaTeXML system. Expand

Web-based notation of mathematical text preserving semantics for scientific and educational communication

- Computer Science
- 2013 IEEE 7th International Conference on Intelligent Data Acquisition and Advanced Computing Systems (IDAACS)
- 2013

A visualization of notation for browsers and its export to standard formats TeX, Content MathML and PDF is developed, which provides interactive communication over the Internet, as well as compatibility and interoperability of prepared texts in other applications. Expand

Representation, handling and recognition of mathematical objects: state of the art

- Computer Science
- RCIS
- 2009

This paper tries to define, present, and modify mathematical objects, and presents a short review on standards and systems of presentation, engineering and approaches of physical and logical segmentations, detection systems and methods of mathematical objects isolated or inserted in text, structures and method of representation for different recognition approaches. Expand

Mathematical search engine

- 2007

Title: Mathematical search engine Author: Jozef Mišutka Department: Department of Software Engineering Supervisor: RNDr. Leo Galamboš, Ph.D. Supervisor’s e-mail address: leo.galambos@mff.cuni.cz… Expand

Representation, handling and recognition of mathematical objects: State of the art

- Computer Science
- 2009 Third International Conference on Research Challenges in Information Science
- 2009

This paper tries to define, present, and modify mathematical objects, and presents a short review on standards and systems of presentation, engineering and approaches of physical and logical segmentations, detection systems and methods of mathematical objects isolated or inserted in text, structures and method of representation for different recognition approaches. Expand

#### References

SHOWING 1-10 OF 30 REFERENCES

Generating robust parsers using island grammars

- Computer Science
- Proceedings Eighth Working Conference on Reverse Engineering
- 2001

It is shown how island grammars can be used to generate robust parsers that combine the accuracy of syntactical analysis with the speed, flexibility and tolerance usually only found in lexical analysis. Expand

Disambiguation Filters for Scannerless Generalized LR Parsers

- Computer Science
- CC
- 2002

This combination of generalized LR parsing and scannerless parsing supports syntax definitions in which all aspects of the syntax of a language are defined explicitly in one formalism, thus allowing a natural syntax tree structure. Expand

Object-oriented Tree Traversal with JJForester

- Computer Science, Mathematics
- Electron. Notes Theor. Comput. Sci.
- 2001

JJForester is implemented, a tool that generates class structures from{sc Sdf grammar definitions that implement a number of emph{design patterns to facilitate construction and traversal of parse trees represented by object structures. Expand

Efficient annotated terms

- Computer Science, Mathematics
- Softw. Pract. Exp.
- 2000

This work introduces the abstract data type of Annotated Terms (ATerms) and discusses their design, implementation and application. Expand

A Pattern Matching Compiler for Multiple Target Languages

- Computer Science
- CC
- 2003

This paper introduces a pattern matching compiler (TOM): a set of primitives which add pattern matching facilities to imperative languages such as C, Java, or Eiffel, and shows that this tool is extremely non-intrusive, lightweight and useful to implement tree transformations. Expand

Language Prototyping: An Algebraic Specification Approach

- Computer Science
- AMAST Series in Computing
- 1996

This volume presents an algebraic specification approach to language prototyping; and is centered around the ASF+SDF formalism and Meta-Environment. Expand

Proofs from THE BOOK

- Computer Science, Mathematics
- 1998

This revised and enlarged fifth edition features four new chapters, which contain highly original and delightful proofs for classics such as the spectral theorem from linear algebra, some more recent… Expand

Taschenbuch der Mathematik

- Computer Science
- 1966

This paper presents a meta-analyses of the statistical methods used to estimate the Boltzmann inequality, a measure of the uncertainty in the solutions to the inequality of the discrete-time equations. Expand

Digital Library of Mathematical Functions, chapter Airy and Related Functions

- National Institute of Standards and Technology,
- 2001

Digital Library of Mathematical Functions, chapter Airy and Related Functions. National Institute of Standards and Technology

- Digital Library of Mathematical Functions, chapter Airy and Related Functions. National Institute of Standards and Technology
- 2001