Parsing update

Accuracy with only 3 binary training types

All classes binary

Accuracy didn't increase.

Parsing

My parser now creates a syntax tree as a list of tuples. 

I've found this blog post to be very useful.

The form it outputs is like this:

('EXP', 

   [('QUANT', ' \\forall ', ' x', 

      ('BINOP', ' \\in', ('VAR', ' x'),

          ('BINOP', ' \\leftrightarrow', ('VAR', ' y'), 

              ('BINOP', ' \\subset', ('VAR', ' x'), ('VAR', ' y')

              )

           )

       )

    )]

)

This works for correctly classified examples from the first order logic.

TODO:

Parser:

   1) Add rules with positional information for {super,sub} scripts

   2) Figure out how to tree and print out LaTeX

   3) Add a dummy rules/node-types for when the classifier makes mistakes

   4) Figure out how to add back-off rules to make more possible trees,

          figure out how to select one as the most probable tree

Classifier:

    Add sigma and integral signs

    cross-validation!!!

    play with different settings.

Extraction:

    Output positional information