View Proposal

---

Proposer

Joe Wells

Title

automatically gather samples of certain mathematical notations

Goal

Description

The supervisor of this project is trying to develop general theories of mathematical texts. As part of this, it is necessary to see what computer scientists, logician, mathematicians, etc., actually write. Search engines are great for finding documents by the words or phrases they use. However, they are not much use for searching for instances of BNF-like notation (M, N ::= x | lam x. M | M N), or set comprehensions ({ x | exists y. (x,y) in S }), or ellipses (x = (y1, ..., yn)), or other mathematical notations. This project is about developing programs to process documents to gather samples of the various forms of these and similar notations.

Resources

Background

document formats (PDF, LaTeX, Word), parsing, machine learning

Url

Difficulty Level

Variable

Ethical Approval

None

Number Of Students

1

Supervisor

Joe Wells

Keywords

Degrees

Bachelor of Science in Computer Science
Master of Engineering in Software Engineering
Master of Science in Artificial Intelligence
Master of Science in Computing (2 Years)
Master of Science in Data Science
Master of Science in Software Engineering
Bachelor of Science in Computing Science