As mentioned in the comments in this thread, it certainly seems useful for non-math-heavy papers. I tried it on a data-structures paper I've been reading: Tree-

As mentioned in the comments in this thread, it certainly seems useful for non-math-heavy papers. I tried it on a data-structures paper I've been reading: Tree-Independent Dual-Tree Algorithms (https://arxiv.org/pdf/1304.4327.pdf https://arxiv.org/pdf/1304.4327.pdf), and I noticed that it had difficulty interpreting notations. For instance, it got confused between the set of descendant points and the set of points of a node. Nevertheless, it seems to have a lot of potentials. Thanks for building this!