Invariant Representation of Mathematical Expressions
This addresses a domain-specific problem for mathematical expression processing, with incremental improvements over existing methods.
The paper tackles the problem of comparing mathematical expression strings, where existing natural language methods fail, by proposing a structural encoding method that is invariant to semantically irrelevant variations.
While there exist many methods in machine learning for comparison of letter string data, most are better equipped to handle strings that represent natural language, and their performance will not hold up when presented with strings that correspond to mathematical expressions. Based on the graphical representation of the expression tree, here we propose a simple method for encoding such expressions that is only sensitive to their structural properties, and invariant to the specifics which can vary between two seemingly different, but semantically similar mathematical expressions.