Parsing and disambiguation of symbolic mathematics in the Naproche system

Authors:
Marcos Cramer;Peter Koepke;Bernhard Schröder
Affiliations:
University of Bonn and University of Duisburg, Essen;University of Bonn and University of Duisburg, Essen;University of Bonn and University of Duisburg, Essen
Venue:
MKM'11 Proceedings of the 18th Calculemus and 10th international conference on Intelligent computer mathematics
Year:
2011

Citing 4
Cited 0

Knowledge Representation and Reasoning

Knowledge Representation and Reasoning
A formally verified proof of the prime number theorem

ACM Transactions on Computational Logic (TOCL)
System for Automated Deduction (SAD): A Tool for Proof Verification

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
The naproche project controlled natural language proof checking of mathematical texts

CNL'09 Proceedings of the 2009 conference on Controlled natural language

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Naproche system is a system for linguistically analysing and proof-checking mathematical texts written in a controlled natural language. The aim is to have an input language that is as close as possible to the language that mathematicians actually use when writing textbooks or papers. Mathematical texts consist of a combination of natural language and symbolic mathematics, with symbolic mathematics obeying its own syntactic rules. We discuss the difficulties that a program for parsing and disambiguating symbolic mathematics must face and present how these difficulties have been tackled in the Naproche system. One of these difficulties is the fact that information provided in the preceding context - including information provided in natural language - can influence the way a symbolic expression has to be disambiguated.