Semantic Parsing of Mathematics by Context-based Learning from Aligned Corpora and Theorem Proving

11/29/2016
by   Cezary Kaliszyk, et al.
0

We study methods for automated parsing of informal mathematical expressions into formal ones, a main prerequisite for deep computer understanding of informal mathematical texts. We propose a context-based parsing approach that combines efficient statistical learning of deep parse trees with their semantic pruning by type checking and large-theory automated theorem proving. We show that the methods very significantly improve on previous results in parsing theorems from the Flyspeck corpus.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/14/2016

DeepMath - Deep Sequence Models for Premise Selection

We study the effectiveness of neural sequence models for premise selecti...
research
08/29/2018

Comparison of Two Theorem Provers: Isabelle/HOL and Coq

The need for formal definition of the very basis of mathematics arose in...
research
09/18/2012

Theorem Proving in Large Formal Mathematics as an Emerging AI Field

In the recent years, we have linked a large corpus of formal mathematics...
research
02/02/2021

Pecan: An Automated Theorem Prover for Automatic Sequences using Büchi Automata

Pecan is an automated theorem prover for reasoning about properties of S...
research
05/14/2014

Developing Corpus-based Translation Methods between Informal and Formal Mathematics: Project Description

The goal of this project is to (i) accumulate annotated informal/formal ...
research
06/20/2019

Designing Game of Theorems

"Theorem proving is similar to the game of Go. So, we can probably impro...
research
10/04/2021

SPaR.txt, a cheap Shallow Parsing approach for Regulatory texts

Automated Compliance Checking (ACC) systems aim to semantically parse bu...

Please sign up or login with your details

Forgot password? Click here to reset